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
We define classical algorithms as the computational techniques developed by the early pioneers of social network analysis. These were often one-off programs or collections of...
References
Barber MJ (2007) Modularity and community detection in bipartite networks. Physical Review E. 76(6):066102
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
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008
Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2:113–120
Borgatti SP (2002) Netdraw network visualization. Analytic Technologies, Harvard
Borgatti SP (2006) Identifying sets of key players in a network. Comput Math Organ Theory 12(1):21–34
Borgatti SP, Everett MG (1989) The class of all regular equivalences: algebraic structure and computation. Soc Netw 11:65–88
Borgatti SP, Everett MG (1993) Two algorithms for computing regular equivalence. Soc Netw 15:361–376
Borgatti SP, Everett MG (2006) A graph theoretic perspective on centrality. Soc Netw 28:466–484
Borgatti SP, Everett MG, Johnson JC (2013) Analyzing social networks. SAGE, London
Brandes U (2001) A faster algorithm for betweenness centrality. J Math Soc 25:163–177
Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30:136–145
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
Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16:575–577
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
Doreian P, Batagelj V, Ferligoj A (2005) Generalized blockmodelling. Cambridge University Press, New York
Everett MG, Borgatti SP (1991) Role colouring a graph. Math Soc Sci 21:183–188
Everett MG, Borgatti SP (1995) Regular equivalence: general theory. Math Sociol 19:29–52
Everett MG, Borgatti SP (1998) Analyzing clique overlap. Connections, 21(1): 49–61
Freeman LC (1979) Centrality in social networks: Conceptual clarification. Social Networks 1: 215–239
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99:7821–7826
Holland P, Leinhardt J (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76:33–65
Jünger M, Mutzel P (eds) (2012) Graph drawing software. Springer, Berlin
Katz L (1953) A new status index derived from sociometric data analysis. Psychometrika 18:34–43
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
Leicht EA, Holme P, Newman MEJ (2006) Vertex similarity in networks. Phys Rev E 73:02612–02622
Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14:95–116
Melamed D, Breiger RL, West AJ (2013) Community structure in multi-mode networks: applying an eigenspectrum approach. Connections 33(1):18–23
Nicosia V, Criado R, Romance M, Russo G, Latora V (2012) Controlling centrality in complex networks. Sci Rep. doi: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
Seidman S (1983) Network structure and minimum degree. Soc Netw 5:269–287
Tamassia R (ed) (2013) Handbook of graph drawing and visualization. CRC press, Boca Raton
White DR, Reitz KP (1983) Graph and semi-group homomorphisms on networks of relations. Social Networks 6:193–235
White DR 1984, REGE: A regular graph equivalence algorithm for computing role distances prior to block modelling, Unpublished manuscript. University of California, Irvine
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media LLC
About this entry
Cite this entry
Everett, M.G. (2017). 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-7163-9_26-1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7163-9_26-1
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7163-9
Online ISBN: 978-1-4614-7163-9
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering