The Phase Transition in Multitype Binomial Random Graphs

DOI10.1137/140973256zbMath1314.05188arXiv1407.6248MaRDI QIDQ5256527

Christoph Koch, Mihyun Kang, Angelica Pachon

Publication date: 18 June 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionrandom graphsbranching processlargest component

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

Pandemic spread in communities via random graphs, Unnamed Item, Component behaviour and excess of random bipartite graphs near the critical point, Scale-free behavior of networks with the copresence of preferential and uniform attachment rules, Size of the largest component in a critical graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Birth control for giants
• The critical random graph, with martingales
• The phase transition in a random hypergraph
• Connected components in random graphs with given expected degree sequences
• A simple branching process approach to the phase transition in \(G_{n,p}\)
• Critical behavior in inhomogeneous random graphs
• The phase transition in random graphs: A simple proof
• The order of the giant component of random hypergraphs
• Asymptotic normality of the size of the giant component in a random hypergraph
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The phase transition in the uniformly grown random graph has infinite order
• The phase transition in inhomogeneous random graphs
• Exploring complex networks
• On a conditionally Poissonian graph process