Growth models for networks

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Article Outline: Glossary Definition of the Subject Introduction Equilibrium and Nonequilibrium Random Networks Random Recursive Graphs (Trees) Recursive Trees Versus Equilibrium Connected Trees The Barabási-Albert Model General Preferential Attachment Finite Size Effects Hidden Variables Condensation of Edges Weighted Growing Networks Connected Components in Growing Networks Significance of Loops Accelerated Growth of Networks Critique of the Preferential Attachment Mechanism Optimization-Based Models Deterministic Graphs Future Directions Acknowledgments Bibliography

Cite

CITATION STYLE

APA

Dorogovtsev, S. N. (2012). Growth models for networks. In Computational Complexity: Theory, Techniques, and Applications (Vol. 9781461418009, pp. 1488–1498). Springer New York. https://doi.org/10.1007/978-1-4614-1800-9_95

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free