Random Graph Processes with Degree Restrictions-Reference-Cited by-同舟云学术

Random Graph Processes with Degree Restrictions

Published:1992-06 Issue:2 Volume:1 Page:169-180
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Ruciński A.,Wormald N. C.

Abstract

Suppose that a process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always bounded above by d. We prove that if n → ∞ with d fixed, then with probability tending to 1, the final result of this process is a graph with ⌊nd / 2⌋ edges.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference9 articles.

1. The asymptotic distribution of short cycles in random regular graphs

2. [4] McDiarmid C. (1989) On the method of bounded differences, Surveys in Combinatorics 1989 (invited papers of the 12th British Combinatorial Conference), Siemons J. ed. 148–188.

3. Maximal graphs with bounded maximum degree: Structure, asymptotic enumeration, randomness;Ruciński;Proc. III of the 7th Fischland Colloquium, Rostock Math. Kolloq.,1990

4. [7] Ruciński A. and Wormald N. C. (in preparation) A nontrivial random 2-regular graph.

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Behaviour of the minimum degree throughout the -process;Combinatorics, Probability and Computing;2024-04-22

2. The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes;SIAM Journal on Discrete Mathematics;2023-01-20

3. A gentle introduction to the differential equation method and dynamic concentration;Discrete Mathematics;2022-12

4. A variant of the Erdős–Rényi random graph process;Journal of Graph Theory;2022-08-05

5. Pair approximation for the q -voter models with quenched disorder on networks;Physical Review E;2022-06-21