42 citations · 163 across the 21 of their papers we have counts for
21 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…
Algorithm-independent bounds on complex optimization through the statistics of marginal optima
Jaron Kent-Dobias
Optimization seeks extremal points in a function. When there are superextensively many optima, optimization algorithms are liable to get stuck. Under these conditions, generic algo…
Conditioning the complexity of random landscapes on marginal optima
Jaron Kent-Dobias
Marginal optima are minima or maxima of a function with many nearly flat directions. In settings with many competing optima, marginal ones tend to attract algorithms and physical d…
Origin of Symmetry Breaking in the Grasshopper Model
David Llamas, Jaron Kent-Dobias, Kun Chen +2
The planar grasshopper problem, originally introduced in (Goulko & Kent 2017 Proc. R. Soc. A 473, 20170494), is a striking example of a model with long-range isotropic interactions…
When is the average number of saddle points typical?
Jaron Kent-Dobias
A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their…
Arrangement of nearby minima and saddles in the mixed spherical energy landscapes
Jaron Kent-Dobias
The mixed spherical models were recently found to violate long-held assumptions about mean-field glassy dynamics. In particular, the threshold energy, where most stationary points…
Normal forms, universal scaling functions, and extending the validity of the RG
James P. Sethna, David Hathcock, Jaron Kent-Dobias +1
Our community has a deep and sophisticated understanding of phase transitions and their universal scaling functions. We outline and advocate an ambitious program to use this unders…
Log-correlated color in Monet's paintings
Jaron Kent-Dobias
We describe evidence for logarithmic correlations within the paintings of Claude Monet.
How to count in hierarchical landscapes: a 'full' solution to mean-field complexity
Jaron Kent-Dobias, Jorge Kurchan
We derive the general solution for counting the stationary points of mean-field complex landscapes. It incorporates Parisi's solution for the ground state, as it should. Using this…
Analytic continuation over complex landscapes
Jaron Kent-Dobias, Jorge Kurchan
In this paper we follow up the study of 'complex complex landscapes,' rugged landscapes of many complex variables. Unlike real landscapes, the classification of saddles by index is…
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…
Glass phenomenology in the hard matrix model
J. Dong, V. Elser, G. Gyawali +5
We introduce a new toy model for the study of glasses: the hard-matrix model (HMM). This may be viewed as a single particle moving on , where there is a potential p…
Visualizing probabilistic models in Minkowski space with intensive symmetrized Kullback-Leibler embedding
Han Kheng Teoh, Katherine N. Quinn, Jaron Kent-Dobias +3
We show that the predicted probability distributions for any -parameter statistical model taking the form of an exponential family can be explicitly and analytically embedded is…
Elastic properties of hidden order in URuSi are reproduced by a staggered nematic
Jaron Kent-Dobias, Michael Matty, Brad Ramshaw
We develop a phenomenological mean field theory describing the hidden order phase in URuSi as a nematic of the representation staggered…
Cluster representations and the Wolff algorithm in arbitrary external fields
Jaron Kent-Dobias, James P Sethna
We introduce a natural way to extend celebrated spin-cluster Monte Carlo algorithms for fast thermal lattice simulations at criticality, like Wolff, to systems in arbitrary fields,…
Smooth and global Ising universal scaling functions
Jaron Kent-Dobias, James P. Sethna
We describe a method for approximating the universal scaling functions for the Ising model in a field. By making use of parametric coordinates, the free energy scaling function has…
Normal form for renormalization groups
Archishman Raju, Colin B. Clement, Lorien X. Hayden +4
The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and lo…
Energy Driven Pattern Formation in Planar Dipole-Dipole Systems in the Presence of Weak Noise
Jaron Kent-Dobias, Andrew J. Bernoff
We study pattern formation in planar fluid systems driven by intermolecular cohesion (which manifests as a line tension) and dipole-dipole repulsion which are observed in physical…