The number of triangles in random intersection graphs
From MaRDI portal
Recommendations
- Poisson approximation of the number of cliques in random intersection graphs
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- Poisson approximation for the number of isolated trees in a random intersection graph
- On the total variation distance between the binomial random graph and the random intersection graph
- Poisson approximation of counts of induced subgraphs in random intersection graphs
Cites work
- A central limit theorem for decomposable random variables with applications to random graphs
- A note on the component structure in random intersection graphs with tunable clustering
- An introduction to large deviations for random graphs
- Association of Random Variables, with Applications
- Component evolution in random intersection graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- 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
- scientific article; zbMATH DE number 3438144 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- Large cliques in sparse random intersection graphs
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Moment-based parameter estimation in binomial random intersection graph models
- Normal fluctuations and the FKG inequalities
- On Random Intersection Graphs: The Subgraph Problem
- On stirling numbers of the second kind
- On the Convergence Rate in the Central Limit Theorem for Weakly Dependent Random Variables
- On the total variation distance between the binomial random graph and the random intersection graph
- Percolation
- 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
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs
- The large deviation principle for the Erdős-Rényi random graph
- The shortest distance in random multi-type intersection graphs
- The vertex degree distribution of random intersection graphs
- When are small subgraphs of a random graph normally distributed?
Cited in
(5)- Limit laws for the number of triangles in the generalized random graphs with random node weights
- Isoperimetric numbers of randomly perturbed intersection graphs
- On the triangle space of a random graph
- Triangles in randomly perturbed graphs
- Clique and cycle frequencies in a sparse random graph model with overlapping communities
This page was built for publication: The number of triangles in random intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084115)
