Analytical results for the distribution of cover times of random walks on random regular graphs
From MaRDI portal
Publication:5049469
DOI10.1088/1751-8121/ac3a34zbMath1499.82012arXiv2110.13592OpenAlexW4200463944MaRDI QIDQ5049469
Ido Tishby, O. Biham, Eytan Katzav
Publication date: 11 November 2022
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.13592
Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks on graphs (05C81)
Related Items
Uses Software
Cites Work
- Gumbel fluctuations for cover times in the discrete torus
- Cover time of a random graph with given degree sequence
- The cover time of the preferential attachment graph
- The flooding time in random graphs
- Random walks and diffusion on networks
- On the distribution of the maximum \(k\)-degrees of the binomial random graph
- Cover times for Brownian motion and random walks in two dimensions
- Bounds on the cover time
- On the cover time of random walks on graphs
- An introduction to covering problems for random walks on graphs
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Extreme value distributions for random coupon collector and birthday problems
- Sur la distribution limite du terme maximum d'une série aléatoire
- A Guide to First-Passage Processes
- Diffusion and Reactions in Fractals and Disordered Systems
- The extinction time of a subcritical branching process related to the SIR epidemic on a random graph
- Role of depletion on the dynamics of a diffusing forager
- Elements of Random Walk and Diffusion Processes
- The distribution of first hitting times of randomwalks on Erdős–Rényi networks
- Random Walks on Lattices. II
- The Evolution of the Cover Time
- Diffusion with optimal resetting
- On the Limiting Distribution of a Graph Scan Statistic
- The distribution of path lengths of self avoiding walks on Erdős–Rényi networks
- The distribution of first hitting times of random walks on directed Erdős–Rényi networks
- The cover time of sparse random graphs
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- The cover time of the giant component of a random graph
- The Generalised Coupon Collector Problem
- Random Walk: A Modern Introduction
- Lectures on Complex Networks
- On the Cover Time for Random Walks on Random Graphs
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A tight upper bound on the cover time for random walks on graphs
- Networks
- Notes on the Binomial Transform
- Dynamical Processes on Complex Networks
- A model of self‐avoiding random walks for searching complex networks
- First-passage properties of the Erdos–Renyi random graph
- Random walks on graphs: ideas, techniques and results
- Kinetic growth walks on complex networks
- A critical point for random graphs with a given degree sequence
- A tight lower bound on the cover time for random walks on graphs
- Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
- Many Random Walks Are Faster Than One
- The average number of distinct sites visited by a random walker on random graphs
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
- The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks
- Distances in random graphs with finite variance degrees
- The Cover Time of Random Regular Graphs
- The statistical mechanics of polymers with excluded volume
- The Number of Distinct Sites Visited in a Random Walk on a Lattice
- Statistical theory of superlattices
- On the notion of recurrence in discrete stochastic processes
- Analytical results for the distribution of first hitting times of random walks on random regular graphs
- Analytical results for the distribution of first return times of random walks on random regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item