The Largest Component in Subcritical Inhomogeneous Random Graphs

Autor:	Tatyana S. Turova
Rok vydání:	2010
Předmět:	Statistics and Probability Random graph Connected component Component (thermodynamics) Applied Mathematics Mathematical analysis Giant component Theoretical Computer Science Combinatorics Computational Theory and Mathematics Random regular graph Exact formula Rank (graph theory) Mathematics
Zdroj:	Combinatorics, Probability and Computing. 20:131-154
ISSN:	1469-2163 0963-5483
DOI:	10.1017/s0963548310000180
Popis:	We study the ‘rank 1 case’ of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result complements the corresponding known result in the supercritical case. We provide some examples of applications of the derived formula.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::4f15c15fec31e2d3928563510531b548 https://doi.org/10.1017/s0963548310000180 Zobrazit plný text záznamu