split_graph

Create a random split graph with a perfect core-periphery structure.

Provides a collection of network analytic (convenience) functions which are missing in other standard packages. This includes triad census with attributes <doi:10.1016/j.socnet.2019.04.003>, core-periphery models <doi:10.1016/S0378-8733(99)00019-2>, and several graph generators. Most functions are build upon 'igraph'.

David Schoch

netUtils

A Collection of Tools for Network Analysis

split_graph function

<dl><dt>n</dt>
<dd>number of nodes</dd>
<dt>p</dt>
<dd>probability of peripheral nodes to connect to the core nodes</dd>
<dt>core</dt>
<dd>fraction of nodes in the core</dd></dl>

Arguments

Author

split graph — split_graph

<dl>

<dt>n</dt>
<dd>number of nodes</dd>


<dt>p</dt>
<dd>probability of peripheral nodes to connect to the core nodes</dd>


<dt>core</dt>
<dd>fraction of nodes in the core</dd>

</dl>

split_graph: split graph

Description

Usage

Value

Arguments

Author

Examples