Related papers: Extinction time for the contact process on general…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
The SIRS process is a continuous-time process for how infections spread on a graph. In this model, each vertex is in one of the following three states: susceptible (to the infection; S), infected (I), or recovered (R) and thus immune to the…
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…
A procedure called \textit{graph burning} was introduced to facilitate the modelling of spread of an alarm, a social contagion, or a social influence or emotion on graphs and networks. Graph burning runs on discrete time-steps (or rounds).…
An analysis is made on the morphology of the sequences, formed by stars distributed along the line of sight in (V,V--I) colour-magnitude diagrams from Baade's Window (l=1.0,b=-3.9). The extinction is due to an absorbing layer with an…
We study the distribution of the 'gap time', the first time that a large gap appears, in the spatial birth and death point process on $[0,1]$ in which particles are added uniformly in space at rate $\lambda$ and are removed independently at…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with type 1 and type 2 infection, respectively, and the infection…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…
A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…
The partner model is an SIS epidemic in a population with random formation and dissolution of partnerships, and with disease transmission only occuring within partnerships. Foxall, Edwards, and van den Driessche found the critical value and…
In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…
Extinction transition of bacteria under forced rotation is analyzed in pie geometry. Under convection, separation of the radial and the azimuthal degrees of freedom is not possible, and the linearized evolution operator is diagonalized…
The asymptotic behavior, as $n\rightarrow \infty $ of the conditional distribution of the number of particles in a decomposable critical branching process $\mathbf{Z}% (m)=(Z_{1}(m),...,Z_{N}(m)),$ with $N$ types of particles at moment…
The concept of graph burning and burning number ($bn(G)$) of a graph G was introduced recently [1]. Graph burning models the spread of contagion (fire) in a graph in discrete time steps. $bn(G)$ is the minimum time needed to burn a graph…
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…
Disease control is of paramount importance in public health with infectious disease extinction as the ultimate goal. Although diseases may go extinct due to random loss of effective contacts where the infection is transmitted to new…
This study develops the epidemic hitting time (EHT) metric on graphs measuring the expected time an epidemic starting at node $a$ in a fully susceptible network takes to propagate and reach node $b$. An associated EHT centrality measure is…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
We study survival and extinction of a long-range infection process on a diluted one-dimensional lattice in discrete time. The infection can spread to distant vertices according to a Pareto distribution, however spreading is also prohibited…