Publication:4841309
From MaRDI portal
zbMath0826.60057MaRDI QIDQ4841309
Peter M. Winkler, László Lovász
Publication date: 22 November 1995
statistical mechanics; mixing properties; diffusion processes on graphs; chip-firing; mixing time of a random walk
60G50: Sums of independent random variables; random walks
91A43: Games involving graphs
60C05: Combinatorial probability
05C99: Graph theory
Related Items
A Hitting Time Formula for the Discrete Green's Function, Quantum simulations of classical random walks and undirected graph connectivity, Dynamic graph models and their properties, Comparison inequalities and fastest-mixing Markov chains, Mixing time of near-critical random graphs, Control of limit states in absorbing resource networks, The best mixing time for random walks on trees, Random walks and flights over connected graphs and complex networks, Randomized diffusion for indivisible loads, A study of Euler resource networks, Markov chain methods for analyzing urban networks, Chip-firing and the critical group of a graph, The Tutte polynomial as a growth function, Counting trees with random walks, Resource allocation among attractor vertices in asymmetric regular resource networks, Resource network with limited capacity of attractor vertices, The evolution of the mixing rate of a simple random walk on the giant component of a random graph
