Related papers: Phase transitions for contact processes on sparse …
Let $A \subseteq \{0,1,\dots,N\}$ be a random set in which each element is included independently with probability $p=p(N)$. Fix an integer $h \geq 2$ and a linear form $$L(x_1,\dots,x_h) := u_1x_1 + \cdots + u_hx_h.$$ We study the random…
In this paper, we study the speed of extinction of continuous state branching processes in subcritical L\'evy environments. More precisely, when the associated L\'evy process to the environment drifts to $-\infty$ and, under a suitable…
Graphons have traditionally served as limit objects for dense graph sequences, with the cut distance serving as the metric for convergence. However, sparse graph sequences converge to the trivial graphon under the conventional definition of…
We establish sufficient conditions for exponential convergence to a unique quasi-stationary distribution in the total variation norm. These conditions also ensure the existence and exponential ergodicity of the Q-process, the process…
We consider extinction times for a class of birth-death processes commonly found in applications, where there is a control parameter which determines whether the population quickly becomes extinct, or rather persists for a long time. We…
We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…
Spreading from a seed is studied by Monte Carlo simulation on a square lattice with two types of sites affecting the rates of birth and death. These systems exhibit a critical transition between survival and extinction. For time- dependent…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
This study explores the relationship between the precise asymptotics of the level-two large deviation rate function and the behavior of metastable stochastic systems. Initially identified for overdamped Langevin dynamics (Ges{\`u} et al.,…
We investigate the dynamic phase transition from partially or fully arrested state to spatiotemporal chaos in coupled logistic maps on a small-world network. Persistence of local variables in coarse grained sense acts as an excellent order…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
We introduce a family of phenomenological cosmological models featuring an interacting dark sector modulated by a sparseness scale parameter, in order to describe the late-time accelerated expansion of the universe. The sparseness scale,…
We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We apply the formalism to finite connectivity attractor neural…
We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
Understanding the spread of diseases through complex networks is of great interest where realistic, heterogeneous contact patterns play a crucial role in the spread. Most works have focused on mean-field behavior -- quantifying how contact…
We explore how heterogeneity in the intensity of interactions between people affects epidemic spreading. For that, we study the susceptible-infected-susceptible model on a complex network, where a link connecting individuals $i$ and $j$ is…
The susceptible--infected--susceptible (SIS) epidemic process on complex networks can show metastability, resembling an endemic equilibrium. In a general setting, the metastable state may involve a large portion of the network, or it can be…