sparseAdjMat.to.igraph

Uses <code>graph_from_adjacency_matrix</code> function from the <code>igraph</code> package to convert the network in sparse adjacency matrix format into <code>igraph</code> network object.

A flexible tool for simulating complex longitudinal data using
structural equations, with emphasis on problems in causal inference.
Specify interventions and simulate from intervened data generating
distributions. Define and evaluate treatment-specific means, the average
treatment effects and coefficients from working marginal structural models.
User interface designed to facilitate the conduct of transparent and
reproducible simulation studies, and allows concise expression of complex
functional dependencies for a large number of time-varying nodes. See the
package vignette for more information, documentation and examples.

Fred Gruber

simcausal

Simulating Longitudinal Data with Causal Inference Applications

Oleg Sofrygin

Romain Neugebauer

sparseAdjMat.to.igraph function

<dl><dt>sparseAdjMat</dt>
<dd>Network represented as a sparse adjacency matrix (S4 class object <code>dgCMatrix</code> from package <code>Matrix</code>).
NOTE: for directed graphs the friend IDs pointing into vertex <code>i</code> are assumed to be listed in the column <code>i</code>
(i.e, <code>which(sparseAdjMat[,i])</code> are friends of <code>i</code>).</dd>
<dt>mode</dt>
<dd>Character scalar, passed on to <code><a href="/link/igraph%3A%3Agraph_from_adjacency_matrix?package=simcausal&version=0.5.7" data-mini-rdoc="simcausal::igraph::graph_from_adjacency_matrix">igraph::graph_from_adjacency_matrix</a></code>, specifies how igraph should interpret the supplied matrix.
See <code><a href="/link/%3Figraph%3A%3Agraph_from_adjacency_matrix?package=simcausal&version=0.5.7" data-mini-rdoc="simcausal::?igraph::graph_from_adjacency_matrix">?igraph::graph_from_adjacency_matrix</a></code> for details.</dd></dl>

Arguments

Convert Network from Sparse Adjacency Matrix into igraph Object — sparseAdjMat.to.igraph

<dl>

<dt>sparseAdjMat</dt>
<dd>Network represented as a sparse adjacency matrix (S4 class object <code>dgCMatrix</code> from package <code>Matrix</code>).
NOTE: for directed graphs the friend IDs pointing into vertex <code>i</code> are assumed to be listed in the column <code>i</code>
(i.e, <code>which(sparseAdjMat[,i])</code> are friends of <code>i</code>).</dd>


<dt>mode</dt>
<dd>Character scalar, passed on to <code><a href='https://rdrr.io/pkg/igraph/man/graph_from_adjacency_matrix.html'>igraph::graph_from_adjacency_matrix</a></code>, specifies how igraph should interpret the supplied matrix.
See <code><a href='https://rdrr.io/pkg/igraph/man/graph_from_adjacency_matrix.html'>?igraph::graph_from_adjacency_matrix</a></code> for details.</dd>

</dl>

sparseAdjMat.to.igraph: Convert Network from Sparse Adjacency Matrix into igraph Object

Description

Usage

Value

Arguments

See Also