3 papers
math.PR2026
Polynomial mixing for polygonal side matchings
Renan Gross, Anđela Šarković
We introduce a natural Markov chain on chord diagrams, which, at every step, selects two random chords and swaps them if doing so preserves the diagram's genus. This generalizes th…
math.PR2025
Mixing time of the random walk on the giant component of the random geometric graph
Magnus H. Haaland, Anđela Šarković
We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an ed…
math.PR2023
Phase transition for random walks on graphs with added weighted random matching
Zsuzsanna Baran, Jonathan Hermon, Anđela Šarković +1
For a finite graph let be obtained by considering a random perfect matching of and adding the corresponding edges to with weight , while assign…