Skip to main content
SpringerLink
Log in

Classical Algorithms for Social Network Analysis: Future and Current Trends

  • Reference work entry
  • First Online:
Encyclopedia of Social Network Analysis and Mining

Synonyms

Cohesive subgroup, community detection; Geodesic: shortest path; Geodesic distance: graph theoretic distance; Node: vertex

Glossary

Walk:

A sequence of adjacent vertices in which edges and vertices can be repeated

Path:

A walk with no repeated vertices

Geodesic:

A shortest path between two vertices

Geodesic Distance:

The length of the shortest path between two vertices

Principal Eigenvector:

The eigenvector associated with the largest eigenvalue of the adjacency matrix

Subgraph:

A subset of vertices and edges from a graph

Component:

Maximal subgraph with a path between every pair of vertices

Proximity Matrix:

A symmetric valued matrix

Neighborhood:

Set of vertices adjacent to a given vertex

Scalable:

An algorithm that increases in run time at a rate proportional to the size of the problem

Definition

Social network analysis has always been an interdisciplinary field. The early pioneers brought together sociologists, anthropologists, psychologists, mathematicians, statisticians,...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,500.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Batagelj V, Mrvar A (1998) Pajek. Program for large network analysis. Available at: http://vlado.fmf.uni-lj.si/pub/networks/pajek. Last Accessed 6 Mar 2013

  • Borgatti SP (2002) Netdraw network visualization. Analytic Technologies, Harvard

    Google Scholar 

  • Borgatti SP (2006) Identifying sets of key players in a network. Comput Math Organ Theory 12(1):21–34

    MATH  Google Scholar 

  • Borgatti SP, Everett MG (1989) The class of all regular equivalences: algebraic structure and computation. Soc Netw 11:65–88

    MathSciNet  Google Scholar 

  • Borgatti SP, Everett MG (1993) Two algorithms for computing regular equivalence. Soc Netw 15:361–376

    MathSciNet  Google Scholar 

  • Borgatti SP, Everett MG (2006) A graph theoretic perspective on centrality. Soc Netw 28:466–484

    Google Scholar 

  • Borgatti SP, Everett MG, Johnson JC (2013) Analyzing social networks. SAGE, London

    Google Scholar 

  • Brandes U (2001) A faster algorithm for betweenness centrality. J Math Soc 25:163–177

    MATH  Google Scholar 

  • Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30:136–145

    Google Scholar 

  • Brandes U, Wagner D (2004) Visone – analysis and visualization of social networks. In: Junger M, Mutzel P (eds) Graph drawing software. Springer, New York, pp 321–340

    Google Scholar 

  • Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16:575–577

    MATH  Google Scholar 

  • Connections (1977) “Membership Directory”, vol 1, pp. 3–20, http://www.insna.org/pubs/connections/v1.html. Accessed 29 Oct 2012

  • Doreian P, Batagelj V, Ferligoj A (2005) Generalized blockmodelling. Cambridge University Press, New York

    Google Scholar 

  • Everett MG, Borgatti SP (1991) Role colouring a graph. Math Soc Sci 21:183–188

    MATH  MathSciNet  Google Scholar 

  • Everett MG, Borgatti SP (1995) Regular equivalence: general theory. Math Sociol 19:29–52

    MathSciNet  Google Scholar 

  • Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99:7821–7826

    MATH  MathSciNet  Google Scholar 

  • Holland P, Leinhardt J (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76:33–65

    MATH  MathSciNet  Google Scholar 

  • Katz L (1953) A new status index derived from sociometric data analysis. Psychometrika 18:34–43

    Google Scholar 

  • Krackhardt D (1994) Graph theoretical dimensions of informal organizations. In: Carley K, Prietula M (eds) Computational organizational theory. Lawrence Erlbaum Associates, Hillsdale, pp 89–111

    Google Scholar 

  • Leicht EA, Holme P, Newman MEJ (2006) Vertex similarity in networks. Phys Rev E 73:02612–02622

    Google Scholar 

  • Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14:95–116

    MathSciNet  Google Scholar 

  • Luczkovich JJ, Borgatti SP, Johnson JC, Everett MG (2003) Defining and measuring trophic role similarity in food webs using regular coloration. J Theor Biol 220(3):303–321

    MathSciNet  Google Scholar 

  • Nicosia V, Criado R, Romance M, Russo G, Latora V (2012) Controlling centrality in complex networks. Sci Rep. doi:10.1038/srep00218

    Google Scholar 

  • Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818

    Google Scholar 

  • Seidman S (1983) Network structure and minimum degree. Soc Netw 5:269–287

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mitchell Centre for Social Network Analysis, School of Social Science, University of Manchester, Manchester, UK

    Martin G. Everett

Authors
  1. Martin G. Everett
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Reda Alhajj

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Jon Rokne

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Everett, M.G. (2014). Classical Algorithms for Social Network Analysis: Future and Current Trends. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6170-8_26

Download citation

Publish with us

Policies and ethics

Search

Navigation