Clustering and percolation on superpositions of Bernoulli random graphs

DOI10.1002/RSA.21140MaRDI QIDQ6076719zbMATH OpenOpenAlexFDO

Authors Mindaugas Bloznelis, Lasse Leskelä

Publication date 17 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1912.13404

zbMATH Keywords

power lawrandom graphcomplex networkclustering coefficientintersection graphbond percolationgiant componentsite percolationoverlapping communities

Mathematics Subject Classification ID

Statistics (62-XX) Statistical mechanics, structure of matter (82-XX)

Abstract: A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,dots,G_m$ with variable sizes and densities. The model is parameterised by a joint distribution $P_n$ of layer sizes and densities. When $m$ grows linearly and $P_{n}oP$ as $noinfty$, the model generates sparse random graphs with a rich statistical structure, admitting a nonvanishing clustering coefficient together with a limiting degree distribution and clustering spectrum with tunable power-law exponents. Remarkably, the model admits parameter regimes in which bond percolation exhibits two phase transitions: the first related to the emergence of a giant connected component, and the second to the appearance of gigantic single-layer components.

Cites work

• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 3504209 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A guided tour in random intersection graphs
• A note on the component structure in random intersection graphs with tunable clustering
• An introduction to heavy-tailed and subexponential distributions
• Approximating sparse graphs: The random overlapping communities model
• Clustering in a hyperbolic model of complex networks
• Community detection and stochastic block models: recent developments
• Component evolution in general random intersection graphs
• Correlation between clustering and degree in affiliation networks
• Degree and clustering coefficient in sparse random intersection graphs
• Epidemics on Random Graphs with Tunable Clustering
• Epidemics on random intersection graphs
• Finite exchangeable sequences
• Introduction to Random Graphs
• Le Cam's Inequality and Poisson Approximations
• Local clustering coefficient of spatial preferential attachment model
• Local probabilities of randomly stopped sums of power-law lattice random variables
• Moment-based parameter estimation in binomial random intersection graph models
• On Random Intersection Graphs: The Subgraph Problem
• On a bound of the absolute constant in the Berry-Esseen inequality for i.i.d. Bernoulli random variables
• On the largest component of a hyperbolic model of complex networks
• On the second largest component of random hyperbolic graphs
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• Random graphs and complex networks. Volume 1
• Robustness of scale-free spatial networks
• Sparse random graphs with clustering
• Spatial preferential attachment networks: power laws and clustering coefficients
• Stochastic epidemic models and their statistical analysis
• The Structure and Function of Complex Networks
• The largest component in an inhomogeneous random intersection graph with clustering
• The phase transition in inhomogeneous random graphs
• Two Models of Random Intersection Graphs and their Applications

Cited in

(7)

• Infinite and Giant Components in the Layers Percolation Model
• Scaling of the clustering function in spatial inhomogeneous random graphs
• Clique and cycle frequencies in a sparse random graph model with overlapping communities
• Connectivity of random hypergraphs with a given hyperedge size distribution
• \(k\)-nearest-neighbor clustering and percolation theory
• Two models of sparse and clustered dynamic networks
• Connectivity threshold for superpositions of Bernoulli random graphs

This page was built for publication: Clustering and percolation on superpositions of Bernoulli random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076719)