An Upper Bound on the Size of Avoidance Couplings. (11th December 2018)
- Record Type:
- Journal Article
- Title:
- An Upper Bound on the Size of Avoidance Couplings. (11th December 2018)
- Main Title:
- An Upper Bound on the Size of Avoidance Couplings
- Authors:
- BATES, ERIK
SAUERMANN, LISA - Abstract:
- Abstract : We show that a coupling of non-colliding simple random walkers on the complete graph on n vertices can include at most n - log n walkers. This improves the only previously known upper bound of n - 2 due to Angel, Holroyd, Martin, Wilson and Winkler ( Electron. Commun. Probab. 18 (2013)). The proof considers couplings of i.i.d. sequences of Bernoulli random variables satisfying a similar avoidance property, for which there is separate interest.
- Is Part Of:
- Combinatorics, probability and computing. Volume 28:Number 3(2019)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 28:Number 3(2019)
- Issue Display:
- Volume 28, Issue 3 (2019)
- Year:
- 2019
- Volume:
- 28
- Issue:
- 3
- Issue Sort Value:
- 2019-0028-0003-0000
- Page Start:
- 325
- Page End:
- 334
- Publication Date:
- 2018-12-11
- Subjects:
- Primary 60J10, -- Secondary 05C81
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S0963548318000500 ↗
- Languages:
- English
- ISSNs:
- 0963-5483
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital Store
- Ingest File:
- 9885.xml