Coalescing Random Walks and Voting on Connected Graphs

Abstract

In a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues a random walk through the graph. Let G = (V, E) be an undirected and connected graph with n vertices and m edges. The coalescence time, C(n), is the expected time for all particles to coalesce, when initially one particle is located at each vertex. We study the problem of bounding the coalescence time for general connected graphs and prove thatHere λ 2 is the second eigenvalue of the transition matrix of the random walk. To avoid problems arising from, e.g., lack of coalescence on bipartite graphs, we assume the random walk can be made lazy if required. The value of ν is given by νis the degree of vertex v, and d = 2m/n is the average degree. The parameter ν is an indicator of the variability of vertex degrees: 1 ≤ ν = O(n), with ν = 1 for regular graphs. Our general bound on C(n) holds for all connected graphs. This implies, for example, that C(n) = O(n/(1 − λ 2 )) for d-regular graphs with expansion parameterized by the eigenvalue gap 1 − λ 2 . The bound on C(n) given above is sublinear for some classes of graphs with skewed degree distributions. In the voter model, initially each vertex has a distinct opinion, and at each step each vertex changes its opinion to that of a random neighbor. Let E(Cv ) be the expected time for voting to complete, that is, for a unique opinion to emerge. A system of coalescing particles, where initially one particle is located at each vertex, corresponds to the voter model in that E(Cv ) = C(n). Thus our result stated above for C(n) also gives general bounds for E(Cv ).

Maintaining a Distributed Spanning Forest in Highly Dynamic Networks

“…The speed of this convergence relates to the area of coalescing random walks (see e.g. [13]), which is out of the scope of this paper (and beyond our technical skills).…”

Discordant Voting Processes on Finite Graphs

“…Replacing Φ in (13) with the upper bound given above, gives a lower bound on the term (13) in (6). Thus…”

Majority Rule Based Opinion Dynamics with Biased and Stubborn Agents

“…Related literature: The voter model and its variants have been studied extensively (see [3] for a recent survey) for different network topologies, e.g., finite integer lattices in different dimensions [10,19], complete graphs with three states [27], heterogeneous graphs [28], random d-regular graphs [9], Erdos-Renyi random graphs, and random geometric graphs [32] etc. It is known [17,26] that if the underlying graph is connected, then the classical voter rule leads to a consensus where all agents adopt the same opinion.…”