Related papers: On the Cluster Size Distribution for Percolation o…
The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random partitions of a subset…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…
Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…
We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd\"os-R\'enyi networks, the exponential and the scale-free growing networks. We show that the character of the degree…
We study bond percolation of the Cayley tree (CT) by focusing on the probability distribution function (PDF) of a local variable, namely, the size of the cluster including a selected vertex. Because the CT does not have a dominant bulk…
We prove that the set of possible values for the percolation threshold $p_c$ of Cayley graphs has a gap at 1 in the sense that there exists $\varepsilon_0>0$ such that for every Cayley graph $G$ one either has $p_c(G)=1$ or $p_c(G) \leq…
An interesting problem in statistical physics is the condensation of classical particles in droplets or clusters when the pair-interaction is given by a stable Lennard-Jones-type potential. We study two aspects of this problem. We start by…
The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this…
We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy…
We show that a locally finite, connected graph has a coarse embedding into a Hilbert space if and only if there exist bond percolations with arbitrarily large marginals and two-point function vanishing at infinity. We further show that the…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results are obtained for the random-cluster model on nonamenable graphs with cluster…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
We analyze a simple model for growing tree networks and find that although it never percolates, there is an anomalously large cluster at finite size. We study the growth of both the maximal cluster and the cluster containing the original…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We study the Susceptible-Infected-Susceptible model of the spread of an endemic infection. We calculate an exact expression for the mean number of transmissions for all values of the population and the infectivity. We derive the large-N…
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees,…
We investigate a class of stochastic aggregation processes involving two types of clusters: active and passive. The mass distribution is obtained analytically for several aggregation rates. When the aggregation rate is constant, we find…
Using a measure of clustering derived from the nearest neighbour distribution and the void probability function we are able to distinguish between regular and clustered structures. With an example we show that regularity is a property of a…