Search NASA⌕ Search

Engineering topics

Zdeborova, Lenka

Publications and source records attributed to Zdeborova, Lenka.

Quiet planting in the locked constraints satisfaction problems

We study the planted ensemble of locked constraint satisfaction problems. We describe the connection between the random and planted ensembles. The use of the cavity method is combined with arguments from reconstruction on trees and first and second moment considerations; in particular the connection with the reconstruction on trees appears to be crucial. Our main result is the location of the hard region in the planted ensemble, thus providing hard satisfiable benchmarks. In a part of that hard region instances have with high probability a single satisfying assignment.

97 MATHEMATICS AND COMPUTING↗

Tracking particles by passing messages between images

Methods to extract information from the tracking of mobile objects/particles have broad interest in biological and physical sciences. Techniques based on the simple criterion of proximity in time-consecutive snapshots are useful to identify the trajectories of the particles. However, they become problematic as the motility and/or the density of the particles increases because of the uncertainties on the trajectories that particles have followed during the acquisition time of the images. Here, we report efficient methods for learning parameters of the dynamics of the particles from their positions in time-consecutive images. Our algorithm belongs to the class of message-passing algorithms, also known in computer science, information theory and statistical physics under the name of Belief Propagation (BP). The algorithm is distributed, thus allowing parallel implementation suitable for computations on multiple machines without significant inter-machine overhead. We test our method on the model example of particle tracking in turbulent flows, which is particularly challenging due to the strong transport that those flows produce. Our numerical experiments show that the BP algorithm compares in quality with exact Markov Chain Monte-Carlo algorithms, yet BP is far superior in speed. We also suggest and analyze a random-distance model that provides theoretical justification for BP accuracy. Methods developed here systematically formulate the problem of particle tracking and provide fast and reliable tools for its extensive range of applications.

99 GENERAL AND MISCELLANEOUS↗

Following Gibbs states adiabatically: the energy landscape of mean field glassy systems

We introduce a generalization of the cavity, or Bethe-Peierls, method that allows to follow Gibbs states when an external parameter, e.g. the temperature, is adiabatically changed. This allows to obtain new quantitative results on the static and dynamic behavior of mean field disordered systems such as models of glassy and amorphous materials or random constraint satisfaction problems. As a first application, we discuss the residual energy after a very slow annealing, the behavior of out-of-equilibrium states, and demonstrate the presence of temperature chaos in equilibrium. We also explore the energy landscape, and identify a new transition from an computationally easier canyons-dominated region to a harder valleys-dominated one.

36 MATERIALS SCIENCE↗

Message passing for integrating and assessing renewable generation in a redundant power grid

A simplified model of a redundant power grid is used to study integration of fluctuating renewable generation. The grid consists of large number of generator and consumer nodes. The net power consumption is determined by the difference between the gross consumption and the level of renewable generation. The gross consumption is drawn from a narrow distribution representing the predictability of aggregated loads, and we consider two different distributions representing wind and solar resources. Each generator is connected to D consumers, and redundancy is built in by connecting R {le} D of these consumers to other generators. The lines are switchable so that at any instance each consumer is connected to a single generator. We explore the capacity of the renewable generation by determining the level of 'firm' generation capacity that can be displaced for different levels of redundancy R. We also develop message-passing control algorithm for finding switch sellings where no generator is overloaded.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hiding quiet solutions in random constraint satisfaction problems

We study constraint satisfaction problems on the so-called planted random ensemble. We show that for a certain class of problems, e.g., graph coloring, many of the properties of the usual random ensemble are quantitatively identical in the planted random ensemble. We study the structural phase transitions and the easy-hard-easy pattern in the average computational complexity. We also discuss the finite temperature phase diagram, finding a close connection with the liquid-glass-solid phenomenology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗