Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
From MaRDI portal
Publication:1203898
DOI10.1007/BF01274266zbMath0767.60098OpenAlexW2046167851MaRDI QIDQ1203898
Charles M. Newman, Michael S. Keane, Alberto Gandolfi
Publication date: 22 March 1993
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01274266
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Related Items
Explicit isoperimetric constants and phase transitions in the random-cluster model, Phase transition in loop percolation, Transience Versus Recurrence for Scale-Free Spatial Networks, Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters, Recurrence versus transience for weight-dependent random connection models, On the continuity of the critical value for long range percolation in the exponential case, Spatial Gibbs random graphs, Alignment percolation, Percolation on nonunimodular transitive graphs, Scale-free percolation, Brownian paths homogeneously distributed in space: percolation phase transition and uniqueness of the unbounded cluster, Uniqueness in percolation theory, Heavy Bernoulli-percolation clusters are indistinguishable, Inhomogeneous long-range percolation on the hierarchical lattice, Continuity of the Ising phase transition on nonamenable groups, The social network model on infinite graphs, The constrained-degree percolation model, Estimates on the effective resistance in anisotropic long-range percolation on \(\mathbb Z^2\), Uniqueness of the infinite component for percolation on a hierarchical lattice, Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs, Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm, Probability Theory in Statistical Physics, Percolation, and Other Random Topics: The Work of C. Newman, Boundedness of level lines for two-dimensional random fields, Phase transitions on nonamenable graphs, Gibbs states of graphical representations of the Potts model with external fields, Fixed price of groups and percolation, The diameter of long-range percolation clusters on finite cycles, The percolation signature of the spin glass transition, Percolation on hyperbolic graphs, On the scaling of the chemical distance in long-range percolation models, The growth of the infinite long-range percolation cluster, Optimal stationary markings, From loop clusters and random interlacements to the free field, Percolation with constant freezing, On the influence maximization problem and the percolation phase transition, Counterexamples for percolation on unimodular random graphs, Penalising transmission to hubs in scale-free spatial random graphs, Hyperbolic and parabolic unimodular random maps, Simultaneous uniqueness of infinite clusters in stationary random labeled graphs, Entropy for translation-invariant random-cluster measures, Percolation in half-spaces: Equality of critical densities and continuity of the percolation probability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Percolation in half-spaces: Equality of critical densities and continuity of the percolation probability
- Connectedness of certain random graphs
- Uniqueness of the infinite cluster for stationary Gibbs states
- An upper bound on the critical percolation probability for the three- dimensional cubic lattice
- Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation
- On the uniqueness of the infinite cluster in the percolation model
- On the uniqueness of the infinite occupied cluster in dependent two- dimensional site percolation
- Density and uniqueness in percolation
- When are random graphs connected
- Infinite clusters in percolation models
- Critical Probabilities for Cluster Size and Percolation Problems
- On the connectedness of a random graph
- An algorithm for calculating critical probabilities and percolation functions in percolation models defined by rotations
- An approximate zero-one law
