Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Complexity and Systems Science pp 8279–8291Cite as

Social Network Analysis, Two-Mode Concepts in

  • Reference work entry

Definition of the Subject

Figure 1
figure 1_491

DGG women‐by‐events matrix

Full size image

This is a preview of subscription content, 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   3,499.99
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

Learn about institutional subscriptions

Notes

  1. 1.

    For directed graphs, we require \( { C(N^{o}(u)) = C(N^{o}(v)) } \) and \( { C(N^{i}(u)) = C(N^{i}(v)) } \), where \( { N^{o}(v) } \) refers to the set of nodes that v sends a tie to, and \( { N^{i}(u) } \) refers to the set of nodes that v receives a tie from.

Abbreviations

2-Mode matrix:

A (2‑dimensional) matrix is said to be 2‑mode if the rows and columns index different sets of entities (e. g., the rows might correspond to persons while the columns correspond to organizations). In contrast, a matrix is 1‑mode if the rows and columns refer to the same set of entities, such as a city‐by‐city matrix of distances.

Blockmodel:

A blockmodel is a partitioning of the cells of a matrix into blocks that is induced by the partitioning the rows and columns into classes and sorting the matrix such that rows (and columns) that belong to the same class are next to each other. More specifically, two matrix cells x i j and x m p are in the same block if \( { \text{class}(i) = \text{class}(m) } \) and \( { \text{class}(j) = \text{class}(p) } \).

Centrality:

A family of concepts for characterizing the structural importance of a node's position in a network.

Graph cohesion:

A family of concepts characterizing the extent of connectedness of a graph, such as density (the proportion of pairs of nodes that have ties with each other), or average path distance.

Multidimensional scaling (MDS):

A method of locating points in space such that Euclidean distances between the points correspond to a matrix of input similarities/distances among objects. Used to provide visual representations of 1‑mode matrices such as correlation matrices or perceptual distances among objects.

Regular equivalence:

The definition of regular equivalence is recursive. If two nodes are regularly equivalent, then they are connected to regularly equivalent nodes. Regular equivalence is used to identify nodes that are playing the same structural role, even if they are not connected to each other.

Social network (or, in graph theory, a graph):

A collection of nodes (also referred to as vertices or actors) together with a set of ties (also known as edges or links) that connect pairs of nodes. Typically used to represent social relations such as who is friends with whom, or who is the supervisor of whom.

Structural equivalence:

At an intuitive level, a pair of nodes is said to be structurally equivalent to the extent that they occupy identical locations in a network, meaning that they are connected to exactly the same others. Structurally equivalent nodes are identical with respect to all structural properties, such as centrality or subgroup membership.

Bibliography

  1. Bonacich P (1972) Techniques for analyzing overlapping memberships. In: CostnerHL (ed) Sociological methodology. Jossey-Bass, San Francisco, pp 176–185

    Google Scholar 

  2. Bonacich P (1991) Simultaneous group and individual centralities. Soc Netw13:155–168

    Google Scholar 

  3. Borgatti SP (1989) Regular equivalence in graphs, hypergraphs, andmatrices. Doctoral Dissertation, Univ of California, Irvine, Ann Arbor

    Google Scholar 

  4. Borgatti SP, Everett M G (1992) Regular blockmodels of multiway, multimodematrices. Soc Netw 14:91–120

    Google Scholar 

  5. Borgatti SP, Everett MG (1997) Network analysis of 2-mode data. Soc Netw19(3):243–269

    MathSciNet  Google Scholar 

  6. Davis A, Gardner B, Gardner M (1941) Deep South: A Social AnthropologicalStudy of Caste and Class. University of Chicago Press, Chicago

    Google Scholar 

  7. Everett MG, Borgatti SP (1993) An extension of regular colouring of graphs todigraphs, networks and hypergraphs. Soc Netw 15:237–254

    MathSciNet  Google Scholar 

  8. Everett MG, Borgatti SP (1994) Regular equivalence: General theory. J MathSociol 19(1):29–52

    MathSciNet  Google Scholar 

  9. Faust K (1997) Centrality in affiliation networks. Soc Netw19:157–191

    Google Scholar 

  10. Kamada T, Kawai S (1989) An algorithm for drawing general undirectedgraphs. Inf Process Lett 31:7–15

    MathSciNet  Google Scholar 

  11. Luce RD, Perry AD (1949) A method of matrix analysis of groupstructure. Psychometrika 20:319–327

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gatton College of Business and Economics, University of Kentucky, Lexington, USA

    Stephen P. Borgatti

Authors
  1. Stephen P. Borgatti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RAMTECH LIMITED, 122 Escalle Lane, Larkspur, CA, 94939, USA

    Robert A. Meyers Ph. D. (Editor-in-Chief) (Editor-in-Chief)

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag

About this entry

Cite this entry

Borgatti, S.P. (2009). Social Network Analysis, Two-Mode Concepts in. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-30440-3_491

Download citation

Publish with us

Policies and ethics

Search

Navigation