Size of the largest component in a critical graph

DOI10.1155/2019/1731802MaRDI QIDQ2298120zbMATH OpenOpenAlexFDO

Authors Bin Wang, Lang Zou

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/1731802

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Review text

Summary: In this paper, by the branching process and the martingale method, we prove that the size of the largest component in the critical random intersection graph \(G \left(n, \left[n^{5 / 3}\right], p\right)\) is asymptotically of order \(n^{2 / 3}\) and the width of scaling window is \(n^{- 1 / 3}\).

Recommendations

• The largest component in critical random intersection graphs
• The critical random graph, with martingales
• On the largest component of the random graph at a nearcritical stage
• An elementary approach to component sizes in critical random graphs
• Component sizes of the random graph outside the scaling window

Cites work

• A note on the component structure in random intersection graphs with tunable clustering
• A simple branching process approach to the phase transition in \(G_{n,p}\)
• Component evolution in random intersection graphs
• Component sizes of the random graph outside the scaling window
• Critical percolation on random regular graphs
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• On Random Intersection Graphs: The Subgraph Problem
• Random graphs and complex networks. Volume 1
• Sharp threshold functions for random intersection graphs via a coupling method
• The critical random graph, with martingales
• The largest component in critical random intersection graphs
• The phase transition in multitype binomial random graphs

Cited in

(8)

• The largest component in critical random intersection graphs
• On the largest component of the random graph at a nearcritical stage
• An elementary approach to component sizes in critical random graphs
• Component sizes of the random graph outside the scaling window
• A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
• A simple path to component sizes in critical random graphs
• On the largest component of the critical random digraph
• The critical random graph, with martingales

This page was built for publication: Size of the largest component in a critical graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298120)