Related papers: Extinction time for the contact process on general…
We investigate the contact process on scale-free networks evolving by a stationary dynamics whereby each vertex independently updates its connections with a rate depending on its power. This rate can be slowed down or speeded up by virtue…
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 the vertices. It is known that the cover time on any n-vertex, connected graph is at least (1+o(1)) n…
We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…
We are interested in a variation of the SIR (Susceptible/Infected/Recovered) dynamics on the complete graph, in which infected individuals may only spread to neighboring susceptible individuals at fixed rate $\lambda>0$ while recovered…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists a=a(D,C)>0 such that for any graph G, with n vertices and…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We study the contact process running in the one-dimensional lattice undergoing dynamical percolation, where edges open at rate $vp$ and close at rate $v(1-p)$. Our goal is to explore how the speed of the environment, $v$, affects the…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
In numerous papers, the behaviour of stochastic population models is investigated through the sign of a real quantity which is the growth rate of the population near the extinction set. In many cases, it is proven that when this growth rate…
We derive the most basic dynamical properties of random hyperbolic graphs (the distributions of contact and intercontact durations) in the hot regime (network temperature $T > 1$). We show that for sufficiently large networks the contact…
Let $(X_n)_{n\geq 0}$ be a reversible random walk on a graph $G$ satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. As an…
We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…
Motivated by recent findings of enhanced species survival when fragmented habitats are reconnected through narrow strips of land [S. Pimm, and C. N. Jenkins, Am. Sci. {\bf 107}(3), 162 (2019).], we study the effect of a corridor connecting…
The burning number is a recently introduced graph parameter indicating the spreading speed of content in a graph through its edges. While the conjectured upper bound on the necessary numbers of time steps until all vertices are reached is…
We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the…
In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…