17 citations · 26 across the 6 of their papers we have counts for
4 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…
The core in random hypergraphs and local weak convergence
Kathrin Skubch
The degree of a vertex in a hypergraph is defined as the number of edges incident to it. In this paper we study the -core, defined as the maximal induced subhypergraph of minimu…
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…
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…