General percolation and random graphs
From MaRDI portal
Publication:3903844
DOI10.2307/1426466zbMath0455.60086OpenAlexW2319158417MaRDI QIDQ3903844
Publication date: 1981
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1426466
connectednessreliabilitypercolationdependent random variablesclutterhamiltonian cyclesrandom graphs and digraphs
Reliability, availability, maintenance, inspection in operations research (90B25) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Directed graphs (digraphs), tournaments (05C20)
Related Items
The bunkbed conjecture on the complete graph, Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability, Bernoulli trials of fixed parity, random and randomly oriented graphs, Connections in Randomly Oriented Graphs, On a Correlation Inequality of Farr, Shattering, graph orientations, and connectivity, On offset Hamilton cycles in random hypergraphs, Correlations for paths in random orientations of G(n,p) and G(n,m), Matchings and cycle covers in random digraphs, Rainbow hamilton cycles in random graphs, Tight Hamilton cycles in random uniform hypergraphs, Monotonicity of the probability of percolation for Bernoulli random fields on periodic graphs, Note on directed proper connection number of a random graph, A Counter-Intuitive Correlation in a Random Tournament, On Percolation and the Bunkbed Conjecture, On the existence of Hamiltonian cycles in a class of random graphs, The product representation of a locally dependent random graph, Hamiltonian cycles in random regular graphs, Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
