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

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 2,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

  • Barber MJ (2007) Modularity and community detection in bipartite networks. Physical Review E. 76(6):066102

    Article  MathSciNet  Google Scholar 

  • Batagelj V, Mrvar A (1998) Pajek. Program for large network analysis. http://vlado.fmf.uni-lj.si/pub/networks/pajek. Accessed 24 Aug 2016

  • Batagelj V, Doreian P, Ferligoj A, Kejzar N (2014) Understanding large temporal networks and spatial networks: Exploration, pattern searching, visualization and network evolution. John Wiley & Sons

    Google Scholar 

  • Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008

    Article  Google Scholar 

  • Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2:113–120

    Article  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  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

    Article  MATH  Google Scholar 

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

    Article  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

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Connections (1977) Membership Directory, vol 1, pp. 3–20, http://www.insna.org/pubs/connections/v1.html. Accessed 24 Aug 2016

  • Dhillon IS. (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 269–274

    Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Everett MG, Borgatti SP (1998) Analyzing clique overlap. Connections, 21(1): 49–61

    Google Scholar 

  • Freeman LC (1979) Centrality in social networks: Conceptual clarification. Social Networks 1: 215–239

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Jünger M, Mutzel P (eds) (2012) Graph drawing software. Springer, Berlin

    MATH  Google Scholar 

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

    MATH  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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Melamed D, Breiger RL, West AJ (2013) Community structure in multi-mode networks: applying an eigenspectrum approach. Connections 33(1):18–23

    Google Scholar 

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

  • 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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Tamassia R (ed) (2013) Handbook of graph drawing and visualization. CRC press, Boca Raton

    MATH  Google Scholar 

  • White DR, Reitz KP (1983) Graph and semi-group homomorphisms on networks of relations. Social Networks 6:193–235

    Article  MathSciNet  Google Scholar 

  • White DR 1984, REGE: A regular graph equivalence algorithm for computing role distances prior to block modelling, Unpublished manuscript. University of California, Irvine

    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

Corresponding author

Correspondence to Martin G. Everett .

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

Section Editor information

  1. Yahoo Inc, London, UK

    Fabrizio Silvestri

  2. University of Calabria, Via Pietro Bucci, 42C, 87036, Arcavacata di Rende, Italy

    Andrea Tagarelli

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Everett, M.G. (2018). 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-4939-7131-2_26

Download citation

Publish with us

Policies and ethics

Search

Navigation