Abstract
This article is to introduce the social scientist concerned with social network analysis∈dexSocial Network Analysis and an affinity to quantitative methods to parts of the research done by physicists in the field of complex networks∈dexcomplex networks. In fact, much of the research done by physicists has been inspired by examples and problems from sociology. We believe that the methods developed by natural scientists will prove to be valuable tools that allow new insights into data arising in the social sciences. We hope that these methods find their way back into social sciences and find ample application on the problems by which they were originally inspired.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Albert and A.-L. Barabà si. Statistical mechanics of complex networks. Rev. Mod. Phys., 74:47–97, 2002.
P. Arabie and L. J. Hubert. Combinatorial data analysis. Ann. Rev. Psychol., 43:169–203, 1992.
A.-L. Barabá si and R. Albert. Emergence of scaling in random networks. Science, 286:509–512, 1999.
E. A. Bender and E. R. Canfield. The asymptotic number of labeled graphs with given degree distribution. J. Comb. Theory (A), 24:296, 1978.
B. Bollobas. Random Graphs. Cambridge University Press, New York, 2nd. edition, 2001.
S. Bornholdt and H. G. Schuster, editors. Handbook of Graphs and Networks. Wiley-Vch, Weinheim, 2003.
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E., 70:066111, 2004.
R. Cohen, K. Erez, and S. Havlin. Resilience of the internet to random breakdowns. Phys. Rev. Lett., 85:4626–4628, 2000.
P. Doreian, V. Batagelj, and A. Ferligoj. Generalized Blockmodeling. Cambridge University Press, New York, 2005.
S. N. Dorogovtsev and J. F. F. Mendes. The shortest path to complex networks. In N. Johnson, J. Efstathiou, and F. Reed-Tsochas, editors, Complex Systems and Inter-Disciplinary Science. World Scientific, 2005.
P. Erdü s and A. Ré nyi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5:17–61, 1960.
Y. Fu and P. W. Anderson. Application of statistical mechanics to NP-complete problems in combinatorial optimisation. J. Phys. A: Math. Gen., 19:1605–1620, 1986.
D. Gfeller, J.-C. Chappelier, and P. de los Rios. Finding instabilities in the community structure of complex networks. Phys. Rev. E., 72:056135, 2005.
M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA, 99(12):7821–7826, 2002.
R. Guimera, M. Sales-Pardo, and L. N. Amaral. Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E., 70:025101(R), 2004.
I. Kanter and H. Sompolinsky. Graph optimisation problems and the Potts glass. J. Phys. A: Math. Gen., 20:L636–679, 1987.
F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and X. Aberg. The web of human sexual contacts. Nature, 411:907–908, 2001.
S. Maslov and K. Sneppen. Specificity and stability in topology of protein networks. Science, 296:910–913, 2002.
S. Milgram. The small world problem. Psychol. Today, 2:60–67, 1967.
M. Molloy and B. Reed. A critical point for random graphs with given degree sequence. Random Struct. Algor., 6:161–179, 1995.
M. E. J. Newman. Assortative mixing in networks. Phys. Rev. Lett., 89:208701, 2002.
M. E. J. Newman. Mixing patterns in networks. Phys. Rev. E., 67:026126, 2003.
M. E. J. Newman. The structure and function of complex networks. SIAM Rev., 45(2):167–256, 2003.
M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E., 69:066133, 2004.
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69:026113, 2004.
G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814, 2005.
R. Pastor-Satorras and A. Vespignani. Epidemic spreading in scale-free networks. Phys. Rev. Lett., 86:3200–3203, 2001.
R. Pastor-Satorras and A. Vespignani. Immunization of complex networks. Phys. Rev. E., page 036104, 2002.
J. Reichardt and S. Bornholdt. Detecting fuzzy community structures in complex networks with a Potts model. Phys. Rev. Lett., 93:218701, 2004.
J. Reichardt and S. Bornholdt. Graph partitioning and modularity of graphs with arbitrary degree distribution. Phys. Rev. E, 76:015102(R), 2007.
J. Reichardt and M. Leone. (Un)detectable cluster structure in sparse networks. Phys. Rev. Lett., 101:078701, 2008.
J. Reichardt and D. R. White. Role models for complex networks. Eur. Phys. J. B, 60:217–224, 2007.
S Warner. E-prints and the open archives initiative. Library Hi Tech, 21:151–158, 2003.
S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, New York, 1994.
D. J. Watts and S. H. Strogatz. Collective dynamics in small world networks. Nature, 393:440–442, 1998.
W. Zachary. An information flow model for conflict and fission in small groups. J. Anthr. Res., 33:452–473, 1977.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Reichardt, J., Bornholdt, S. (2009). Tools from Statistical Physics for the Analysis of Social Networks. In: Pyka, A., Scharnhorst, A. (eds) Innovation Networks. Understanding Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92267-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-92267-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92266-7
Online ISBN: 978-3-540-92267-4
eBook Packages: Business and EconomicsEconomics and Finance (R0)