Random Intersection Graph Process
From MaRDI portal
Publication:2938018
DOI10.1007/978-3-319-03536-9_8zbMath1342.05133arXiv1301.5579OpenAlexW3032646757MaRDI QIDQ2938018
Michał Karoński, Mindaugas Bloznelis
Publication date: 13 January 2015
Published in: Lecture Notes in Computer Science, Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5579
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)
Related Items (3)
Clustering Coefficient of a Preferred Attachment Affiliation Network ⋮ Random Intersection Graph Process ⋮ Preferred attachment in affiliation networks
Cites Work
- Assortativity and clustering of sparse random intersection graphs
- Degree distribution of an inhomogeneous random intersection graph
- Preferred attachment in affiliation networks
- Degree and clustering coefficient in sparse random intersection graphs
- Bipartite structure of all complex networks
- The degree of a typical vertex in generalized random intersection graph models
- Random Intersection Graph Process
- An Introduction to Heavy-Tailed and Subexponential Distributions
- Clustering Coefficients of Random Intersection Graphs
- Two Models of Random Intersection Graphs and their Applications
- 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
- Clustering function: another view on clustering coefficient
- The vertex degree distribution of random intersection graphs
- Collective dynamics of ‘small-world’ networks
- A Spatial Web Graph Model with Local Influence Regions
This page was built for publication: Random Intersection Graph Process
