scientific article; zbMATH DE number 176640
[For the entire collection see Zbl 0752.00055.] This paper is essentially promotional material for the subject of random walks on finite graphs. Eleven contexts of application are sketched: analogy with electrical networks, levelling networks, recreational problems (chess), universal traversal sequences, minimization algorithms, simulating uniform distributions on combinatorial sets, random spanning trees in regular graphs, planar graphs, voter models, diffusions on regular fractals, random fractals. The paper then provides brief comments on twelve techniques which are useful in the analysis of these problems: reversible Markov chains, group representation theory, weakening symmetry conditions, hard analysis, infinite and finite graphs, naive and threshold limits, isoperimetric inequalities, analytic and probabilistic parameters, spectral theory of graphs, exact extremal graphs, fractional dimension, martingale methods.
- Classification on the average of random walks
- An interlacing technique for spectra of random walks and its application to finite percolation clusters
- Random walks on graphs and Monte Carlo methods
- Walks and cycles on a digraph with application to population dynamics
- Reconstruction of the final distribution of probabilities for random walks on a graph
- Designing good random walks on finite graphs
- Diffusions on graphs, Poisson problems and spectral geometry
- Stochastic forms of non-negative matrices and Perron-regularity
- Random flights on regular graphs
- Approach to equilibrium for random walks on graphs and for stochastic infinite particle processes
- scientific article; zbMATH DE number 1344536 (Why is no real title available?)
- scientific article; zbMATH DE number 2046058 (Why is no real title available?)
- Random walks on a complete graph: a model for infection
- scientific article; zbMATH DE number 1894369 (Why is no real title available?)
- scientific article; zbMATH DE number 782053 (Why is no real title available?)
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- Potential induced random teleportation on finite graphs
- Predictive inference for travel time on transportation networks
- Controllability of consensus heterogeneous multi-agent networks over continuous time scale
- Monotonicity of random walks' states on finite grids
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 Q4035822)
