General percolation and random graphs
- 1 March 1981
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 13 (01) , 40-60
- https://doi.org/10.1017/s0001867800035783
Abstract
I introduce some useful general results concerning clutter percolation and families of binary random variables arranged in independent subfamilies, and give several applications to the study of random graphs and digraphs.Keywords
This publication has 9 references indexed in Scilit:
- Clutter percolation and random graphsPublished by Springer Nature ,1980
- On some percolation results of J. M. HammersleyJournal of Applied Probability, 1979
- Distances in orientations of graphsJournal of Combinatorial Theory, Series B, 1978
- Pólya sequences, binomial convolution and the union of random setsJournal of Applied Probability, 1976
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- Coherent Structures of Non-Identical ComponentsTechnometrics, 1963
- Comparison of Atom and Bond Percolation ProcessesJournal of Mathematical Physics, 1961
- Multi-Component Systems and Structures and Their ReliabilityTechnometrics, 1961
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite GraphsCanadian Journal of Mathematics, 1960