activity
20082026
most citedCutoff for Random Walk on Dynamical Erdős--Rényi Graph

11 citations · 58 across the 27 of their papers we have counts for

collaborators

40 papers

math.PR2026

Random walk on the small-world network model in 3 or more dimensions

Zsuzsanna Baran, Jonathan Hermon, Anđela Šarković +2

We study the mixing time of a simple random walk on the small-world network defined by adding edges to as follows: for each pair we add an edge with prob…

math.PR2025

Derivative formula for capacities

Amine Asselah, Bruno Schapira, Perla Sousi

We obtain a derivative formula for various notions of capacity. Namely we identify the second order term in the asymptotic expansion of the capacity of a union of two sets, as thei…

math.PR2025

Capacity in high dimensional percolation

Amine Asselah, Bruno Schapira, Perla Sousi

We introduce a notion of capacity for high dimensional critical percolation by showing that for any finite set , the suitably rescaled probability that the cluster of inters…

math.PR2023

Phase transition for the late points of random walk

Alexis Prévost, Pierre-François Rodriguez, Perla Sousi

Let be a random walk on the torus of side length in dimension with uniform starting point, and be the expected value of its cover time, which is…

math.PR2023★ 1 cited

Branching random walks and Minkowski sum of random walks

Amine Asselah, Izumi Okada, Bruno Schapira +1

We show that the range of a critical branching random walk conditioned to survive forever and the Minkowski sum of two independent simple random walk ranges are intersection-equiva…

math.PR2023★ 1 cited

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…