Related papers: The contact process on dynamic regular graphs: mon…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core…
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 give a construction of a tree in which the contact process with any positive infection rate survives but, if a certain privileged edge $e^*$ is removed, one obtains two subtrees in which the contact process with infection rate smaller…
We show results for the contact process on Barabasi networks. The contact process is a model for an epidemic spreading without permanent immunity that has an absorbing state. For finite lattices, the absorbing state is the true stationary…
The basic contact process with parameter $\mu$ altered so that infections of sites that have not been previously infected occur at rate proportional to $\lambda$ instead is considered. Emergence of an infinite epidemic starting out from a…
Networks and dynamical processes occurring on them have become a paradigmatic representation of complex systems. Studying the role of quenched disorder, both intrinsic to nodes and topological, is a key challenge. With this in mind, here we…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…
We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…
Given a hypergraph $\mathcal{H}$, the $\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\mathcal{H}$ in…
We study a susceptible-infected-recovered (SIR) epidemic model on a network of $n$ interacting subpopulations. We analyze the transient and asymptotic behavior of the infection dynamics in each node of the network. In contrast to the…
Digital contact tracing plays a crucial role in alleviating an outbreak, and designing multilevel digital contact tracing for a country is an open problem due to the analysis of large volumes of temporal contact data. We develop a…
Source detection (SD) is the task of finding the origin of a spreading process in a network. Algorithms for SD help us combat diseases, misinformation, pollution, and more, and have been studied by physicians, physicists, sociologists, and…
Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t\}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G$ and then adding these edges one by one to the empty graph…
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…
We study two famous interacting particle systems, the so-called Richardson's model and the contact process, when we add a stirring dynamics to them. We prove that they both satisfy an asymptotic shape theorem, as their analogues without…
We present a modified diffusive epidemic process that has a finite threshold on scale-free graphs. The diffusive epidemic process describes the epidemic spreading in a non-sedentary population, and it is a reaction-diffusion process. In the…
We study the phase transition phenomena for long-range oriented percolation and contact process. We studied a contact process in which the range of each vertex are independent, updated dynamically and given by some distribution $N$. We also…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…