Skip to main content
×
Home
    • Aa
    • Aa

Triadic analysis of affiliation networks

  • JASON CORY BRUNSON (a1)
Abstract
Abstract

Triadic closure has been conceptualized and measured in a variety of ways, most famously the clustering coefficient. Existing extensions to affiliation networks, however, are sensitive to repeat group attendance, which does not reflect common interpersonal interpretations of triadic closure. This paper proposes a measure of triadic closure in affiliation networks designed to control for this factor, which manifests in bipartite models as biclique proliferation. To avoid arbitrariness, the paper introduces a triadic framework for affiliation networks, within which a range of measures can be defined; it then presents a set of basic axioms that suffice to narrow this range to the one measure. An instrumental assessment compares the proposed and two existing measures for reliability, validity, redundancy, and practicality. All three measures then take part in an investigation of three empirical social networks, which illustrates their differences.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

D. G. Altman , & J. M. Bland (1983). Measurement in medicine: The analysis of method comparison studies. The Statistician, 32 (3), 307317.

S. P. Borgatti , & M. G. Everett (1997). Network analysis of 2-mode data. Social networks, 19, 243269.

R. L. Breiger (1974). The duality of persons and groups. Social Forces, 53 (2), 181190.

Y. Chen , P. Diaconis , S. P. Holmes , & J. S. Liu (2005). Sequential Monte Carlo methods for statistical analysis of tables. Journal of the American Statistical Association, 100 (469), 109120.

C. H. Comin , F. N. Silva , & L. da F. Costa (2015). A framework for evaluating complex networks measurements. EPL (Europhysics letters), 110 (6), 68002.

D. Easley , & J. Kleinberg (2010). Networks, crowds, and markets: Reasoning about a highly connected world. New York, USA: Cambridge University Press.

K. Faust (1997). Centrality in affiliation networks. Social Networks, 19 (2), 157191.

L. C. Freeman (1992). The sociological concept of “group”: An empirical test of two models. The American Journal of Sociology, 98 (1), 152166.

J. Galaskiewicz (1985). Social organization of an urban grants economy: A study of business philanthropy and non-profit organizations. Orlando, FL: Academic Press.

M. S. Granovetter (1973). The strength of weak ties. The American Journal of Sociology, 78 (6), 13601380.

F. Harary , & H. J. Kommel (1979). Matrix measures for transitivity and balance. Journal of Mathematical Sociology, 6 (2), 199210.

P. W. Holland , & S. Leinhardt (1971). Transitivity in structural models of small groups. Small Group Research, 2 (2), 107124.

C. Lee , & P. Cunningham (2014). Community detection: Effective evaluation on large social networks. Journal of Complex Networks, 2 (1), 1937.

P. G. Lind , M. C. González , & H. J. Herrmann (2005). Cycles and clustering in bipartite networks. Physical Review E, 72 (Nov), 056127.

T. Martin , B. Ball , B. Karrer , & M. E. J. Newman (2013). Coauthorship and citation patterns in the physical review. Physical Review E, 88 (Jul), 012814.

B. Mitchell (1965). Theory of categories. Pure and Applied Mathematics, vol. 17. New York and London: Academic Press.

M. E. J. Newman (2003). The structure and function of complex networks. SIAM Review, 45 (2), 167256 (electronic).

M. E. J. Newman , S. H. Strogatz , & D. J. Watts (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64 (Jul), 026118.

T. Opsahl (2013). Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Social Networks, 35 (2), 159167. Special Issue on Advances in Two-mode Social Networks.

J. Saramäki , M. Kivelä , J.-P. Onnela , K. Kaski , & J. Kertész (2007). Generalizations of the clustering coefficient to weighted complex networks. Physical Review E, 75 (Feb), 027105.

G. Szabó , M. Alava , & J. Kertész (2003). Structural transitions in scale-free networks. Physical Review E, 67 (5), 056102.

S. Wasserman , & K. Faust (1994). Social network analysis: Methods and applications. vol. 8. Cambridge: Cambridge university press.

D. J. Watts , & S. H. Strogatz (1998). Collective dynamics of “small-world” networks. Nature, 393 (6684), 440442.

H. Wickham (2009). ggplot2: elegant graphics for data analysis. New York: Springer.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Network Science
  • ISSN: 2050-1242
  • EISSN: 2050-1250
  • URL: /core/journals/network-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Type Description Title
PDF
Supplementary Materials

Brunson supplementary material S1
Brunson supplementary material

 PDF (218 KB)
218 KB

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 46 *
Loading metrics...

Abstract views

Total abstract views: 387 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 28th June 2017. This data will be updated every 24 hours.