Bounded-size rules: The barely subcritical regime
Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang

TL;DR
This paper investigates the size of the largest component in bounded-size rules in the barely subcritical regime, providing upper bounds and insights into the critical behavior of these dynamic random graph processes.
Contribution
It establishes upper bounds on the largest component size near the critical point using coupling with inhomogeneous random graphs, advancing understanding of the subcritical regime.
Findings
Upper bounds of order $n^{2eta} \, \log^4 n$ for component size at $t_c - n^{-eta}$
Coupling of bounded-size rules with inhomogeneous random graphs
Alternative characterization of the critical time $t_c$ via operator norm
Abstract
Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at each stage two edges are chosen uniformly at random. One of the two edges is then placed into the system according to a decision rule based on the sizes of the components containing the four vertices. For bounded-size rules, all components of size greater than some fixed are accorded the same treatment. Writing for the state of the system with nt/2 edges, Spencer and Wormald proved that for such rules, there exists a critical time t_c such that when t< t_c the size of the largest component is of order while for , the size of the largest component is of order . In this work we obtain upper bounds (that hold with high probability) of order , on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
