Loose Cores and Cycles in Random Hypergraphs

  title={Loose Cores and Cycles in Random Hypergraphs},
  author={Oliver Cooley and Mihyun Kang and Julian Zalla},
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 in the r-uniform binomial random hypergraph H(n, p), the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes. Our main tool is an algorithm called… 
1 Citations
PR ] 1 7 O ct 2 00 7 Differential Equation Approximations for Markov Chains
We formulate some simple conditions under which a Markov chain may be approximated by the solution to a differential equation, with quantifiable error probabilities. The role of a choice of


The cores of random hypergraphs with a given degree sequence
  • C. Cooper
  • Mathematics
    Random Struct. Algorithms
  • 2004
We study random r‐uniform n vertex hypergraphs with fixed degree sequence d = (d1…,dn), maximum degree Δ = o(n1/24) and total degree θn, where θ is bounded. We give the size, number of edges and
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 k-Core and Branching Processes
  • O. Riordan
  • Mathematics
    Combinatorics, Probability and Computing
  • 2008
A new proof of the threshold λc for the emergence of a non-trivial k-core in the random graph G(n, λ/n) is given using a local coupling of the graph to a suitable branching process and extends to a general model of inhomogeneous random graphs with independence between the edges.
Asymptotic normality of the k-core in random graphs
It is shown that the fluctuations around the deterministic limit converge to a Gaussian law above and near the threshold, and to a non-normal law at the threshold.
A simple solution to the k-core problem
This work recovers the result by Pittel, Spencer and Wormald on the existence and size of a k-core in G(n,p) and G( n,m), based on the properties of empirical distributions of independent random variables, and leads to simple proofs.
On the robustness of random k-cores
Finite size scaling for the core of large random hypergraphs
If ρ is inside the scaling window, the probability of having a core of size �(n) has a limit strictly between 0 and 1, and a leading correction of order �( n −1/6 ).
The size of the giant high-order component in random hypergraphs
The phase transition in the size of the giant component in random graphs is one of the most well‐studied phenomena in random graph theory. For hypergraphs, there are many possible generalizations of
Asymptotic normality of the size of the giant component in a random hypergraph
It is shown that the same method applies to the analogous model of random k ‐uniform hypergraphs, establishing asymptotic normality throughout the (sparse) supercritical regime.
Cycles in a Random Graph Near the Critical Point
  • T. Luczak
  • Mathematics
    Random Struct. Algorithms
  • 1991
The limit distribution is found of the length of shortest cycle contained in the largest component of G(n, M), as well as of the longest cycle outside it, and it is shown that the probability tending to 1 as n‐→∞ thelength of the shortest cycle in G( n, M) is of the order s2(n)/n.