Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
Remco van der Hofstad1, Sandra Kliem2, Johan S H van Leeuwaarden1
11Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands.
Abstract:
Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299-2361, 2012). It was proved that when the degrees obey a power law with exponent , the sequence of clusters ordered in decreasing size and multiplied through by converges as to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237-269, 2001) for the Erdős-Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.
Related Concept Videos
Concentration and Rate Law
For example, in a generic reaction aA + bB ⟶ products, where a and b are stoichiometric coefficients, the rate law can be written as:
Ogive Graph
Graphing Antiderivatives
Third Law of Thermodynamics
Second Law of Thermodynamics
Second Law of Thermodynamics


