Related papers: Phase transitions for contact processes on sparse …
We investigate vertex levels of containment in a random hypergraph grown in the spirit of a recursive tree. We consider a local profile tracking the evolution of the containment of a particular vertex over time, and a global profile…
The idea of a metapopulation has become canonical in ecology. Its original mean field form provides the important intuition that migration and extinction interact to determine the dynamics of a population composed of subpopulations. From…
We confirm the long-standing prediction that $c=e\approx 2.718$ is the threshold for the emergence of a non-vanishing absolutely continuous part (extended states) at zero in the limiting spectrum of the Erd\H{o}s-Renyi random graph with…
Scale-free configuration models are intimately connected to power law Galton-Watson trees. It is known that contact process epidemics can propagate on these trees and therefore these networks with arbitrarily small infection rate, and this…
The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter lambda is varied. For small values of lambda a single infection eventually dies out. For larger lambda the…
In a recent work, a new numerical method (the lifespan method) has been introduced to study the critical properties of epidemic processes on complex networks [Phys. Rev. Lett. \textbf{111}, 068701 (2013)]. Here, we present a detailed…
Consider compound Poisson processes with negative drift and no negative jumps, which converge to some spectrally positive L\'evy process with non-zero L\'evy measure. In this paper we study the asymptotic behavior of the local time process,…
We investigate extinction of a long-lived self-regulating stochastic population, caused by intrinsic (demographic) noise. Extinction typically occurs via one of two scenarios depending on whether the absorbing state n=0 is a repelling…
We consider a threshold epidemic model on a clustered random graph with overlapping communities. In other words, our epidemic model is such that an individual becomes infected as soon as the proportion of her infected neighbors exceeds the…
We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…
Over the past two decades, there has been a tremendous increase in the growth of representation learning methods for graphs, with numerous applications across various fields, including bioinformatics, chemistry, and the social sciences.…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
In this work we study by numerical methods the phase dynamics in ballistic graphene-based short Josephson junctions. The supercurrent through a graphene junction shows a non-sinusoidal phase-dependence, unlike a conventional junction ruled…
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…
We present a new model for time evolution of fast magnetic reconnection in free space, which is characterized by self-similarity. Reconnection triggered by locally enhanced resistivity assumed at the center of the current sheet can…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
We analyse the stability of linear dynamical systems defined on sparse, random graphs with predator-prey, competitive, and mutualistic interactions. These systems are aimed at modelling the stability of fixed points in large systems defined…
In this paper we are concerned with the contact process on the squared lattice. The contact process intuitively describes the spread of the infectious disease on a graph, where an infectious vertex becomes healthy at a constant rate while a…
We consider dynamical graphs, namely graphs that evolve over time, and investigate a notion of local weak convergence that extends naturally the usual Benjamini-Schramm local weak convergence for static graphs. One of the well-known results…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…