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:
-
-
(pdf, 541.1KB)
-
- Publisher copy:
- 10.1137/1.9781611975482.59
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- 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
- Copyright holder:
- Kanade, Mallmann-Trenn, and Sauerwalk
- Notes:
- This is the publisher's version of the article. The final version is available online from Society for Industrial and Applied Mathematics at: 10.1137/1.9781611975482.59
If you are the owner of this record, you can report an update to it here: Report update to this record