Conference item icon

Conference item

On coalescence time in graphs: When is coalescing as fast as meeting?

Abstract:

Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discretetime random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a single random walk. The coalescence time is defined as the expected time until only one particle remains, starting from one particle at every node. Despite recent progress such as by Cooper, Elsasser, Ono, Radzik [13] and Cooper, Frieze and Radzik [12], t...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1137/1.9781611975482.59

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Society for Industrial and Applied Mathematics Publisher's website
Journal:
Symposium on Discrete Algorithms Journal website
Pages:
956-965
Host title:
Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19), January 6 - 9, 2019, San Diego, California, USA
Publication date:
2019-01-01
Acceptance date:
2018-09-27
DOI:
Source identifiers:
950988
Pubs id:
pubs:950988
UUID:
uuid:0c47a2d5-7154-4bf8-8f88-a8a454b55b91
Local pid:
pubs:950988
Deposit date:
2018-12-07

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP