Two models of sparse and clustered dynamic networks
From MaRDI portal
Cites work
- A guided tour in random intersection graphs
- A spatial web graph model with local influence regions
- Bipartite structure of all complex networks
- Bistability through triadic closure
- Clique and cycle frequencies in a sparse random graph model with overlapping communities
- Clustering and percolation on superpositions of Bernoulli random graphs
- Clustering function: another view on clustering coefficient
- Clustering in a hyperbolic model of complex networks
- Data science, learning by latent structures, and knowledge discovery.
- Degree and clustering coefficient in sparse random intersection graphs
- Degree distribution of an inhomogeneous random intersection graph
- Degree distributions in general random intersection graphs
- Dynamic random intersection graph: dynamic local convergence and giant structure
- Geometric inhomogeneous random graphs
- Le Cam's Inequality and Poisson Approximations
- Local clustering coefficient of spatial preferential attachment model
- Modeling social networks through user background and behavior
- Networks
- On local weak limit and subgraph counts for sparse random graphs
- Preferred attachment in affiliation networks
- Random Graphs and Complex Networks
- Random Intersection Graph Process
- Random intersection graphs with communities
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Sparse random graphs with clustering
- The average distances in random graphs with given expected degrees
This page was built for publication: Two models of sparse and clustered dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920915)
