Small subgraphs in preferential attachment networks
From MaRDI portal
Publication:526405
DOI10.1007/S11590-015-0945-9zbMATH Open1369.90029OpenAlexW1643268875MaRDI QIDQ526405FDOQ526405
Authors: Andrei M. Raigorodskii 
Publication date: 12 May 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0945-9
Recommendations
Cites Work
- Statistical mechanics of complex networks
- Directed scale-free graphs
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Collective dynamics of `small-world' networks
- The degree sequence of a scale-free random graph process
- A preferential attachment model with random initial degrees
- An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model
- Popularity based random graph models leading to a scale-free degree sequence
- On the number of subgraphs of the Barabási-Albert random graph
- Global Clustering Coefficient in Scale-Free Networks
- Robustness and Vulnerability of Scale-Free Random Graphs
- Degree distribution and number of edges between nodes of given degrees in the Buckley-Osthus model of a random web graph
- Distribution of small subgraphs in Buckley-Osthus random graphs
- The clustering coefficient of a scale-free random graph
Cited In (5)
- Subgraphs in preferential attachment models
- Clustering coefficient of a spatial preferential attachment model
- On the independence number and the chromatic number of generalized preferential attachment models
- Random graphs and their subgraphs
- Distribution of small subgraphs in Buckley-Osthus random graphs
This page was built for publication: Small subgraphs in preferential attachment networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526405)
