• Corpus ID: 209515446

Clustering and percolation on superpositions of Bernoulli random graphs

  title={Clustering and percolation on superpositions of Bernoulli random graphs},
  author={Mindaugas Bloznelis and Lasse Leskela},
  journal={arXiv: Probability},
Let $W=\{w_1,\dots, w_m\}$ be a finite set. Given integers $x_1,\dots,x_n\in[0, m]$ and numbers $q_1,...,q_n \in [0,1]$, let $D_1,\dots,D_n$ be independent uniformly distributed random subsets of $W$ of sizes $|D_i|=x_i$, $1\le i\le n$. Let $G_n$ be the union of independent Bernoulli random graphs $G(x_i, q_i),$ $1\le i\le n$, with vertex sets $D_1,\dots, D_n$. For $m,n\to+\infty$ such that $m=\Theta(n)$ we show that $G_n$ admits a tunable (asymptotic) power law degree distribution and non… 
Assortativity and bidegree distributions on Bernoulli random graph superpositions
An asymptotic formula is presented for the joint degree distribution of adjacent nodes of a probabilistic generative network model that yields a simple analytical formula for the model assortativity, and opens up ways to analyze rank correlation coefficients suitable for random graphs with heavy-tailed degree distributions.
Clique and cycle frequencies in a sparse random graph model with overlapping communities
Large-scale approximations of clique and cycle frequencies for graph samples generated by this model are presented, which are valid for regimes with bounded and unbounded number of overlapping communities.
Algorithms and Models for the Web Graph: 17th International Workshop, WAW 2020, Warsaw, Poland, September 21–22, 2020, Proceedings
We report on the use of novel mathematical methods in hypergraph analytics over a large quantity of DNS data. Hypergraphs generalize graphs, as used in network science, to better model complex
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs
The normal and stable approximation to the number of small cliques, cycles and more general 2-connected subgraphs in the network model defined by a superposition of Bernoulli random graphs that admits non-vanishing global clustering coefficient and power law degrees is established.
The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering
<jats:p>In this paper, we study the largest component of the near-critical random intersection graph <jats:inline-formula> <math xmlns="http://www.w3.org/1998/Math/MathML"


The Largest Component in an Inhomogeneous Random Intersection Graph with Clustering
A first-order asymptotic is established as $n\to \infty$ for the order of the largest connected component $N_1=n(1-Q(0)), N_1+o_P(n)$ is the average of nonextinction probabilities of a related multitype Poisson branching process.
Local probabilities of randomly stopped sums of power-law lattice random variables
Let $X_1$ and $N$ be non-negative integer valued power law random variables. For a randomly stopped sum $S_N=X_1+\cdots+X_N$ of independent and identically distributed copies of $X_1$ we establish a
On the Largest Component of a Hyperbolic Model of Complex Networks
The present paper focuses on the evolution of the component structure of the random graph, and shows that for $\alpha > 1$ and $\nu$ arbitrary, with high probability, as the number of vertices grows, the largest component of therandom graph has sublinear order.
Robustness of scale-free spatial networks
The study of robustness for graphs, in which new vertices are given a spatial position on the $d$-dimensional torus and are connected to existing vertices with a probability favouring short spatial distances and high degrees, implies that robustness of a scale-free network depends not only on its power-law exponent but also on its clustering features.
Moment-Based Parameter Estimation in Binomial Random Intersection Graph Models
This paper discusses the estimation of these parameters from a single observed instance of the graph, using moment estimators based on observed degrees and frequencies of 2-stars and triangles, and confirms that the empirical transitivity coefficient is with high probability close to the theoretical clustering coefficient of the model.
Clustering in a hyperbolic model of complex networks
It is shown that the clustering coefficient tends in probability to a constant $\gamma$ that the author gives explicitly as a closed form expression in terms of $\alpha, \nu$ and certain special functions.
Correlation Between Clustering and Degree in Affiliation Networks
This paper evaluates the probability that two randomly selected neighbors of a random vertex of degree (at least) $k$ are adjacent for a power law random intersection graph, and shows that the probability obeys the scaling of $k^{-\delta}$ as $k\to+\infty$.
A new approach to the giant component problem
A new sharp result is obtained for the giant component just above the threshold of a random graph with a given degree sequence, generalizing the case of G(n,p) with np=1+omega( n)n^{-1/3}, where omega(n) tends to infinity arbitrarily slowly.
The phase transition in inhomogeneous random graphs
The “classical” random graph models, in particular G(n,p), are “homogeneous,” in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the
Parameter estimators of random intersection graphs with thinned communities
It is proved that the parameters of this model can be consistently estimated in the large and sparse limiting regime using moment estimators based on partially observed densities of links, 2-stars, and triangles.