Related papers: Phase transitions for contact processes on one-dim…
We study the discrete-time threshold-$\theta \geq 2$ contact process on random graphs of general degrees. For random graphs with a given degree distribution $\mu$, we show that if $\mu$ is lower bounded by $\theta+2$ and has finite $k$th…
We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density,…
The Contact Process has been studied on complex networks exhibiting different kinds of quenched disorder. Numerical evidence is found for Griffiths phases and other rare region effects, in Erd\H os R\'enyi networks, leading rather…
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 consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
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…
Quenched disorder is known to play a relevant role in dynamical processes and phase transitions. Its effects on the dynamics of complex networks have hardly been studied. Aimed at filling this gap, we analyze the Contact Process, i.e. the…
We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…
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…
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or…
The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…
Dynamical processes occurring on top of complex networks have become an exciting area of research. Quenched disorder plays a relevant role in general dynamical processes and phase transitions, but the effect of topological quenched disorder…
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 perform extensive Monte Carlo simulations of the 10-state Potts model on quenched two-dimensional $\Phi^3$ gravity graphs to study the effect of quenched coordination number randomness on the nature of the phase transition, which is…
We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…
The quadratic contact process (QCP) is a natural extension of the well studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate $\lambda$ and infected individuals recover ($1 \longrightarrow 0$)…
We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random…
New theoretical and numerical analysis of the one-dimensional contact process with quenched disorder are presented. We derive new scaling relations, different from their counterparts in the pure model, which are valid not only at the…