Structure of large random hypergraphs

DOI10.1214/105051604000000567zbMath1062.05132arXivmath/0503460OpenAlexW3105201570MaRDI QIDQ1774214

Richard W. R. Darling, James R. Norris

Publication date: 29 April 2005

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0503460

zbMATH Keywords

collapsingidentifiabilityjump process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (17)

Networks beyond pairwise interactions: structure and dynamics ⋮ Convergence of Markov processes near saddle fixed points ⋮ Modelling population processes with random initial conditions ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Fluid and diffusion approximations of probabilistic matching systems ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ Stochastic networks with multiple stable points ⋮ Finite size scaling for the core of large random hypergraphs ⋮ On the phase transitions of random \(k\)-constraint satisfaction problems ⋮ Phase transition of random non-uniform hypergraphs ⋮ Fluid limit theorems for stochastic hybrid systems with application to neuron models ⋮ Rate of relaxation for a mean-field zero-range process ⋮ Pruning processes and a new characterization of convex geometries ⋮ A mean-field matrix-analytic method for bike sharing systems under Markovian environment ⋮ Vanishing of cohomology groups of random simplicial complexes ⋮ Critical random hypergraphs: the emergence of a giant set of identifiable vertices ⋮ Strong approximation for the supermarket model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Component structure in the evolution of random hypergraphs
• Differential equations for random processes and random graphs
• Cluster coagulation
• Foundations of Modern Probability
• Continuous and discontinuous phase transitions in hypergraph processes
• On the critical exponents of random k‐SAT
• Rigorous results for random (\(2+p)\)-SAT
• Lower bounds for random 3-SAT via differential equations

This page was built for publication: Structure of large random hypergraphs