Non-backtracking random walk
From MaRDI portal
Publication:1942293
DOI10.1007/s10955-012-0684-6zbMath1259.82043arXiv1212.6390OpenAlexW3104802957MaRDI QIDQ1942293
Robert Fitzner, Remco van der Hofstad
Publication date: 18 March 2013
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6390
Central limit and other weak theorems (60F05) Brownian motion (60J65) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
A new method for quantifying network cyclic structure to improve community detection ⋮ The first order correction to the exit distribution for some random walks ⋮ Generalized approach to the non-backtracking lace expansion ⋮ A new weighted Ihara zeta function for a graph ⋮ Random walks and diffusion on networks ⋮ Unlacing hypercube percolation: a survey ⋮ Loop expansion around the Bethe approximation through theM-layer construction ⋮ Non-backtracking loop soups and statistical mechanics on spin networks ⋮ Analysis of node2vec random walks on networks ⋮ Hypercube percolation ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing ⋮ Reversibility of the non-backtracking random walk ⋮ Deterministic walks with choice ⋮ Expansion of Percolation Critical Points for Hamming Graphs ⋮ NoBLE for lattice trees and lattice animals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization algorithms and random walk on the d-cube
- New upper bounds for the connective constants of self-avoiding walks
- Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
- Unlacing hypercube percolation: a survey
- Poisson approximation for non-backtracking random walks
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Non-Backtracking Random Walks and Cogrowth of Graphs
