An Efficient Counting Method for the Colored Triad Census

The triad census is an important approach to understand local structure in network science, providing comprehensive assessments of the observed relational configurations between triples of actors in a network. However, researchers are often interested in combinations of relational and categorical nodal attributes. In this case, it is desirable to account for the label, or color, of the nodes in the triad census. In this paper, we describe an efficient algorithm for constructing the colored triad census, based, in part, on existing methods for the classic triad census. We evaluate the performance of the algorithm using empirical and simulated data for both undirected and directed graphs. The results of the simulation demonstrate that the proposed algorithm reduces computational time by approximately 17,400% over the na{\"i}ve approach. We also apply the colored triad census to the Zachary karate club network dataset. We simultaneously show the efficiency of the algorithm, and a way to conduct a statistical test on the census by forming a null distribution from 1,000 realizations of a mixing-matrix conditioned graph and comparing the observed colored triad counts to the expected. From this, we demonstrate the method's utility in our discussion of results about homophily, heterophily, and bridging, simultaneously gained via the colored triad census. In sum, the proposed algorithm for the colored triad census brings novel utility to social network analysis in an efficient package.

[1]  Peter V. Marsden,et al.  Interviewer effects in measuring network size using a single name generator , 2003, Soc. Networks.

[2]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[3]  S. Goodreau,et al.  Birds of a feather, or friend of a friend? using exponential random graph models to investigate adolescent social networks* , 2009, Demography.

[4]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[5]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  L. Koehly,et al.  Inter-generational contact from a network perspective. , 2015, Advances in life course research.

[7]  P. Holland,et al.  Local Structure in Social Networks , 1976 .

[8]  Vladimir Batagelj,et al.  A subquadratic triad census algorithm for large sparse networks with small maximum degree , 2001, Soc. Networks.

[9]  T. Snijders.  Stochastic actor-oriented models for network change , 1996 .

[10]  Roger V. Gould,et al.  Structures of Mediation: A Formal Approach to Brokerage in Transaction Networks , 1989 .

[11]  Raphael Yuster,et al.  Fast sparse matrix multiplication , 2004, TALG.

[12]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[13]  James Moody,et al.  Matrix methods for calculating the triad census , 1998 .

[14]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[15]  Carter T. Butts,et al.  Extended structures of mediation: Re-examining brokerage in dynamic networks , 2013, Soc. Networks.

[16]  A. Davie,et al.  Improved bound for complexity of matrix multiplication , 2013, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[17]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[18]  Athina Markopoulou,et al.  ergm.graphlets: A Package for ERG Modeling Based on Graphlet Statistics , 2014, ArXiv.

[19]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[20]  Katherine Faust,et al.  A puzzle concerning triads in social networks: Graph constraints and the triad census , 2010, Soc. Networks.

[21]  Cosma Rohilla Shalizi,et al.  Homophily and Contagion Are Generically Confounded in Observational Social Network Studies , 2010, Sociological methods & research.

[22]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .