scientific article; zbMATH DE number 782053
From MaRDI portal
Publication:4841309
zbMath0826.60057MaRDI QIDQ4841309
Publication date: 22 November 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
statistical mechanicsmixing propertiesdiffusion processes on graphschip-firingmixing time of a random walk
Sums of independent random variables; random walks (60G50) Games involving graphs (91A43) Combinatorial probability (60C05) Graph theory (05C99)
Related Items (17)
Dynamic graph models and their properties ⋮ Comparison inequalities and fastest-mixing Markov chains ⋮ A study of Euler resource networks ⋮ Mixing time of near-critical random graphs ⋮ A Hitting Time Formula for the Discrete Green's Function ⋮ The evolution of the mixing rate of a simple random walk on the giant component of a random graph ⋮ Control of limit states in absorbing resource networks ⋮ The best mixing time for random walks on trees ⋮ Markov chain methods for analyzing urban networks ⋮ Counting trees with random walks ⋮ Quantum simulations of classical random walks and undirected graph connectivity ⋮ Random walks and flights over connected graphs and complex networks ⋮ Resource allocation among attractor vertices in asymmetric regular resource networks ⋮ Resource network with limited capacity of attractor vertices ⋮ Randomized diffusion for indivisible loads ⋮ The Tutte polynomial as a growth function ⋮ Chip-firing and the critical group of a graph
This page was built for publication: