Probability on graphs. Random processes on graphs and lattices.
From MaRDI portal
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 trees and networks
- Probability on graphs. Random processes on graphs and lattices.
- Random graphs and complex networks. Volume 1
- Random walks and diffusions on graphs and databases. An introduction.
- Discrete probability models and methods. Probability on graphs and trees, Markov chains and random fields, entropy and coding
Cited in
(64)- A note on Gibbs and Markov random fields with constraints and their moments
- On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model
- Localization for the Ising model in a transverse field with generic aperiodic disorder
- Central limit theorem for exponentially quasi-local statistics of spin models on Cayley graphs
- On conditional independence and log-convexity
- A BK inequality for randomly drawn subsets of fixed size
- Universality for the random-cluster model on isoradial graphs
- Metastability of hard-core dynamics on bipartite graphs
- Long-range contact process and percolation on a random lattice
- On the effective impedance of finite and infinite networks
- Random walks and Laplacians on hypergraphs: when do they match?
- On the existence of accessibility in a tree-indexed percolation model
- The critical threshold for Bargmann-Fock percolation
- Bond percolation on isoradial graphs: criticality and universality
- Neuronal ensemble decoding using a dynamical maximum entropy model
- Quasi-independence for nodal lines
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- Percolation with constant freezing
- Bridges in the random-cluster model
- Uniform Lipschitz functions on the triangular lattice have logarithmic variations
- Probability on trees and networks
- Comparison of Swendsen-Wang and heat-Bath dynamics
- Potts model with invisible colors: random-cluster representation and Pirogov-Sinai analysis
- On the influences of variables on Boolean functions in product spaces
- Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation
- Stochastic forms of non-negative matrices and Perron-regularity
- Graph Theory and Probability. II
- Frames and factorization of graph Laplacians
- Adaptive rumor spreading
- About Phase Transition and Zero Temperature
- scientific article; zbMATH DE number 5485245 (Why is no real title available?)
- Inhomogeneous bond percolation on square, triangular and hexagonal lattices
- BK-type inequalities and generalized random-cluster representations
- scientific article; zbMATH DE number 4070918 (Why is no real title available?)
- Paths and animals in infinite graphs with tempered degree growth
- Conformally invariant scaling limits in planar critical percolation
- Topics on abelian spin models and related problems
- Three theorems in discrete random geometry
- scientific article; zbMATH DE number 1921295 (Why is no real title available?)
- Probability on graphs. Random processes on graphs and lattices.
- scientific article; zbMATH DE number 775067 (Why is no real title available?)
- scientific article; zbMATH DE number 1421100 (Why is no real title available?)
- Stochastic rumors on random trees
- Uncertainty quantification for Markov random fields
- Influence in product spaces
- Connection probabilities and RSW-type bounds for the two-dimensional FK Ising model
- Probability graphs
- Undiscounted Markov chain BSDEs to stopping times
- Effective impedance over ordered fields
- Random Explorations
- Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
- On the probabilistic representation of the free effective resistance of infinite graphs
- Selected Problems in Probability Theory
- A central limit theorem for the mean starting hitting time for a random walk on a random graph
- Structure of Gibbs measure for planar FK-percolation and Potts models
- Sharp thresholds for the random-cluster and Ising models
- Oded Schramm's contributions to noise sensitivity
- A bootstrap likelihood approach to Bayesian computation
- Analysis and probability on graphs (to appear)
- Excursions through probability theory.
- Fractal percolation is unrectifiable
- The phase transition of the quantum Ising model is sharp
- A lower bound on the two-arms exponent for critical percolation on the lattice
- Chaos: butterflies also generate phase transitions
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 Q3559181)