Show simple item record

dc.contributor.authorGács, Peteren_US
dc.contributor.editorReif, John H.en_US
dc.date.accessioned2018-06-13T16:08:58Z
dc.date.available2018-06-13T16:08:58Z
dc.date.issued2002
dc.identifierhttp://www.informatik.uni-trier.de/~ley/db/conf/stoc/stoc2002.html
dc.identifier.citationPéter Gács. 2002. "Clairvoyant scheduling of random walks.." STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 99-108. doi: 10.1145/509907.509925
dc.identifier.urihttps://hdl.handle.net/2144/29382
dc.description.abstractTwo infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. About 10 years ago, Peter Winkler asked the question: for which graphs are two independent walks compatible with positive probability. Up to now, no such graphs were found. We show in this paper that large complete graphs have this property. The question is equivalent to a certain dependent percolation with a power-law behavior: the probability that the origin is blocked at distance n but not closer decreases only polynomially fast and not, as usual, exponentially.en_US
dc.format.extent99 - 108en_US
dc.publisherACMen_US
dc.relation.ispartofSTOC
dc.subjectMathematics of computingen_US
dc.subjectProbability and statisticsen_US
dc.titleClairvoyant scheduling of random walksen_US
dc.typeConference materialsen_US
dc.identifier.doi10.1145/509907.509925
pubs.elements-sourcedblpen_US
pubs.notesEmbargo: No embargoen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Arts & Sciencesen_US
pubs.organisational-groupBoston University, College of Arts & Sciences, Department of Computer Scienceen_US


This item appears in the following Collection(s)

Show simple item record