Bounded-Size Rules: The Barely Subcritical Regime
暂无分享,去创建一个
[1] Svante Janson,et al. The Birth of the Giant Component , 1993, Random Struct. Algorithms.
[2] Y. Peres,et al. Mixing time of near-critical random graphs , 2009, 0908.3870.
[3] Joel H. Spencer,et al. The Bohman‐Frieze process near criticality , 2011, Random Struct. Algorithms.
[4] O. Riordan,et al. Achlioptas process phase transitions are continuous , 2011, 1102.5306.
[5] Xuan Wang,et al. Aggregation models with limited choice and the multiplicative coalescent , 2015, Random Struct. Algorithms.
[6] P. Brémaud. Point Processes and Queues , 1981 .
[7] Jeong Han Kim,et al. Poisson Cloning Model for Random Graph , 2004 .
[8] David Aldous,et al. Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .
[9] Alʹbert Nikolaevich Shiri︠a︡ev,et al. Theory of martingales , 1989 .
[10] Amarjit Budhiraja,et al. The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs , 2014 .
[11] Paul Erdös,et al. The Giant Component 1960-1993 , 1993, Random Struct. Algorithms.
[12] Sanchayan Sen. On the largest component in the subcritical regime of the Bohman-Frieze process , 2013 .
[13] Jeong Han Kim,et al. Poisson Cloning Model for Random Graphs , 2008, 0805.4133.
[14] P. Erdos,et al. On the evolution of random graphs , 1984 .
[15] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[16] D. Vere-Jones. Markov Chains , 1972, Nature.
[17] P. K. Pollett,et al. POINT PROCESSES AND QUEUES Martingale Dynamics (Springer Series in Statistics) , 1984 .
[18] B. Bollobás. The evolution of random graphs , 1984 .
[19] Amarjit Budhiraja,et al. The augmented multiplicative coalescent and critical dynamic random graph models , 2012, 1212.5493.
[20] B. Pittel,et al. On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase , 2008, 0808.2907.
[21] Svante Janson,et al. Phase transitions for modified Erdős–Rényi processes , 2010, 1005.4494.
[22] Alan M. Frieze,et al. Avoidance of a giant component in half the edge set of a random graph , 2004, Random Struct. Algorithms.
[23] Svante Janson,et al. The largest component in a subcritical random graph with a power law degree distribution , 2007, 0708.4404.
[24] Alan M. Frieze,et al. Avoiding a giant component , 2001, Random Struct. Algorithms.
[25] B. Bollobás,et al. The phase transition in inhomogeneous random graphs , 2007 .
[26] J. Spencer,et al. Explosive Percolation in Random Networks , 2009, Science.
[27] Joel H. Spencer,et al. Birth control for giants , 2007, Comb..
[28] Oliver Riordan,et al. The evolution of subcritical Achlioptas processes , 2012, Random Struct. Algorithms.
[29] Remco van der Hofstad,et al. Hypercube percolation , 2012, 1201.3953.
[30] Béla Bollobás,et al. Random Graphs , 1985 .
[31] Svante Janson,et al. Susceptibility in subcritical random graphs , 2008, 0806.0252.