Degree and clustering coefficient in sparse random intersection graphs
From MaRDI portal
Publication:1950269
DOI10.1214/12-AAP874zbMath1273.05197arXiv1303.3388MaRDI QIDQ1950269
Publication date: 10 May 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.3388
power lawclustering coefficientasymptotic vertex degree distributionrandom intersection graph models
Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)
Related Items
The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs ⋮ Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities ⋮ Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions ⋮ Clustering Coefficient of a Preferred Attachment Affiliation Network ⋮ A note on the vertex degree distribution of random intersection graphs ⋮ Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Scale-free network clustering in hyperbolic and other random graphs ⋮ Central limit theorem for the largest component of random intersection graph ⋮ Constructions of independent sets in random intersection graphs ⋮ Random Intersection Graph Process ⋮ Degree distribution of an inhomogeneous random intersection graph ⋮ \(k\)-connectivity of uniform \(s\)-intersection graphs ⋮ Phase transition in random intersection graphs with communities ⋮ Clustering and percolation on superpositions of Bernoulli random graphs ⋮ The number of triangles in random intersection graphs ⋮ Estimating the clustering coefficient using sample complexity analysis ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ Large cliques in sparse random intersection graphs ⋮ The coupling method for inhomogeneous random intersection graphs. ⋮ Clustering and the Hyperbolic Geometry of Complex Networks ⋮ Local probabilities of randomly stopped sums of power-law lattice random variables ⋮ Random intersection graphs with communities ⋮ On local weak limit and subgraph counts for sparse random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the independence number and Hamiltonicity of uniform random intersection graphs
- A random intersection digraph: indegree and outdegree distributions
- Degree distribution of a typical vertex in a general random intersection graph
- The largest component in an inhomogeneous random intersection graph with clustering
- Connectivity of the uniform random intersection graph
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Bipartite structure of all complex networks
- The degree of a typical vertex in generalized random intersection graph models
- Modeling Social Networks through User Background and Behavior
- An Introduction to Heavy-Tailed and Subexponential Distributions
- The shortest distance in random multi-type intersection graphs
- Clustering Coefficients of Random Intersection Graphs
- The Degree Distribution in Random Intersection Graphs
- Two Models of Random Intersection Graphs and their Applications
- The Vertex Degree Distribution of Passive Random Intersection Graph Models
- Epidemics on Random Graphs with Tunable Clustering
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- On Random Intersection Graphs: The Subgraph Problem
- Le Cam's Inequality and Poisson Approximations
- Random graph models of social networks
- The vertex degree distribution of random intersection graphs
- Collective dynamics of ‘small-world’ networks
