Multiple Random Walks in Random Regular Graphs

From MaRDI portal
Publication:3058528

DOI10.1137/080729542zbMath1207.05179OpenAlexW2039765418WikidataQ57401475 ScholiaQ57401475MaRDI QIDQ3058528

Tomasz Radzik, Colin Cooper, Alan M. Frieze

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Multiple_Random_Walks_in_Random_Regular_Graphs/6478496




Related Items

Coalescence and meeting times on \(n\)-block Markov chainsBroadcasting on paths and cyclesStochastic strategies for patrolling a terrain with a synchronized multi-robot systemMemory Efficient Anonymous Graph ExplorationCoalescing Walks on Rotor-Router SystemsThe Hitting Time of Multiple Random WalksThe ANTS problemOn broadcasting time in the model of travelling agentsMean field conditions for coalescing random walksMetastable Markov chainsOn Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?On the meeting of random walks on random DFAA probabilistic proof of Cooper and Frieze's "First Visit Time Lemma"A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agentsGlobal majority consensus by local majority polling on graphs of a given degree sequenceLatent voter model on locally tree-like random graphsTheory and Practice of Discrete Interacting Agents ModelsFrom coalescing random walks on a torus to Kingman's coalescentDiscordant Voting Processes on Finite GraphsExact computation for meeting times and infection times of random walks on graphsTwo-type annihilating systems on the complete and star graphBalanced Allocation on Graphs: A Random Walk ApproachViral Processes by Random Walks on Random Regular GraphsViral processes by random walks on random regular graphsDistributed computation in dynamic networks via random walks