Anđela Šarković

most citedCutoff for random walk on random graphs with a community structure

1 citations · 1 across the 1 of their papers we have counts for

collaborators

3 papers

math.PR2026

Mixing time of the lazy and simple random walk on a randomly twisted hypercube

Zsuzsanna Baran, Anđela Šarković

We consider a randomly twisted hypercube on $N$ vertices and study a simple or lazy random walk on this graph. We show that for both walks the mixing time is of order $lo g N$ , and…

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 $Z_{n}^{d}$ as follows: for each pair ${x, y}$ we add an edge with prob…

math.PR2022★ 1 cited

Cutoff for random walk on random graphs with a community structure

Jonathan Hermon, Anđela Šarković, Perla Sousi

We consider a variant of the configuration model with an embedded community structure and study the mixing properties of a simple random walk on it. Every vertex has an internal $\…