Related papers: Accessibility percolation on n-trees
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 [6]. We describe our results…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$.…
In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyze the formation of paths within such networks. Moreover, the presence of the…
Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
Functional effects of different mutations are known to combine to the total effect in highly nontrivial ways. For the trait under evolutionary selection (`fitness'), measured values over all possible combinations of a set of mutations yield…
We give a characterization of the percolation threshold for a multirange model on oriented trees, as the first positive root of a polynomial, with the use of a multi-type Galton-Watson process. This gives in particular the exact value of…
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…
Percolation is a concept widely used in many fields of research and refers to the propagation of substances through porous media (e.g., coffee filtering), or the behaviour of complex networks (e.g., spreading of diseases). Percolation…
This paper is dedicated to the memory of Dietrich Stauffer, who was a pioneer in percolation theory and applications of it to problems of society, such as epidemiology. An epidemic is a percolation process gone out of control, that is,…
We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive…
In this paper we study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex becomes active if at least…
We make the first steps towards generalizing the theory of stochastic block models, in the sparse regime, towards a model where the discrete community structure is replaced by an underlying geometry. We consider a geometric random graph…
In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…
We study bootstrap percolation with the threshold parameter $\theta \geq 2$ and the initial probability $p$ on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…