Meeting, coalescence and consensus time on random directed graphs

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Interacting particle systems in time-dependent statistical mechanics (82C22) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Interacting particle systems as stochastic social dynamics
Mean field conditions for coalescing random walks
Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
The coalescent
Probability approximations via the Poisson clumping heuristic
Ergodic theorems for weakly interacting infinite systems and the voter model
Inequalities for rare events in time-reversible Markov chains. I.
Wright-Fisher diffusions in stochastic spatial evolutionary games with death-birth updating
Weak atomic convergence of finite voter models toward Fleming-Viot processes
Cutoff at the ``entropic time for sparse Markov chains
Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs
Mixing time trichotomy in regenerating dynamic digraphs
Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
Mean field behavior during the big bang regime for coalescing random walks
Stationary distribution and cover time of sparse directed configuration models
Random walk on sparse random digraphs
The replicator equation in stochastic spatial evolutionary games
Interlacing eigenvalues in time reversible Markov chains
Multiple Random Walks in Random Regular Graphs
Finite particle systems and infection models
The cover time of sparse random graphs
The cover time of the giant component of a random graph
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
The giant component of the directed configuration model revisited
A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma"
A model for spatial conflict
The Cover Time of Random Regular Graphs
On the convergence of densities of finite voter models to the Wright-Fisher diffusion
Mixing time of PageRank surfers on sparse random digraphs
Voter models on subcritical scale‐free random graphs
On the meeting of random walks on random DFA
Rankings in directed configuration models with heavy tailed in-degrees
Discordant edges for the voter model on regular random graphs

This page was built for publication: Meeting, coalescence and consensus time on random directed graphs

Report a bugQ6620088