106 citations · 431 across the 57 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.PR2018
The algorithmic hardness threshold for continuous random energy models
Louigi Addario-Berry, Pascal Maillard
We prove an algorithmic hardness result for finding low-energy states in the so-called \emph{continuous random energy model (CREM)}, introduced by Bovier and Kurkova in 2004 as an…
math.PR2018★ 5 cited
Geometry of the minimal spanning tree of a random -regular graph
Louigi Addario-Berry, Sanchayan Sen
The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about…