Add to ORKGWe 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 solution, we count the stationary points of two models: one with multi-step replica symmetry breaking, and one with full replica symmetry breaking
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of en...
We analyze the energy barriers that allow escapes from a given local minimum in a complex high-dimen...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
We review recent developments on the characterization of random landscapes in high-dimension. We foc...
Motivated by the recently observed phenomenon of topology trivialization of potential energy landsca...
In this paper we follow up the study of 'complex complex landscapes,' rugged landscapes of many comp...
A common measure of a function's complexity is the count of its stationary points. For complicated f...
International audienceWe study rough high-dimensional landscapes in which an increasingly stronger p...
Over the past ten years, methods from statistical physics have provided a deeper inside into the ave...
We introduce a model for a sandpile, with N sites, critical height N and each site connected to ever...
A long-standing question in geomorphology concerns the extent that statistical models of terrain ele...
We show that similarly to the logarithmic mean-velocity profile in wall-bounded turbulence, the land...
Abstract We present an explicit solution of a simply stated, yet unsolved, combinatorial problem, ...
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree an...
Empirical studies have revealed scaled structure on a variety of landscapes. Understanding processes...
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of en...
We analyze the energy barriers that allow escapes from a given local minimum in a complex high-dimen...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
We review recent developments on the characterization of random landscapes in high-dimension. We foc...
Motivated by the recently observed phenomenon of topology trivialization of potential energy landsca...
In this paper we follow up the study of 'complex complex landscapes,' rugged landscapes of many comp...
A common measure of a function's complexity is the count of its stationary points. For complicated f...
International audienceWe study rough high-dimensional landscapes in which an increasingly stronger p...
Over the past ten years, methods from statistical physics have provided a deeper inside into the ave...
We introduce a model for a sandpile, with N sites, critical height N and each site connected to ever...
A long-standing question in geomorphology concerns the extent that statistical models of terrain ele...
We show that similarly to the logarithmic mean-velocity profile in wall-bounded turbulence, the land...
Abstract We present an explicit solution of a simply stated, yet unsolved, combinatorial problem, ...
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree an...
Empirical studies have revealed scaled structure on a variety of landscapes. Understanding processes...
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of en...
We analyze the energy barriers that allow escapes from a given local minimum in a complex high-dimen...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...