Bounded-size rules: the barely subcritical regime
From MaRDI portal
Publication:5495673
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 size of the largest component, at time instants , where . This result for the barely subcritical regime forms a key ingredient in the study undertaken in cite{amc-2012}, of the asymptotic dynamic behavior of the process describing the vector of component sizes and associated complexity of the components for such random graph models in the critical scaling window. The proof uses a coupling of BSR processes with a certain family of inhomogeneous random graphs with vertices in the type space where is the Skorohod -space of functions that are right continuous and have left limits equipped with the usual Skorohod topology. The coupling construction also gives an alternative characterization (than the usual explosion time of the susceptibility function) of the critical time for the emergence of the giant component in terms of the operator norm of integral operators on certain spaces.
Recommendations
Cites work
- Achlioptas process phase transitions are continuous
- Avoiding a giant component
- Birth control for giants
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Explosive percolation in random networks
- Markov Chains
- Mixing time of near-critical random graphs
- On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
- Phase transitions for modified Erdős--Rényi processes
- Susceptibility in subcritical random graphs
- The Bohman-Frieze process near criticality
- The largest component in a subcritical random graph with a power law degree distribution
- The phase transition in inhomogeneous random graphs
Cited in
(5)- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- Convergence of Achlioptas processes via differential equations with unique solutions
- On the largest component in the subcritical regime of the Bohman-Frieze process
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
This page was built for publication: Bounded-size rules: the barely subcritical regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495673)