The Largest Component in Subcritical Inhomogeneous Random Graphs-Reference-Cited by-同舟云学术

The Largest Component in Subcritical Inhomogeneous Random Graphs

Published:2010-06-09 Issue:1 Volume:20 Page:131-154
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

TUROVA TATYANA S.

Abstract

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.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference10 articles.

1. The Volume of the Giant Component of a Random Graph with Given Expected Degrees

2. Merging percolation on Zd and classical random graphs: Phase transition;Turova;Random Struct. Alg.

3. The transitive closure of a random digraph

4. Percolation

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Nearly subadditive sequences;Acta Mathematica Hungarica;2020-07-22

2. Primal-size neural circuits in meta-periodic interaction;Cognitive Neurodynamics;2020-07-01

3. Subcritical Random Hypergraphs, High-Order Components, and Hypertrees;SIAM Journal on Discrete Mathematics;2020-01

4. Phase transition in random distance graphs on the torus;Journal of Applied Probability;2017-11-30

5. Cliques in dense inhomogeneous random graphs;Random Structures & Algorithms;2017-04-04