English
Related papers

Related papers: Percolation phase transition in weight-dependent r…

200 papers

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…

Probability · Mathematics 2015-12-23 M. Eckhoff , J. Goodman , R. van der Hofstad , F. R. Nardi

Let $[\mathcal{P}]$ be the points of a Poisson process on $\mathbb{R}^d$ and $F$ a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set…

Probability · Mathematics 2015-09-24 Maria Deijfen

In the spherical Poisson Boolean model, one takes the union of random balls centred on the points of a Poisson process in Euclidean $d$-space with $d \geq 2$. We prove that whenever the radius distribution has a finite $d$-th moment, there…

Probability · Mathematics 2018-07-24 Mathew D. Penrose

Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…

Statistical Mechanics · Physics 2010-06-16 Hans Hooyberghs , Bert Van Schaeybroeck , Joseph O. Indekeu

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 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…

Probability · Mathematics 2025-08-06 Benedikt Jahnel , Lukas Lüchtrath , Christian Mönch

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

Probability · Mathematics 2007-05-23 K. B. Athreya , A. P. Ghosh , S. Sethuraman

We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of…

Disordered Systems and Neural Networks · Physics 2009-11-13 L. Apolo , O. Melchert , A. K. Hartmann

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…

Probability · Mathematics 2024-12-10 Benedikt Jahnel , Lukas Lüchtrath

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…

Statistical Mechanics · Physics 2015-05-30 Elena Agliari , Claudia Cioli , Enore Guadagnini

In the present work we demonstrate the use of a parcellation free connectivity model based on Poisson point processes. This model produces for each subject a continuous bivariate intensity function that represents for every possible pair of…

Neurons and Cognition · Quantitative Biology 2016-11-21 Daniel Moyer , Boris A. Gutman , Joshua Faskowitz , Neda Jahanshad , Paul M. Thompson

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

Physics and Society · Physics 2015-07-10 Filippo Radicchi

Many processes of spreading and diffusion take place on temporal networks, and their outcomes are influenced by correlations in the times of contact. These correlations have a particularly strong influence on processes where the spreading…

Physics and Society · Physics 2017-09-19 Mikko Kivelä , Jordan Cambe , Jari Saramäki , Márton Karsai

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…

Probability · Mathematics 2020-03-16 Laurent Ménard , Arvind Singh

We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…

Probability · Mathematics 2010-03-30 Ronald Meester , Pieter Trapman

A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…

Physics and Society · Physics 2016-09-21 X. L. Chen , C. Yang , L. F. Zhong , M. Tang

Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…

We investigate the phase transition in a non-planar correlated percolation model with long-range dependence, obtained by considering level sets of a Gaussian free field with mass above a given height $h$. The dependence present in the model…

Probability · Mathematics 2017-08-15 Pierre-François Rodriguez

In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…

Probability · Mathematics 2019-04-17 Alain-Sol Sznitman

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…

Probability · Mathematics 2025-09-08 Peter Gracar , Lukas Lüchtrath , Christian Mönch