Brett KolesnikUniversity of Oxford
I am a probabilist, interested in random structures, geometry, algorithms, processes, etc., and by interactions with other areas of mathematics, especially combinatorics.
My PhD was supervised by Omer Angel in the probability group at the University of British Columbia. Before arriving at the University of Oxford, I held an NSERC of Canada postdoctoral fellowship and visiting assistant professorships at the University of California, Berkeley and San Diego. This fall, I will join the probability group at the University of Warwick, Department of Statistics.Coauthors
This spring, I organized a workshop at the Banff International Research Station (BIRS) on Bootstrap Percolation & its Applications, together with József Balogh, Janko Gravner, Karen Gunderson and Rob Morris.
Daniel Ahlberg
David Aldous
Omer Angel
Eleanor Archer
Zsolt Bartha
Michal Bassan
Matthew Buckland
Serte Donderwinkel
Persi Diaconis
Janko Gravner
Ivailo Hartarsky
Gal Kronenberg
Grégory Miermont
Rivka Mitchell
Sam Olesker-Taylor
Tomasz Przybyłowski
Mario Sanchez
Bruno Schapira
Daniel Valesin
Nick Wormald
Papers
w/ Michal Bassan and Serte DonderwinkelCatalan percolation
arXiv:2406.05110
w/ Eleanor Archer, Ivailo Hartarsky, Sam Olesker-Taylor, Bruno Schapira and Daniel ValesinCritical beta-splitting, via contraction
arXiv:2404.19583
arXiv:2404.16021
Asymptotics for Sinaı̆ excursions
w/ Serte DonderwinkelTournaments and random walks
arXiv:2403.12941
w/ Serte DonderwinkelRandom walks on Coxeter interchange graphs
arXiv:2403.12940
w/ Matthew Buckland, Rivka Mitchell and Tomasz PrzybyłowskiTournaments on signed graphs
arXiv:2401.17210
w/ Rivka Mitchell and Tomasz PrzybyłowskiH-percolation with a random H
arXiv:2312.04532
w/ Zsolt Bartha and Gal KronenbergCoxeter tournaments
arXiv:2312.03663
w/ Mario SanchezAnnihilating branching Brownian motion
arXiv:2302.14002
w/ Daniel Ahlberg and Omer AngelThe asymptotic number of score sequences
International Mathematics Research Notices
arXiv:2312.03669
CombinatoricaLarge deviations of the greedy independent set algorithm on sparse random graphs
arXiv:2209.13563
Random Structures & AlgorithmsThe geometry of random tournaments
arXiv:2011.04613
w/ Mario Sanchez
Discrete & Computational Geometry
arXiv:2009.09322
Weakly saturated random graphs
w/ Zsolt BarthaTransitive closure in a polluted environment
Random Structures & Algorithms
arXiv:2007.14716
w/ Janko GravnerRandomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
Annals of Applied Probability
arXiv:1910.01800
w/ Persi DiaconisTo stay discovered: On tournament mean score sequences and the Bradley–Terry model
Advances in Applied Mathematics
arXiv:1907.02333
w/ David AldousThe sharp K4-percolation threshold on the Erdős–Rényi random graph
Stochastic Processes and their Applications
Special Issue: In Memoriam: Larry Shepp
arXiv:1811.06662
Electronic Journal of ProbabilityLarge deviations for subcritical bootstrap percolation on the Erdős–Rényi graph
arXiv:1705.08882
w/ Omer AngelSharp thresholds for contagious sets in random graphs
Journal of Statistical Physics
arXiv:1705.06815
w/ Omer AngelStability of geodesics in the Brownian map
Annals of Applied Probability
arXiv:1611.10167
w/ Omer Angel and Grégory MiermontLower bounds for the isoperimetric numbers of random regular graphs
Annals of Probability
arXiv:1502.04576
w/ Nick Wormald
SIAM Journal on Discrete Mathematics
arXiv:1311.6555