Cover-time Gumbel fluctuations in finite-range, symmetric, irreducible random walks on torus
From MaRDI portal
(Redirected from Publication:6571598)
Recommendations
Cites work
- A finitary structure theorem for vertex-transitive graphs of polynomial growth
- A guide to first-passage processes
- An introduction to covering problems for random walks on graphs
- Cover times for Brownian motion and random walks in two dimensions
- From first-passage times of random walks in confinement to geometry-controlled kinetics
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Global optimization by controlled random search
- Gumbel fluctuations for cover times in the discrete torus
- Handbooks in operations research and management science: Simulation
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- Interlacement percolation on transient weighted graphs
- Markov chain models - rarity and exponentiality
- Matrices
- On cover times for 2D lattices
- On the cover time of random walks on graphs
- On the fragmentation of a torus by random walk
- On the time taken by random walks on finite groups to visit every state
- Probability
- Random walk: A modern introduction
- Threshold limits for cover times
- Vacant set of random interlacements and percolation
This page was built for publication: Cover-time Gumbel fluctuations in finite-range, symmetric, irreducible random walks on torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571598)