Search Results - "Collevecchio, Andrea"

A Class of Non-Reversible Hypercube Long-Range Random Walks and Bernoulli Autoregression by Collevecchio, Andrea, Griffiths, Robert

“…We study a large class of long-range random walks which take values on the vertices of an N -dimensional hypercube. These processes are connected with…”
Get full text

The Branching‐Ruin Number and the Critical Parameter of Once‐Reinforced Random Walk on Trees by Collevecchio, Andrea, Kious, Daniel, Sidoravicius, Vladas

“…The motivation for this paper is the study of the phase transition for recurrence/ transience of a class of self‐interacting random walks on trees, which…”
Get full text

ON A PREFERENTIAL ATTACHMENT AND GENERALIZED PÓLYA'S URN MODEL by Collevecchio, Andrea, Cotar, Codina, LiCalzi, Marco

“…We study a general preferential attachment and Pólya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing…”
Get full text

Phase transitions for edge-reinforced random walks on the half-line by Akahori, Jiro, Collevecchio, Andrea, Takei, Masato

Get full text

Limit theorems for vertex-reinforced jump processes on regular trees by Collevecchio, Andrea

Get full text

Limit theorems for reinforced random walks on certain trees by COLLEVECCHIO, Andrea

“…Consider a linearly edge-reinforced random walk defined on the b-ary tree, b</70. We prove the strong law of large numbers for the distance of this process…”
Get full text

A note on recurrence of the Vertex reinforced jump process and fractional moments localization by Collevecchio, Andrea, Zeng, Xiaolin

“…We give a simple proof for recurrence of vertex reinforced jump process on \(\mathbb{Z}^d\), under strong reinforcement. Moreover, we show how the previous…”
Get full text

When “Better” is better than “Best” by Amiet, Ben, Collevecchio, Andrea, Hamza, Kais

“…We consider two-player normal form games where each player has the same finite strategy set. The payoffs of each player are assumed to be i.i.d. random…”
Get full text

On the Transience of Processes Defined on Galton-Watson Trees by Collevecchio, Andrea

“…We introduce a simple technique for proving the transience of certain processes defined on the random tree$\scr{G}$generated by a supercritical branching…”
Get full text

Limit theorems and ergodicity for general bootstrap random walks by Collevecchio, Andrea, Hamza, Kais, Shi, Meng, Williams, Ruth J.

Get full text

Vertex-reinforced jump process on the integers with nonlinear reinforcement by Collevecchio, Andrea, Nguyen, Tuan-Minh, Volkov, Stanislav

“…We consider a nonlinear vertex-reinforced jump process (VRJP(w)) on Z with an increasing measurable weight function w : [1, ∞) → [1, ∞) and initial weights…”
Get full text

Bootstrap random walks by Collevecchio, Andrea, Hamza, Kais, Shi, Meng

“…Consider a one dimensional simple random walk X=(Xn)n≥0. We form a new simple symmetric random walk Y=(Yn)n≥0 by taking sums of products of the increments of X…”
Get full text

On the speed of once-reinforced biased random walk on trees by Collevecchio, Andrea, Holmes, Mark, Kious, Daniel

Get full text

Long range one-cookie random walk with positive speed by Collevecchio, Andrea, Hamza, Kais, Nguyen, Tuan-Minh

“…We study one-dimensional excited random walks with non-nearest neighbour jumps. When the process is at a vertex that has not been visited before, its next…”
Get full text

A deterministic walk on the randomly oriented Manhattan lattice by Collevecchio, Andrea, Hamza, Kais, Tournier, Laurent

Get full text

The Worm Process for the Ising Model is Rapidly Mixing by Collevecchio, Andrea, Garoni, Timothy M., Hyndman, Timothy, Tokarev, Daniel

“…We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a…”
Get full text

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees by Collevecchio, Andrea, Mehrabian, Abbas, Wormald, Nick

“…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…”
Get full text

The branching-ruin number as critical parameter of random processes on trees by Collevecchio, Andrea, Huynh, Cong Bang, Kious, Daniel

Get full text

Bounds on the speed and on regeneration times for certain processes on regular trees by Collevecchio, Andrea, Schmitz, Tom

“…We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this…”
Get full text

BOUNDS ON THE SPEED AND ON REGENERATION TIMES FOR CERTAIN PROCESS ON REGULAR TREES by Collevecchio, Andrea, Schmitz, Tom

“…We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this…”
Get full text