A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Consider the following asynchronous, opportunistic communication model over a graph G: in each round, one edge is activated uniformly and independently at random and (only) its two endpoints can exchange messages and perform local computations. Under this model, we study the following random process: The first time a vertex is an endpoint of an active edge, it chooses a random number, say ±1 with probability 1/2; then, in each round, the two endpoints of the currently active edge update theirdoi:10.4230/lipics.esa.2018.7 dblp:conf/esa/BecchettiCMNPRT18 fatcat:gsxb4z37efhidcqp2uq6qlw3pm