EVOLUTION-MANAGER
Edit File: sample_last_cit.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: Random citation graphs</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 sample_last_cit {igraph}"><tr><td>sample_last_cit {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Random citation graphs</h2> <h3>Description</h3> <p><code>sample_last_cit</code> creates a graph, where vertices age, and gain new connections based on how long ago their last citation happened. </p> <h3>Usage</h3> <pre> sample_last_cit( n, edges = 1, agebins = n/7100, pref = (1:(agebins + 1))^-3, directed = TRUE ) last_cit(...) sample_cit_types( n, edges = 1, types = rep(0, n), pref = rep(1, length(types)), directed = TRUE, attr = TRUE ) cit_types(...) sample_cit_cit_types( n, edges = 1, types = rep(0, n), pref = matrix(1, nrow = length(types), ncol = length(types)), directed = TRUE, attr = TRUE ) cit_cit_types(...) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>n</code></td> <td> <p>Number of vertices.</p> </td></tr> <tr valign="top"><td><code>edges</code></td> <td> <p>Number of edges per step.</p> </td></tr> <tr valign="top"><td><code>agebins</code></td> <td> <p>Number of aging bins.</p> </td></tr> <tr valign="top"><td><code>pref</code></td> <td> <p>Vector (<code>sample_last_cit</code> and <code>sample_cit_types</code> or matrix (<code>sample_cit_cit_types</code>) giving the (unnormalized) citation probabilities for the different vertex types.</p> </td></tr> <tr valign="top"><td><code>directed</code></td> <td> <p>Logical scalar, whether to generate directed networks.</p> </td></tr> <tr valign="top"><td><code>...</code></td> <td> <p>Passed to the actual constructor.</p> </td></tr> <tr valign="top"><td><code>types</code></td> <td> <p>Vector of length ‘<code>n</code>’, the types of the vertices. Types are numbered from zero.</p> </td></tr> <tr valign="top"><td><code>attr</code></td> <td> <p>Logical scalar, whether to add the vertex types to the generated graph as a vertex attribute called ‘<code>type</code>’.</p> </td></tr> </table> <h3>Details</h3> <p><code>sample_cit_cit_types</code> is a stochastic block model where the graph is growing. </p> <p><code>sample_cit_types</code> is similarly a growing stochastic block model, but the probability of an edge depends on the (potentially) cited vertex only. </p> <h3>Value</h3> <p>A new graph. </p> <h3>Author(s)</h3> <p>Gabor Csardi <a href="mailto:csardi.gabor@gmail.com">csardi.gabor@gmail.com</a> </p> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>