相关论文: Phase transition for the frog model

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

We define and analyze random quantum walks on homogeneous trees of degree $q\geq 3$. Such walks describe the discrete time evolution of a quantum particle with internal degree of freedom in $\C^q$ hopping on the neighboring sites of the…

We consider a stochastic model describing the spiking activity of a countable set of neurons spatially organized into a homogeneous tree of degree $d$, $d \geq 2$; the degree of a neuron is just the number of connections it has. Roughly,…

Although it is well-known that some exponential family random graph model (ERGM) families exhibit phase transitions (in which small parameter changes lead to qualitative changes in graph structure), the behavior of other models is still…

In this paper, we introduce a spatial model for dormancy in random environment via a two-type branching random walk in continuous-time, where individuals can switch between dormant and active states through spontaneous switching independent…

We study the simple random walk on the giant component of a supercritical Erd\H{o}s-R\'enyi random graph on $n$ vertices, in particular the so-called vacant set at level $u$, the complement of the trajectory of the random walk run up to a…

It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…

We study the frog model on $\mathbb{Z}$ with particle-wise random geometric lifetimes: each particle has a survival parameter $\pi\in(0,1)$ sampled i.i.d., whose density near $1$ satisfies $f_\pi(u)\sim (1-u)^{\beta-1}L\big((1-u)^{-1}\big)$…

A lattice model for active matter is studied numerically, showing that it displays wettings transitions between three distinctive phases when in contact with an impenetrable wall. The particles in the model move persistently, tumbling with…

We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…

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…

We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the…

We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…

We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…

Given a discrete random walk on a finite graph $G$, the vacant set and vacant net are, respectively, the sets of vertices and edges which remain unvisited by the walk at a given step $t$.%These sets induce subgraphs of the underlying graph.…

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…

The relaxation dynamics of zero range process (ZRP) has always been an interesting problem. In this study, we set up the relationship between ZRP and traps model, and investigate the slow dynamics of ZRP in the framework of traps model.…

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…