The largest component in critical random intersection graphs

DOI10.7151/DMGT.2052MaRDI QIDQ1656908zbMATH OpenOpenAlexWikidataFDO

Authors Bin Wang, Longmin Wang, Kai-Nan Xiang

Publication date 10 August 2018

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2052

zbMATH Keywords

scaling windowlargest componentcritical random intersection graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Size of the largest component in a critical graph
• Central limit theorem for the largest component of random intersection graph
• The critical random graph, with martingales
• Component evolution in general random intersection graphs
• An elementary approach to component sizes in critical random graphs

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A note on the component structure in random intersection graphs with tunable clustering
• Component evolution in random intersection graphs
• Component sizes of the random graph outside the scaling window
• Critical percolation on random regular graphs
• Critical random graphs: Diameter and mixing time
• Equivalence of a random intersection graph and G (n ,p )
• On Random Intersection Graphs: The Subgraph Problem
• Probability. Theory and examples.
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Sharp threshold functions for random intersection graphs via a coupling method
• Sharp thresholds for Hamiltonicity in random intersection graphs
• The critical random graph, with martingales
• The vertex degree distribution of random intersection graphs

Cited in

(15)

• The largest component in an inhomogeneous random intersection graph with clustering
• The Largest Component in Subcritical Inhomogeneous Random Graphs
• Central limit theorem for the largest component of random intersection graph
• A note on the component structure in random intersection graphs with tunable clustering
• scientific article; zbMATH DE number 3874387 (Why is no real title available?)
• Component sizes of the random graph outside the scaling window
• An elementary approach to component sizes in critical random graphs
• Component evolution in random intersection graphs
• The Maximum Block Size of Critical Random Graphs
• Formation of a giant component in the intersection graph of a random chord diagram
• Intersections of largest bonds in \(k\)-connected graphs
• Largest component of subcritical random graphs with given degree sequence
• Size of the largest component in a critical graph
• The critical random graph, with martingales
• Component evolution in general random intersection graphs

This page was built for publication: The largest component in critical random intersection graphs

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