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 ti...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's Version

Actions


Access Document


Files:
Publisher copy:
10.1137/1.9781611975482.59

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Sauerwald, T More by this author
Mallmann-Trenn, F More by this author
Publisher:
Society for Industrial and Applied Mathematics Publisher's website
Pages:
956-965
Acceptance date:
2018-09-27
DOI:
EISBN:
978-1-61197-548-2
Pubs id:
pubs:950988
URN:
uri:0c47a2d5-7154-4bf8-8f88-a8a454b55b91
UUID:
uuid:0c47a2d5-7154-4bf8-8f88-a8a454b55b91
Local pid:
pubs:950988

Terms of use


Metrics



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

TO TOP