English
Related papers

Related papers: Degree-penalized contact processes

200 papers

We introduce and study an interacting particle system evolving on the $d$-dimensional torus $(\mathbb Z/N\mathbb Z)^d$. Each vertex of the torus can be either empty or occupied by an individual of type $\lambda \in (0,\infty)$. An…

Probability · Mathematics 2023-06-21 Adrián González Casanova , András Tóbiás , Daniel Valesin

We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…

Probability · Mathematics 2025-12-09 Denis Villemonais , Nicolas Zalduendo

Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process…

Physics and Society · Physics 2015-07-03 June Zhang , José M. F. Moura

We introduce the generalized diffusive epidemic process, which is a metapopulation model for an epidemic outbreak where a non-sedentary population of walkers can jump along lattice edges with diffusion rates $D_S$ or $D_I$ if they are…

We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…

Probability · Mathematics 2021-06-23 Srikanth K. Iyer , Sanjoy Kr. Jhawar

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…

Probability · Mathematics 2012-09-25 Anne-Laure Basdevant , Arvind Singh

We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…

Probability · Mathematics 2008-12-18 Luc Devroye , Svante Janson

We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…

Combinatorics · Mathematics 2024-01-19 Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich

We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…

Probability · Mathematics 2016-04-27 Romain Abraham , Aymen Bouaziz , Jean-François Delmas

This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…

Probability · Mathematics 2017-09-29 Daniela Bertacchi , Pablo M. Rodriguez , Fabio Zucca

We study a two dimensional version of Neuhauser's long range sexual reproduction model and prove results that give bounds on the critical values $\lambda_f$ for the process to survive from a finite set and $\lambda_e$ for the existence of a…

Probability · Mathematics 2016-12-28 Mariya Bessonov , Richard Durrett

We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…

Probability · Mathematics 2024-07-02 Felix Hermann , Peter Pfaffelhuber

A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is…

Probability · Mathematics 2015-09-24 Maria Deijfen

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…

Probability · Mathematics 2008-07-31 Steffen Dereich , Peter Morters

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…

Probability · Mathematics 2012-10-22 Srikanth K. Iyer , Debleena Thacker

The existence of a weak survival region is established for the anisotropic symmetric contact process on a homogeneous tree T_{2d} of degree 2d > 2: For parameter values in a certain connected region of positive Lebesgue measure, the…

Probability · Mathematics 2007-05-23 Irene Hueter

In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…

Probability · Mathematics 2013-03-21 Antar Bandyopadhyay , Farkhondeh Sajadi

The contact process on dynamic edges (CPDE) is a contact process evolving on a dynamic environment given by a dynamical percolation on the edges of Z d\,: each edge updates its state to open or closed with respective rates vp and v(1 -p).…

Probability · Mathematics 2026-02-24 Aurelia Deshayes , Régine Marchand

We study branching diffusions in a bounded domain $D$ of $\mathbb{R}^d$ in which particles are killed upon hitting the boundary $\partial D$. It is known that any such process undergoes a phase transition when the branching rate $\beta$…

Probability · Mathematics 2018-04-24 Ellen Powell

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…

Probability · Mathematics 2024-03-04 Romain Abraham , Sonia Boulal , Pierre Debs