Y. Peres

works on

coalescence time 1 erdos-renyi graph 1 meeting time 1 random walks 1 voter model 1

From the 1 of 2 linked papers with an AI index.

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2026

Meeting and coalescence times for random walks in the largest component of the ErdÅs-RÃ©nyi random graph

Vyacheslav Koval, Yuval Peres, Pieter Trapman

The paper shows that the expected meeting time of two independent continuous-time random walks on the largest component of an Erdős–Rényi graph scales linearly with the number of v…

math.PR2024

The Asynchronous DeGroot Dynamics

Dor Elboim, Yuval Peres, Ron Peretz

We analyze the asynchronous version of the DeGroot dynamics: In a connected graph $G$ with $n$ nodes, each node has an initial opinion in $[0, 1]$ and an independent Poisson clock.…

Meeting and coalescence times for random walks in the largest component of the ErdÅs-RÃ©nyi random graph

The Asynchronous DeGroot Dynamics

Meeting and coalescence times for random walks in the largest component of the ErdÅs-RÃ©nyi random graph