9 papers
Stationary point complexity via minimal supersymmetry breaking
Jaron Kent-Dobias
The statistics of stationary points are a powerful way to understand mean-field random landscapes, and the Kac--Rice formula is a general way to compute them. A longstanding techni…
Structure of solutions to continuous constraint satisfaction problems through the statistics of wedged and inscribed spheres
Jaron Kent-Dobias
The study of random landscapes has long relied on counting stationary points: metastable states and the barriers between them. However, this method is useless for describing flat r…
Very persistent random walkers reveal transitions in landscape topology
Jaron Kent-Dobias
We study the typical behavior of random walkers on the microcanonical configuration space of mean-field disordered systems. Passive walks have an ergodicity-breaking transition at…
On the topology of solutions to random continuous constraint satisfaction problems
Jaron Kent-Dobias
We consider the set of solutions to random polynomial equations whose variables are restricted to the -sphere. Each equation has independent Gaussian coefficients an…
Log-correlated color in Monet's paintings
Jaron Kent-Dobias
We describe evidence for logarithmic correlations within the paintings of Claude Monet.
Complex complex landscapes
Jaron Kent-Dobias, Jorge Kurchan
We study the saddle-points of the -spin model -- the best understood example of a `complex' (rugged) landscape -- when its variables are complex. These points are the soluti…