EVOLUTION-MANAGER
Edit File: triad_census.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Triad census, subgraphs with three vertices</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for triad_census {igraph}"><tr><td>triad_census {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Triad census, subgraphs with three vertices</h2> <h3>Description</h3> <p>This function counts the different subgraphs of three vertices in a graph. </p> <h3>Usage</h3> <pre> triad_census(graph) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph, it should be directed. An undirected graph results a warning, and undefined results.</p> </td></tr> </table> <h3>Details</h3> <p>Triad census was defined by David and Leinhardt (see References below). Every triple of vertices (A, B, C) are classified into the 16 possible states: </p> <dl> <dt>003</dt><dd><p>A,B,C, the empty graph.</p> </dd> <dt>012</dt><dd><p>A->B, C, the graph with a single directed edge.</p> </dd> <dt>102</dt><dd><p>A<->B, C, the graph with a mutual connection between two vertices.</p> </dd> <dt>021D</dt><dd><p>A<-B->C, the out-star.</p> </dd> <dt>021U</dt><dd><p>A->B<-C, the in-star.</p> </dd> <dt>021C</dt><dd><p>A->B->C, directed line.</p> </dd> <dt>111D</dt><dd><p>A<->B<-C.</p> </dd> <dt>111U</dt><dd><p>A<->B->C.</p> </dd> <dt>030T</dt><dd><p>A->B<-C, A->C.</p> </dd> <dt>030C</dt><dd><p>A<-B<-C, A->C.</p> </dd> <dt>201</dt><dd><p>A<->B<->C.</p> </dd> <dt>120D</dt><dd><p>A<-B->C, A<->C.</p> </dd> <dt>120U</dt><dd><p>A->B<-C, A<->C.</p> </dd> <dt>120C</dt><dd><p>A->B->C, A<->C.</p> </dd> <dt>210</dt><dd><p>A->B<->C, A<->C.</p> </dd> <dt>300</dt><dd><p>A<->B<->C, A<->C, the complete graph.</p> </dd> </dl> <p>This functions uses the RANDESU motif finder algorithm to find and count the subgraphs, see <code><a href="motifs.html">motifs</a></code>. </p> <h3>Value</h3> <p>A numeric vector, the subgraph counts, in the order given in the above description. </p> <h3>Author(s)</h3> <p>Gabor Csardi <a href="mailto:csardi.gabor@gmail.com">csardi.gabor@gmail.com</a> </p> <h3>References</h3> <p>See also Davis, J.A. and Leinhardt, S. (1972). The Structure of Positive Interpersonal Relations in Small Groups. In J. Berger (Ed.), Sociological Theories in Progress, Volume 2, 218-251. Boston: Houghton Mifflin. </p> <h3>See Also</h3> <p><code><a href="dyad_census.html">dyad_census</a></code> for classifying binary relationships, <code><a href="motifs.html">motifs</a></code> for the underlying implementation. </p> <h3>Examples</h3> <pre> g <- sample_gnm(15, 45, directed = TRUE) triad_census(g) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>