Andrea Collevecchio

most citedThree steps mixing for general random walks on the hypercube at criticality

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

collaborators

3 papers

math.PR2020★ 1 cited

Three steps mixing for general random walks on the hypercube at criticality

Andrea Collevecchio, Robert Griffiths

We introduce a general class of random walks on the $N$ -hypercube, study cut-off for the mixing time, and provide several types of representation for the transition probabilities.…

math-ph2014

The worm algorithm for the Ising model is rapidly mixing

Andrea Collevecchio, Timothy M. Garoni, Timothy Hyndman +1

We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we…

math.PR2014

Longest paths in random Apollonian networks and largest $r$ -ary subtrees of random $d$ -ary recursive trees

Andrea Collevecchio, Abbas Mehrabian, Nick Wormald

Let $r$ and $d$ be positive integers with $r < d$ . Consider a random $d$ -ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random…

Three steps mixing for general random walks on the hypercube at criticality

The worm algorithm for the Ising model is rapidly mixing

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees

Longest paths in random Apollonian networks and largest $r$ -ary subtrees of random $d$ -ary recursive trees