162 citations · 853 across the 40 of their papers we have counts for
7 papers · 1 filter
Limits of discrete distributions and Gibbs measures on random graphs
Amin Coja-Oghlan, Will Perkins, Kathrin Skubch
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we constru…
Hypergraph coloring up to condensation
Peter Ayre, Amin Coja-Oghlan, Catherine Greenhill
Improving a result of Dyer, Frieze and Greenhill [Journal of Combinatorial Theory, Series B, 2015], we determine the -colorability threshold in random -uniform hypergraphs up…
The condensation phase transition in the regular -SAT model
Victor Bapst, Amin Coja-Oghlan
Much of the recent work on random constraint satisfaction problems has been inspired by ingenious but non-rigorous approaches from physics. The physics predictions typically come i…
The minimum bisection in the planted bisection model
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
In the planted bisection model a random graph with vertices is created by partitioning the vertices randomly into two classes of equal size (up to ). Any…
Harnessing the Bethe free energy
Victor Bapst, Amin Coja-Oghlan
A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite doma…
How does the core sit inside the mantle?
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
The -core, defined as the largest subgraph of minimum degree , of the random graph has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCT…