2 citations · 3 across the 6 of their papers we have counts for
6 papers
Source localisation in simple random walks
Ritesh Goenka, Peter Keevash, Tomasz Przybyłowski
We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first steps. Conside…
The acyclic directed bunkbed conjecture is false
Tomasz Przybyłowski
We construct a simple acyclic directed graph for which the Bunkbed Conjecture is false, thereby resolving conjectures posed by Leander and by Hollom.
KKL theorem for the influence of a set of variables
Tomasz Przybyłowski
Consider a Boolean function f on the n-dimensional hypercube, and a set of variables (indexed by) The coalition influence of the variables S on a func…
Random walks on Coxeter interchange graphs
Matthew Buckland, Brett Kolesnik, Rivka Mitchell +1
A tournament is an orientation of a graph. Vertices are players and edges are games, directed away from the winner. Kannan, Tetali and Vempala and McShine showed that tournaments w…
Coxeter interchange graphs
Brett Kolesnik, Rivka Mitchell, Tomasz Przybyłowski
Brualdi and Li introduced tournament interchange graphs. In such a graph, each vertex represents a tournament. Traversing an edge corresponds to reversing a cyclically directed tri…
Thresholds and expectation thresholds for larger p
Tomasz Przybyłowski, Oliver Riordan
Let and be the threshold and the expectation threshold, respectively, of an increasing family of subsets of a finite set , and let $l…