Probability on graphs. Random processes on graphs and lattices.

DOI10.1017/9781108528986MaRDI QIDQ4601641zbMATH OpenOpenAlexFDO

Authors G. R. Grimmett

Publication date 24 January 2018

Full work available at URL https://doi.org/10.1017/9781108528986

zbMATH Keywords

association and influenceclusteringinteracting particle systemspercolationrandom walks in graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Other physical applications of random processes (60K40) Percolation (82B43)

Recommendations

• Probability on graphs. Random processes on graphs and lattices.
• Probability on trees and networks
• scientific article; zbMATH DE number 1540669
• Random graphs.
• Three theorems in discrete random geometry

Cited in

(35)

• The bunkbed conjecture on the complete graph
• Non-coupling from the past
• A generalisation of the honeycomb dimer model to higher dimensions
• Discrete variants of Brunn-Minkowski type inequalities
• Harry Kesten's work in probability theory
• Loop-erased partitioning of a graph: mean-field analysis
• On the spanning and routing ratios of the directed _6-graph
• Brownian snails with removal: epidemics in diffusing populations
• Cubic graphs and the golden mean
• Property testing in high-dimensional Ising models
• On influence and compromise in two-tier voting systems
• Graph Theory and Probability. II
• scientific article; zbMATH DE number 5485245 (Why is no real title available?)
• Probability on graphs. Random processes on graphs and lattices.
• Three theorems in discrete random geometry
• Analytical results for the distribution of first return times of random walks on random regular graphs
• Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
• The coverage ratio of the frog model on complete graphs
• The bunkbed conjecture holds in the limit
• Cosh gradient systems and tilting
• Macroscopic behavior of Lipschitz random surfaces
• On Random Walks with Geometric Lifetimes
• Supercritical percolation on finite transitive graphs I: uniqueness of the giant component
• Learning genetic and environmental graphical models from family data
• Bond percolation does not simulate site percolation
• Superport networks
• Random walk in slowly changing environments
• Degree-penalized contact processes
• Non-triviality of the phase transition for percolation on finite transitive graphs
• Scaling limit of the directional conductivity of random resistor networks on point processes
• On some building blocks of hypergraphs
• Capacity of infinite graphs over non-Archimedean ordered fields
• The extinction of the contact process in a one-dimensional random environment with long-range interactions
• The central limit theorem for supercritical oriented percolation in two dimensions
• On the spanning and routing ratios of the directed _6-graph

This page was built for publication: Probability on graphs. Random processes on graphs and lattices.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601641)