Multiple random walks in random regular graphs
From MaRDI portal
Recommendations
Cited in
(42)- Latent voter model on locally tree-like random graphs
- Two-type annihilating systems on the complete and star graph
- Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
- Cover time on a square lattice by two colored random walkers
- Broadcasting on paths and cycles
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- From coalescing random walks on a torus to Kingman's coalescent
- Viral processes by random walks on random regular graphs
- Distributed computation in dynamic networks via random walks
- Random walks on complete multipartite graphs
- The ANTS problem
- Metastable Markov chains
- On broadcasting time in the model of travelling agents
- Coalescence and meeting times on \(n\)-block Markov chains
- Viral processes by random walks on random regular graphs
- The hitting time of multiple random walks
- Random multi-hopper model: super-fast random walks on graphs
- Coalescing walks on rotor-router systems
- Multiple Random Walks and Interacting Particle Systems
- Mean field conditions for coalescing random walks
- The cover times of random walks on random uniform hypergraphs
- Theory and practice of discrete interacting agents models
- Discordant Voting Processes on Finite Graphs
- Global majority consensus by local majority polling on graphs of a given degree sequence
- A probabilistic proof of Cooper \& Frieze's ``First Visit Time Lemma
- Analytical results for the distribution of cover times of random walks on random regular graphs
- Memory Efficient Anonymous Graph Exploration
- On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
- On the meeting of random walks on random DFA
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- Spread of information and diseases via random walks in sparse graphs
- Discordant edges for the voter model on regular random graphs
- Asymptotic behaviour of the noisy voter model density process
- Meeting, coalescence and consensus time on random directed graphs
- On the mean absorption time of multiple coalescing particles with removal at previously visited vertices
- Covering a graph with independent walks
- Coalescence on the discrete torus revisited
- Evolution of discordant edges in the voter model on random sparse digraphs
- Dissipative particle systems on expanders
- Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs
- Balanced two-type annihilation: mean-field asymptotics
- Exact computation for meeting times and infection times of random walks on graphs
This page was built for publication: Multiple random walks in random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058528)
