Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting

DOI10.1007/s13171-017-0116-4zbMath1390.60266arXiv1704.00458OpenAlexW2604746681MaRDI QIDQ1744718

Ghurumuruhan Ganesan

Publication date: 19 April 2018

Published in: Sankhyā. Series A (Search for Journal in Brave)

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

zbMATH Keywords

phase transitioninhomogenous Erdős-Rényi random graphstree counting argument

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Characterization and structure theory of statistical distributions (62E10)

Related Items (2)

Deviation estimates for Eulerian edit numbers of random graphs ⋮ Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting

Cites Work

• Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting
• The phase transition in inhomogeneous random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting