EList_Mtrx

Convert an edge list to an adjacency matrix.

Network sparsification with a variety of novel and known network sparsification
techniques. All network sparsification techniques reduce the number of edges, not the number
of nodes. Network sparsification is sometimes referred to as network dimensionality reduction.
This package is based on the work of Spielman, D., Srivastava, N. (2009)<arXiv:0803.0929>.
Koutis I., Levin, A., Peng, R. (2013)<arXiv:1209.5821>. Toivonen, H., Mahler, S., Zhou, F.
(2010)<doi:10.1007>. Foti, N., Hughes, J., Rockmore, D. (2011)<doi:10.1371>.

Alexander Mercier

simplifyNet

Network Sparsification

Andrew Kramer

Shubhankar Tripathi

Tomlin Pulliam

John Drake

EList_Mtrx function

<dl><dt>E_List</dt>
<dd>Edge list formatted | n1 | n2 | weight |.</dd>
<dt>directed</dt>
<dd>Specifies if the network is directed or undirected. Default is set to undirected.</dd>
<dt>n</dt>
<dd>Specify number of nodes. Default is <code>max(E_List[,1:2])</code>.</dd></dl>

Arguments

Author

Edge list to adjacency matrix — EList_Mtrx

<dl>

<dt>E_List</dt>
<dd>Edge list formatted | n1 | n2 | weight |.</dd>


<dt>directed</dt>
<dd>Specifies if the network is directed or undirected. Default is set to undirected.</dd>


<dt>n</dt>
<dd>Specify number of nodes. Default is <code>max(E_List[,1:2])</code>.</dd>

</dl>

EList_Mtrx: Edge list to adjacency matrix

Description

Usage

Value

Arguments

Author