Exploring hypergraphs with martingales

DOI10.1002/rsa.20678zbMath1364.05051arXiv1403.6558OpenAlexW3100847486MaRDI QIDQ5739093

Oliver Riordan, Béla Bollobás

Publication date: 2 June 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionmartingalerandom hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05)

Related Items

Phase transition in cohomology groups of non-uniform random simplicial complexes, Counting Connected Hypergraphs via the Probabilistic Method, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, Phase transitions in graphs on orientable surfaces, On the critical probability in percolation, Hitting times, commute times, and cover times for random walks on random hypergraphs, Vanishing of cohomology groups of random simplicial complexes, Loose cores and cycles in random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic normality of the size of the giant component via a random walk
• Component structure in the evolution of random hypergraphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Some large deviation results for sparse random graphs
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• The Phase Transition in the Configuration Model
• The order of the giant component of random hypergraphs
• Asymptotic normality of the size of the giant component in a random hypergraph
• The transitive closure of a random digraph
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• Counting Connected Hypergraphs via the Probabilistic Method
• Local Limit Theorems for the Giant Component of Random Hypergraphs
• Large‐deviations/thermodynamic approach to percolation on the complete graph
• Some Theorems on Distribution Functions