English
Related papers

Related papers: The frog model on non-amenable trees

200 papers

We show that a system of spinless Fermi particles, localized on the sites of the Bethe lattice with coordination number z and interacting through a repulsive nearest-neighbor interaction, exhibits a phase transition to a charge-ordered…

Strongly Correlated Electrons · Physics 2008-09-09 Ferdinando Mancini , Francesco Paolo Mancini , Adele Naddeo

The aim of this paper is to discuss the mathematical modeling of Brownian active particle systems, a recently popular paradigmatic system for self-propelled particles. We present four microscopic models with different types of repulsive…

Statistical Mechanics · Physics 2022-05-31 M. Bruna , M. Burger , A. Esposito , S. M. Schulz

We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…

We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…

Probability · Mathematics 2023-01-03 Benjamin Hackl , Alois Panholzer , Stephan Wagner

We consider the soft-core Widom-Rowlinson model for particles with spins and holes, on a Cayley tree of order $d$ (which has $d + 1$ nearest neighbours), depending on repulsion strength $\beta$ between particles of different signs and on an…

Probability · Mathematics 2023-02-14 Sebastian Bergmann , Sascha Kissel , Christof Kuelske

We study absorbing phase transitions in the one-dimensional branching annihilating random walk with long-range repulsion. The repulsion is implemented as hopping bias in such a way that a particle is more likely to hop away from its closest…

Statistical Mechanics · Physics 2023-07-26 Su-Chan Park

We consider random dynamics on a uniform random recursive tree with $n$ vertices. Successively, in a uniform random order, each edge is either set on fire with some probability $p_n$ or fireproof with probability $1-p_n$. Fires propagate in…

Probability · Mathematics 2016-02-17 Cyril Marzouk

We prove that the probability the frog model with death and drift on the $d$-ary tree is recurrent can be made positive and thus is not monotone in the drift parameter.

Probability · Mathematics 2025-10-22 Samyah Ahmed , Matthew Junge

Active particle systems are a class of non-equilibrium systems composed of self-propelled Brownian particles; through interactions between particles within the system, a variety of intriguing collective behaviors can emerge. Based on…

Soft Condensed Matter · Physics 2025-09-25 Sihang Guo , Guangyu Yang , Guoqing Meng , Yingying Wang , Junxing Pan , Jinjun Zhang

We investigate a model of a parasite population invading spatially distributed immobile hosts on a graph, which is a modification of the frog model. Each host has an unbreakable immunity against infection with a certain probability $1-p$…

Probability · Mathematics 2026-01-27 Sascha Franck

This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…

Probability · Mathematics 2024-12-24 Célio Terra

An important characteristic of flocks of birds, school of fish, and many similar assemblies of self-propelled particles is the emergence of states of collective order in which the particles move in the same direction. When noise is added…

Statistical Mechanics · Physics 2015-01-19 M. Aldana , V. Dossetti , C. Huepe , V. M. Kenkre , H. Larralde

We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…

Probability · Mathematics 2021-04-13 Josué Corujo

We study an interacting particle system whose dynamics depends on an interacting random environment. As the number of particles grows large, the transition rate of the particles slows down (perhaps because they share a common resource of…

Probability · Mathematics 2009-02-16 Charles Bordenave , David McDonald , Alexandre Proutiere

Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…

Probability · Mathematics 2011-04-21 Elisabetta Candellero , Lorenz A. Gilch

In contrast to equilibrium systems, inertia can profoundly impact the phase behavior of active systems. This has been made particularly evident in recent years, with motility-induced phase separation (MIPS) exhibiting several intriguing…

Soft Condensed Matter · Physics 2025-04-21 Jiechao Feng , Ahmad K. Omar

We consider a simple analytically tractable model of metastability and ageing. In this model, a particle can jump left or right by two steps to an unoccupied site, but only if the the site in between is occupied. We show that the model is…

Statistical Mechanics · Physics 2008-02-03 Deepak Dhar

We introduce an interacting particle system that models the spread of an epidemic in terms of heterogeneous diffusive dynamics, rather than exogenous contact and transmission rates at the population level as in classical compartmental…

Probability · Mathematics 2026-05-20 Eliana Fausti , Andreas Sojmark

Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…

Soft Condensed Matter · Physics 2025-10-30 Agniva Datta , Carsten Beta , Robert Großmann

We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees…

Machine Learning · Statistics 2010-09-15 Myung Jin Choi , Vincent Y. F. Tan , Animashree Anandkumar , Alan S. Willsky