On tree census and the giant component in sparse random graphs

Random Structures & Algorithms

Volumn 1, Issue 3, 1990, Pages 311-342

  Pittel, Boris ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Coagulation process; distributions; dominance number; giant component; independence; limit theorems; Markov; random graphs; trees; two connected

Indexed keywords

EID: 84990635693     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.3240010306     Document Type: Article

References (34)

1. The longest path in a random graph
2. The principle of the diffusion of arbitrary constants
3. On a functional central limit theorem for Markov population processes
4. Poisson convergence and random graphs
5. Poisson approximation for some statistics based on exchangeable trials
6. The evolution of sparse graphs, in Graph Theory and Combinatorics
7. Poisson approximation for dependent trials
8. On the evolution of random graphs
9. Large induced trees in sparse random graphs
10. On the number of strictly balanced subgraphs of a random graph
11. Stable husbands
12. Large trees in random graphs
13. Maximal induced trees in sparse random graphs
14. The expected node‐independence number of random trees
15. On the probable behaviour of some algorithms for finding the stability number of a graph
16. A random graph with a subcritical number of edges
17. On a Daley‐Kendall model of random rumours
18. Infinite‐dimensional distributions in the thermodynamic limit of graph‐valued Markov processes and the phenomenon of postgelation sticking
19. Random tree‐type partitions as a model of acyclic polymerization: Holtsmark (3/2‐stable) distribution of the supercritical gel
20. When are small subgraphs of a random graph normally distributed?
21. ij = A + B(i + j), + Cij
22. A branching‐process solution of the polydisperse coagulation equation
23. A bound for the error in the normal approximation to the distribution of a sum of dependent random variables
24. m(t)