B. Kolesnik: Articles

Coauthors

Daniel AhlbergLink opens in a new window, David AldousLink opens in a new window, Omer AngelLink opens in a new window, Zsolt BarthaLink opens in a new window, Eleanor ArcherLink opens in a new window, Michal BassanLink opens in a new window, Matthew BucklandLink opens in a new window, Persi DiaconisLink opens in a new window, Serte DonderwinkelLink opens in a new window, Janko GravnerLink opens in a new window, Ivailo HartarskyLink opens in a new window, Gal KronenbergLink opens in a new window, Grégory MiermontLink opens in a new window, Rivka MitchellLink opens in a new window, Sam Olesker-TaylorLink opens in a new window, Emmanuel JacobLink opens in a new window, Yuval PeledLink opens in a new window, Tomasz PrzybyłowskiLink opens in a new window, Mario SanchezLink opens in a new window, Bruno SchapiraLink opens in a new window, Daniel ValesinLink opens in a new window, Nick WormaldLink opens in a new window, Georgii ZakharovLink opens in a new window, Maksim ZhukovskiiLink opens in a new window

Preprints

• Sharp Fuss–Catalan thresholds in graph bootstrap percolation
  Z. Bartha, B. Kolesnik, G. Kronenberg, and Y. Peled
  arXiv:2510.26724Link opens in a new window
• On the threshold for triangulations inside convex polygons
  B. Kolesnik, G. Zakharov, and M. Zhukovskii
  arXiv:2509.10160Link opens in a new window
• To see the forest for the trees: On the infinite divisibility of unlabeled forests
  M. Bassan, S. Donderwinkel, and B. Kolesnik
  arXiv:2507.16650Link opens in a new window
• The snake in the Brownian sphere
  O. Angel, E. Jacob, B. Kolesnik, and G. Miermont
  arXiv:2502.13074Link opens in a new window
• Tournament score sequences, Erdős–Ginzburg–Ziv numbers, and the Lévy–Khintchine method
  M. Bassan, S. Donderwinkel, and B. Kolesnik
  arXiv:2407.01441Link opens in a new window
• Graphical sequences and plane trees
  M. Bassan, S. Donderwinkel, and B. Kolesnik
  arXiv:2406.05110Link opens in a new window
• Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
  S. Donderwinkel and B. Kolesnik
  arXiv:2403.12941Link opens in a new window
• Tournaments and random walks
  S. Donderwinkel and B. Kolesnik
  arXiv:2403.12940Link opens in a new window
• Coxeter tournaments
  B. Kolesnik and M. Sanchez
  arXiv:2302.14002Link opens in a new window

Publications

• Catalan percolation
  E. Archer, I. Hartarsky, B. Kolesnik, S. Olesker-Taylor, B. Schapira, and D. Valesin
  Probab. Theory Related FieldsLink opens in a new window
  Special Issue: In Celebration of Geoffrey Grimmett's 70th Birthday
  arXiv:2404.19583Link opens in a new window
• Coxeter interchange graphs
  B. Kolesnik, R. Mitchell, and T. Przybyłowski
  Ann. Comb.Link opens in a new window
  arXiv:2312.04532Link opens in a new window
• Critical beta-splitting, via contraction
  B. Kolesnik
  Electron. Commun. Probab.Link opens in a new window
  arXiv:2404.16021Link opens in a new window
• Random walks on Coxeter interchange graphs
  M. Buckland, B. Kolesnik, R. Mitchell, and T. Przybyłowski
  Electron. J. Probab.Link opens in a new window
  arXiv.2401.17210Link opens in a new window
• H-percolation with a random H
  Z. Bartha, B. Kolesnik, and G. Kronenberg
  Electron. Commun. Probab.Link opens in a new window
  arXiv:2312.03663Link opens in a new window
• Annihilating branching Brownian motion
  D. Ahlberg, O. Angel, and B. Kolesnik
  Int. Math. Res. Not. IMRNLink opens in a new window
  arXiv:2312.03669Link opens in a new window
• Weakly saturated random graphs
  Z. Bartha and B. Kolesnik
  Random Structures AlgorithmsLink opens in a new window
  arXiv:2007.14716Link opens in a new window
• The geometry of random tournaments
  B. Kolesnik and M. Sanchez
  Discrete Comput. Geom.Link opens in a new window
  arXiv:2009.09322Link opens in a new window
• The asymptotic number of score sequences
  B. Kolesnik
  CombinatoricaLink opens in a new window
  arXiv:2209.13563Link opens in a new window
• Transitive closure in a polluted environment
  J. Gravner and B. Kolesnik
  Ann. Appl. Probab.Link opens in a new window
  arXiv:1910.01800Link opens in a new window
• Large deviations of the greedy independent set algorithm on sparse random graphs
  B. Kolesnik
  Random Structures AlgorithmsLink opens in a new window
  arXiv:2011.04613Link opens in a new window
• To stay discovered: On tournament mean score sequences and the Bradley–Terry model
  D. Aldous and B. Kolesnik
  Stochastic Process. Appl.Link opens in a new window
  Special Issue: In Memoriam: Larry Shepp
  arXiv:1811.06662Link opens in a new window
• The sharp K4-percolation threshold on the Erdős–Rényi random graph
  B. Kolesnik
  Electron. J. Probab.Link opens in a new window
  arXiv:1705.08882Link opens in a new window
• Large deviations for subcritical bootstrap percolation on the Erdős–Rényi graph
  O. Angel and B. Kolesnik
  J. Stat. Phys.Link opens in a new window
  arXiv:1705.06815Link opens in a new window
• Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
  P. Diaconis and B. Kolesnik
  Adv. in Appl. Math.Link opens in a new window
  arXiv:1907.02333Link opens in a new window
• Sharp thresholds for contagious sets in random graphs
  O. Angel and B. Kolesnik
  Ann. Appl. Probab.Link opens in a new window
  arXiv:1611.10167Link opens in a new window
• Stability of geodesics in the Brownian map
  O. Angel, B. Kolesnik and G. Miermont
  Ann. Probab.Link opens in a new window
  arXiv:1502.04576Link opens in a new window
• Lower bounds for the isoperimetric numbers of random regular graphs
  B. Kolesnik and N. Wormald
  SIAM J. Discrete Math.Link opens in a new window
  arXiv:1311.6555Link opens in a new window