相关论文: Percolation on dense graph sequences

Equip each point $x$ of a homogeneous Poisson process $\mathcal{P}$ on $\mathbb{R}$ with $D_x$ edge stubs, where the $D_x$ are i.i.d. positive integer-valued random variables with distribution given by $\mu$. Following the stable…

For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the…

We present a large-deviations/thermodynamic approach to the classic problem of percolation on the complete graph. Specifically, we determine the large-deviation rate function for the probability that the giant component occupies a fixed…

We define a class of random matrix ensembles that pertain to random looped polymers. Such random looped polymers are a possible model for bio-polymers such as chromatin in the cell nucleus. It is shown that the distribution of the largest…

In the present article, numerical simulations have been performed to find the bond and site percolation thresholds on two-dimensional Gabriel graphs (GG) for Poisson point processes. GGs belong to the family of proximity graphs and are…

Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…

One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets…

For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant…

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…

In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…

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…

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…

We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…

We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…

We study the diameter of $C_1$, the largest component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ in the emerging supercritical phase, i.e., for $p = \frac{1+\epsilon}n$ where $\epsilon^3 n \to \infty$ and $\epsilon=o(1)$. This parameter…

In this paper we study the spectrum of the random geometric graph $G(n,r)$, in a regime where the graph is dense and highly connected. In the \erdren $G(n,p)$ random graph it is well known that upon connectivity the spectrum of the…

Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…

For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…

In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…

Random hyperbolic graphs have been suggested as a promising model of social networks. A few of their fundamental parameters have been studied. However, none of them concerns their spectra. We consider the random hyperbolic graph model as…