Small-world properties of facebook group networks

Complex Systems

Volumn 23, Issue 3, 2014, Pages 197-225

  Wohlgemuth, Jason ^a   Matache, Mihaela Teodora ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COARSENING; SMALL-WORLD NETWORKS; SOCIAL NETWORKING (ONLINE);

AVERAGE PATH LENGTH; CLUSTERING COEFFICIENT; DEGREE DISTRIBUTIONS; GROUP NETWORKS; NETWORK AGGREGATION; NUMERICAL CHARACTERISTICS; RANDOM NETWORK; SINGLE NETWORKS;

GRAPH THEORY;

EID: 84921261862     PISSN: 08912513     EISSN: None     Source Type: Journal    
DOI: 10.25088/complexsystems.23.3.197     Document Type: Article

References (26)

1. R. Albert, H. Jeong, and A.-L. Barabási, “Internet: Diameter of the World-Wide Web,” Nature, 401, 1999 pp. 130–131. doi:10.1038/43601.
2. T. Helikar, J. Konvalina, J. Heidel, and J. A. Rogers, “Emergent Decision-Making in Biological Signal Transduction Networks,” Proceedings of the National Academy of Sciences, 105(6), 2008 pp. 1913–1918. doi:10.1073/pnas.0705088105.
3. V. Latora and M. Marchiori, “Is the Boston Subway a Small-World Network?,” Physica A: Statistical Mechanics and Its Applications, 314(1–4), 2002 pp. 109–113. doi:10.1016/S0378-4371(02)01089-0.
4. P. Sen, S. Dasgupta, A. Chatterjee, P. A. Sreeram, G. Mukherjee, and S. S. Manna, “Small-World Properties of the Indian Railway Network,” Physical Review E, 67(3), 2003 p. 036106. doi:10.1103/PhysRevE.67.036106.
5. J. Ugander, B. Karrer, L. Backstrom, and C. Marlow, “The Anatomy of the Facebook Social Graph.” arxiv.org/abs/1111.4503.
6. L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna, “Four Degrees of Separation.” arxiv.org/abs/1111.4570.
7. S. Milgram, “The Small World Problem,” Psychology Today, 2, 1967 pp. 60–67.
8. J. Travers and S. Milgram, “An Experimental Study of the Small World Problem,” Sociometry, 32(4), 1969 pp. 425–443.
9. D. J. Watts and S. H. Strogatz, “Collective Dynamics of ‘Small-World’ Networks,” Nature, 393, 1998 pp. 440–442. doi:10.1038/30918.
10. P. Erdős and A. Rényi, "On Random Graphs," Publicationes Mathematicae Debrecen, 6, 1959 pp. 290-297.
11. R. Serra, M. Villani, and L. Agostini, “A Small-World Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics of Boolean Interacting Automata,” Complex Systems, 15(2), 2004 pp. 137–155. http://www.complex-systems.com/pdf/15-2-3.pdf.
12. C. Aguirre, F. Corbacho, and R. Huerta, “Static and Dynamic Properties of Small-World Connection Topologies Based on Transit-Stub Networks,” Complex Systems, 14(1), 2003 pp. 1–28. http://www.complex-systems.com/pdf/14-1-1.pdf.
13. R. Albert and A.-L. Barabási, “Statistical Mechanics of Complex Networks,” Reviews of Modern Physics, 74(1), 2002 pp. 47–97. doi:10.1103/RevModPhys.74.47.
14. D. J. Watts, Six Degrees: The Science of a Connected Age, New York: W. W. Norton & Company, 2003.
15. A.-L. Barabási, Bursts: The Hidden Pattern behind Everything We Do, New York: Dutton, 2010.
16. A.-L. Barabási, Linked: How Everything Is Connected to Everything Else and What It Means, New York: Plume, 2003.
17. L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, “Classes of Small-World Networks,” Proceedings of the National Academy of Sciences, 97(21), 2000 pp. 11149–11152. doi:10.1073/pnas.200327197.
18. H. De Sterck, V. E. Henson, and G. Sanders, “Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking,” Computing and Informatics, 30(2), 2011 pp. 225–246.
19. M. E. J. Newman, “The Mathematics of Networks,” in The New Pal-grave Dictionary of Economics, 2nd ed. (L. E. Blume and S. N. Durlauf, eds.), Basingstoke, UK: Palgrave Macmillan, 2008 pp. 1–12.
20. R. Cont and E. Tanimura, “Small-World Graphs: Characterization and Alternative Constructions,” Advances in Applied Probability, 40, 2008 pp. 939–965. doi:10.1239/aap/1231340159.
21. D. J. Watts, “Networks, Dynamics, and the Small-World Phenomenon,” The American Journal of Sociology, 105(2), 1999 pp. 493–527.
22. M. E. J. Newman, Networks: An Introduction, New York: Oxford University Press, 2010.
23. P. Adams, Grouped, Berkeley: New Riders, 2012.
24. L. A. Adamic, T. M. Lento, E. Adar, and P. C. Ng, “Information Evolution in Social Networks.” arxiv.org/abs/1402.6792.
25. T. M. J. Fruchterman and E. M. Reingold, “Graph Drawing by Force-Directed Placement,” Software—Practice and Experience, 21, 1991 pp.1129–1164.
26. MATLAB, Release Version 7.10.0 (R2010a), Natick, MA: The MathWorks Inc., 2010.