Probability on Graphs

DOI10.1017/9781108528986zbMath1378.60005OpenAlexW4237304756MaRDI QIDQ4601641

Geoffrey R. Grimmett

Publication date: 24 January 2018

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

zbMATH Keywords

clusteringpercolationinteracting particle systemsassociation and influencerandom walks in graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) 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) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Random walks on graphs (05C81)

Related Items

On the spanning and routing ratios of the directed \(\varTheta_6\)-graph, The bunkbed conjecture on the complete graph, Loop-erased partitioning of a graph: mean-field analysis, On the spanning and routing ratios of the directed \(\Theta_6\)-graph, Brownian snails with removal: epidemics in diffusing populations, 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, Non-coupling from the past, Cubic graphs and the golden mean, The central limit theorem for supercritical oriented percolation in two dimensions, A generalisation of the honeycomb dimer model to higher dimensions, Discrete variants of Brunn-Minkowski type inequalities, Harry Kesten's work in probability theory, Property testing in high-dimensional Ising models, On influence and compromise in two-tier voting systems, 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