scientific article; zbMATH DE number 782053

MaRDI QIDQ4841309zbMATH OpenFDO

Authors Peter Winkler, László Lovász

Publication date 22 November 1995

zbMATH Keywords

statistical mechanicsmixing propertiesdiffusion processes on graphschip-firingmixing time of a random walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Games involving graphs (91A43) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 176640
• A variation on chip-firing: the diffusion game
• Chip-firing games on graphs
• Diffusion on graphs is eventually periodic

Cited in

(21)

• Markov chain methods for analyzing urban networks
• Dynamic graph models and their properties
• Quantum simulations of classical random walks and undirected graph connectivity
• Mixing time of near-critical random graphs
• Random walks and flights over connected graphs and complex networks
• Chip-firing and the critical group of a graph
• Counting trees with random walks
• Resource allocation among attractor vertices in asymmetric regular resource networks
• Resource network with limited capacity of attractor vertices
• The Tutte polynomial as a growth function
• Randomized diffusion for indivisible loads
• scientific article; zbMATH DE number 1241392 (Why is no real title available?)
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• A study of Euler resource networks
• Diffusion: quiescence and perturbation
• The best mixing time for random walks on trees
• If you are the smartest person in the room, you are in the wrong room
• A hitting time formula for the discrete Green's function
• Mixing time and eigenvalues of the abelian sandpile Markov chain
• Comparison inequalities and fastest-mixing Markov chains
• Control of limit states in absorbing resource networks

This page was built for publication:

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