The size of the giant joint component in a binomial random double graph

DOI10.37236/8846zbMath1459.05303arXiv1906.09977OpenAlexW3133420630MaRDI QIDQ2227829

Tamás Makai, Mark R. Jerrum

Publication date: 16 February 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphconnected component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Phase transitions (general) in equilibrium statistical mechanics (82B26) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Nucleation scaling in jigsaw percolation
• Sudden emergence of a giant \(k\)-core in a random graph
• Multi-coloured jigsaw percolation on random graphs
• Jigsaw percolation: what social networks can collaboratively solve a puzzle?
• The threshold for jigsaw percolation on random graphs
• Sets that are connected in two random graphs
• Multilayer Networks
• Jigsaw percolation on random hypergraphs
• The sharp threshold for jigsaw percolation in random graphs
• The birth of the giant component

This page was built for publication: The size of the giant joint component in a binomial random double graph