The number of triangles in random intersection graphs

DOI10.1007/s40304-021-00270-7zbMath1525.05169OpenAlexW4318401441MaRDI QIDQ6084115

Zhishui Hu, Liang Dong

Publication date: 31 October 2023

Published in: Communications in Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40304-021-00270-7

zbMATH Keywords

Stein's methodPoisson approximationnormal approximationrandom intersection graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Large cliques in sparse random intersection graphs
• The large deviation principle for the Erdős-Rényi random graph
• Component evolution in random intersection graphs
• A note on the component structure in random intersection graphs with tunable clustering
• When are small subgraphs of a random graph normally distributed?
• Normal fluctuations and the FKG inequalities
• A central limit theorem for decomposable random variables with applications to random graphs
• Degree and clustering coefficient in sparse random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
• Epidemics on random intersection graphs
• Exact Kolmogorov and total variation distances between some familiar discrete distributions
• An introduction to large deviations for random graphs
• The shortest distance in random multi-type intersection graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• On the Convergence Rate in the Central Limit Theorem for Weakly Dependent Random Variables
• On Random Intersection Graphs: The Subgraph Problem
• Percolation
• On the total variation distance between the binomial random graph and the random intersection graph
• The vertex degree distribution of random intersection graphs
• Poisson Approximation of the Number of Cliques in Random Intersection Graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Moment-Based Parameter Estimation in Binomial Random Intersection Graph Models
• KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
• On stirling numbers of the second kind
• Association of Random Variables, with Applications
• The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs

This page was built for publication: The number of triangles in random intersection graphs