Clustering and percolation on superpositions of Bernoulli random graphs

Mindaugas Bloznelis, Lasse Leskelä*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)
36 Downloads (Pure)

Abstract

A simple but powerful network model with (Formula presented.) nodes and (Formula presented.) partly overlapping layers is generated as an overlay of independent random graphs (Formula presented.) with variable sizes and densities. The model is parameterized by a joint distribution (Formula presented.) of layer sizes and densities. When (Formula presented.) grows linearly and (Formula presented.) as (Formula presented.), 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.

Original languageEnglish
Pages (from-to)283-342
Number of pages60
JournalRANDOM STRUCTURES AND ALGORITHMS
Volume63
Issue number2
Early online date2023
DOIs
Publication statusPublished - Sept 2023
MoE publication typeA1 Journal article-refereed

Keywords

  • bond percolation
  • clustering coefficient
  • complex network
  • giant component
  • intersection graph
  • Overlapping communities
  • power law
  • random graph
  • site percolation

Fingerprint

Dive into the research topics of 'Clustering and percolation on superpositions of Bernoulli random graphs'. Together they form a unique fingerprint.

Cite this