sample_growing

growing.random.game

growing

This function creates a random graph by simulating its stochastic evolution.

graphs

Routines for simple graphs and network analysis. It can
handle large graphs very well and provides functions for generating random
and regular graphs, graph visualization, centrality methods and much more.

Tam<c3><a1>s Nepusz

igraph

Network Analysis and Visualization

sample_growing function

<dl><dt>n</dt>
<dd>Numeric constant, number of vertices in the graph.</dd>
<dt>m</dt>
<dd>Numeric constant, number of edges added in each time step.</dd>
<dt>directed</dt>
<dd>Logical, whether to create a directed graph.</dd>
<dt>citation</dt>
<dd>Logical. If <code>TRUE</code> a citation graph is created, ie. in
each time step the added edges are originating from the new vertex.</dd>
<dt>...</dt>
<dd>Passed to <code>sample_growing</code>.</dd></dl>

Arguments

Gabor Csardi <a href="/link/csardi.gabor%40gmail.com?package=igraph&version=1.3.5" data-mini-rdoc="igraph::csardi.gabor@gmail.com">csardi.gabor@gmail.com</a>

Author

Growing random graph generation — sample_growing

<dl>

<dt>n</dt>
<dd>Numeric constant, number of vertices in the graph.</dd>


<dt>m</dt>
<dd>Numeric constant, number of edges added in each time step.</dd>


<dt>directed</dt>
<dd>Logical, whether to create a directed graph.</dd>


<dt>citation</dt>
<dd>Logical. If <code>TRUE</code> a citation graph is created, ie. in
each time step the added edges are originating from the new vertex.</dd>


<dt>...</dt>
<dd>Passed to <code>sample_growing</code>.</dd>

</dl>

Gabor Csardi <a href='mailto:csardi.gabor@gmail.com'>csardi.gabor@gmail.com</a>

sample_growing: Growing random graph generation

Description

Usage

Value

Arguments

Author

Details

See Also

Examples