Finite size scaling for the core of large random hypergraphs

  title={Finite size scaling for the core of large random hypergraphs},
  author={Amir Dembo and Andrea Montanari},
  journal={Annals of Applied Probability},
  • A. Dembo, A. Montanari
  • Published 1 February 2007
  • Computer Science, Mathematics
  • Annals of Applied Probability
The (two) core of an hyper-graph is the maximal collection of hyper-edges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over GF[2], or iterative decoding of low-density parity-check codes used over the binary erasure channel. Similar structures emerge in a variety of NP-hard combinatorial optimization and decision problems, from vertex cover to satisfiability. For a uniformly chosen random hyper-graph of m = nρ vertices… 

Figures from this paper

Phase transition of random non-uniform hypergraphs
Random 2-XORSAT at the Satisfiability Threshold
This study relies on the symbolic method and analytical tools coming from generating function theory which enable it to describe the evolution of n1/12 p(n, n/2(1 + µn-1/3)) as a function of µ.
Loose Cores and Cycles in Random Hypergraphs
Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structure which mirrors the close relationship between cycles and 2-cores in graphs. We prove that
The core in random hypergraphs and local weak convergence
The degree of a vertex in a hypergraph is defined as the number of edges incident to it. In this paper we study the $k$-core, defined as the maximal induced subhypergraph of minimum degree $k$, of
The slope scaling parameter for general channels, decoders, and ensembles
The aim is to provide an easily usable finite-length optimization tool that is applicable to the wide variety of channels, blocklengths, error probability requirements, and decoders that one encounters for practical systems.
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Some numerical results are presented, indicating that the choice of the label group strongly affects the value of the typical minimum distance, and lower bounds are provided for the typical asymptotic normalized minimum distance.
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
This work answers the question exactly when d is at least three as to the size μ(G) of the largest matching in G, when considered in the context of Cuckoo Hashing.
Core forging and local limit theorems for the k-core of random graphs
Expected Maximum Block Size in Critical Random Graphs
The symbolic method and analytic tools from generating function theory are relied on to describe the evolution of n-1/3, the maximum block size of G(n,M), the maximum size of its maximal 2-connected induced subgraphs as a function of λ.
Finite-length scaling of turbo-like code ensembles on the binary erasure channel
  • I. Andriyanova
  • Computer Science
    IEEE Journal on Selected Areas in Communications
  • 2009
This paper focuses on the finite-length performance of turbo-like codes, by applying the scaling approach to this case, and conjecture the scaling law and derive its scaling parameter.


Critical random hypergraphs: The emergence of a giant set of identifiable vertices
We consider a model for random hypergraphs with idemifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random
Essential edges in Poisson random hypergraphs
The limiting proportion of essential hyperedges is established, in the case of a random graph, the relation of essential edges to the 2-core of thegraph, the maximal sub-graph with minimal vertex degree 2.
On the solution-space geometry of random constraint satisfaction problems
It is proved that much before solutions disappear, they organize into an exponential number of clusters, each of which is relatively small and far apart from all other clusters, which gives a satisfying intuitive explanation for the failure of the polynomial-time algorithms analyzed so far.
The Birth of the Giant Component
A “uniform” model of random graphs, which allows self-loops and multiple edges, is shown to lead to formulas that are substanitially simpler than the analogous formulas for the classical random graphs of Erdos and Renyi.
Cores in random hypergraphs and Boolean formulas
A technique for determining the thresholds for the appearance of cores in random structures is described and the threshold for the pure literal rule to find a satisfying assignment for a random instance of r‐SAT, r ≥ 3 is determined.
Structure of large random hypergraphs
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov processes, established
Efficient erasure correcting codes
A simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs is introduced and a simple criterion involving the fractions of nodes of different degrees on both sides of the graph is obtained which is necessary and sufficient for the decoding process to finish successfully with high probability.
Continuous and discontinuous phase transitions in hypergraph processes
Number of identifiable vertices and reducible hyperedges exhibit phase transitions, which may be continuous or discontinuous depending on the shape of the structure function -log(1 - x)/r'(x), for x in (0,1).
On the critical exponents of random k‐SAT
  • D. Wilson
  • Mathematics
    Random Struct. Algorithms
  • 2002
A simple proof that each of these exponents of random k-SAT formulas is at least 2 (provided the exponent is well defined) holds for each of the three standard ensembles of Random Boolean formulas: m clauses select uniformly at random without replacement, m clauses selected uniformly atrandom with replacement, and each clause selected with probability p independent of the other clauses.
Sudden Emergence of a Giantk-Core in a Random Graph
These proofs are based on the probabilistic analysis of an edge deletion algorithm that always find ak-core if the graph has one, and demonstrate that, unlike the 2-core, when ak- core appears for the first time it is very likely to be giant, of size ?pk(?k)n.