Related papers: Extinction time for the contact process on general…
The non-equilibrium phase transition in models for epidemic spreading with long-range infections in combination with incubation times is investigated by field-theoretical and numerical methods. Here the spreading process is modelled by…
In this paper we study the cover time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs on $\mathrm{Poi}(n)$ vertices. We show that the cover time undergoes a jump at the connectivity…
We give a short and completely elementary method to find the full spectrum of the exclusion process and a nicely limited superset of the spectrum of the interchange process (a.k.a.\ random transpositions) on the complete graph. In the case…
The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…
We consider the problem of finding the graph on which an epidemic cascade spreads, given only the times when each node gets infected. While this is a problem of importance in several contexts -- offline and online social networks,…
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 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…
Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices…
We consider a supercritical branching process and define a contact tracing mechanism on its genealogical tree. We calculate the growth rate of the post tracing process, and give conditions under which the tracing is strong enough to drive…
We investigate the temporal evolution and spatial propagation of branching annihilating random walks in one dimension. Depending on the branching and annihilation rates, a few-particle initial state can evolve to a propagating finite…
To study later spatial evolutionary games based on the multitype contact process, we first focus in this paper on the conditions for survival/extinction in the presence of only one strategy, in which case our model consists of a variant of…
Let $T$ be the extinction moment of a critical branching process $Z=(Z_{n},n\geq 0) $ in a random environment specified by iid probability generating functions. We study the asymptotic behavior of the probability of extinction of the…
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $\lambda$. There is a threshold for $\lambda$, which is called $\lambda_w$, that separates almost sure global extinction from global…
Spatially explicit models have been widely used in today's mathematical ecology and epidemiology to study persistence and extinction of populations as well as their spatial patterns. Here we extend the earlier work--static dispersal between…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
We consider the problem of extinction processes on random networks with a given structure. For sufficiently large well-mixed populations, the process of extinction of one or more state variable components occurs in the tail of the…
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…
The spread of an infection, a contagion, meme, emotion, message and various other spreadable objects have been discussed in several works. Burning and firefighting have been discussed in particular on static graphs. Graph burning simulates…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all vertices of the graph. It is known that the cover time of any finite connected $n$-vertex graph is at least…