English
Related papers

Related papers: The contact process on random hyperbolic graphs: m…

200 papers

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…

Probability · Mathematics 2013-04-18 Achillefs Tzioufas

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

We study the locality of critical percolation on finite graphs: let $G_n$ be a sequence of finite graphs, converging locally weakly to a (random, rooted) infinite graph $G$. Consider Bernoulli edge percolation: does the critical probability…

Probability · Mathematics 2022-12-13 Michael Ren , Nike Sun

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…

Probability · Mathematics 2023-12-12 John Fernley , Peter Mörters , Marcel Ortgiese

In this paper we introduce a contact process on a dynamical long range percolation (CPDLP) defined on a complete graph $(V,\mathcal{E})$. A dynamical long range percolation is a Feller process defined on the edge set $\mathcal{E}$, which…

Probability · Mathematics 2023-11-27 Marco Seiler , Anja Sturm

We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on $n$ vertices. Let $p$ be the edge probability, and write $p=\frac{1+\vep}{2(n-1)}$ for some $\vep\in \R$. In Borgs…

Probability · Mathematics 2008-12-15 Remco van der Hofstad , Malwina J. Luczak

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

Data Structures and Algorithms · Computer Science 2024-06-05 John Larkin

In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…

Analysis of PDEs · Mathematics 2023-07-25 Nathalie Ayi , Nastassia Pouradier Duteil

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

Probability · Mathematics 2010-02-16 Nina Gantert , Yueyun Hu , Zhan Shi

The contact process with an asymptomatic state, introduced in [Belhadji, Lanchier and Mercer, Stochastic Process. Appl., 176:104417, 2024], is a natural variant of the basic contact process that distinguishes between asymptomatic (state 1)…

Probability · Mathematics 2025-10-27 Nicolas Lanchier

We studied metastability and extinction time of a finite system with a large number of interacting components in discrete time by means of analytical and numerical investigation. The system is markovian with respect to the potential profile…

Adaptation and Self-Organizing Systems · Physics 2018-12-27 L. Brochini , M. Abadi

The article deals with two classes of growing random graphs following the preferential attachment rule with a linear weight function, L-graphs, and hybrid Pennock graphs. We determine the exact final vertex degree distribution and the exact…

Probability · Mathematics 2020-09-08 V. N. Zadorozhnyi , E. B. Yudin

The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…

Probability · Mathematics 2023-11-21 Arnaud Rousselle , Ercan Sönmez

A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…

Probability · Mathematics 2021-06-15 Shankar Bhamidi , Nicolas Broutin , Sanchayan Sen , Xuan Wang

Mechanical responses of soft particle packings to quasi-static deformations are determined by the microscopic restructuring of force-chain networks, where complex non-affine displacements of constituent particles cause the irreversible…

Soft Condensed Matter · Physics 2015-07-17 Kuniyasu Saitoh , Vanessa Magnanimo , Stefan Luding

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

Statistical Mechanics · Physics 2011-11-16 E. Ben-Naim , P. L. Krapivsky

Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…

Physics and Society · Physics 2017-09-11 Philip Tee , Ian Wakeman , George Parisis , Jonathan Dawes , István Z. Kiss

We study critical spreading dynamics in the two-dimensional contact process (CP) with quenched disorder in the form of random dilution. In the pure model, spreading from a single particle at the critical point $\lambda_c$ is characterized…

Condensed Matter · Physics 2009-10-28 Adriana G. Moreira , Ronald Dickman

We present a finite-size scaling theory of a contact process with permanent immunity on uncorrelated scale-free networks. We model an epidemic outbreak by an analog of the susceptible-infected-removed model where an infected individual…

Statistical Mechanics · Physics 2022-12-20 D. S. M. Alencar , T. F. A. Alves , F. W. S. Lima , G. A. Alves , A. Macedo-Filho , R. S. Ferreira

We consider nonelementary random walks on general hyperbolic spaces. Without any moment condition on the walk, we show that it escapes linearly to infinity, with exponential error bounds. We even get such exponential bounds up to the rate…

Probability · Mathematics 2023-01-18 Sébastien Gouëzel