representations

repr_adjacency

repr_laplacian

repr_modularity

repr_graphon

This is a collection of functions that convert a graph stored as an
<code><a href="/link/igraph?package=nevada&version=0.2.0" data-mini-rdoc="nevada::igraph">igraph</a></code> object into a desired matrix representation
among adjacency matrix, graph laplacian, modularity matrix or graphon (edge
probability matrix).

A flexible statistical framework for network-valued data analysis.
It leverages the complexity of the space of distributions on graphs by using
the permutation framework for inference as implemented in the 'flipr' package.
Currently, only the two-sample testing problem is covered and generalization
to k samples and regression will be added in the future as well. It is a
4-step procedure where the user chooses a suitable representation of the
networks, a suitable metric to embed the representation into a metric space,
one or more test statistics to target specific aspects of the distributions
to be compared and a formula to compute the permutation p-value. Two types
of inference are provided: a global test answering whether there is a
difference between the distributions that generated the two samples and a
local test for localizing differences on the network structure. The latter
is assumed to be shared by all networks of both samples. References: Lovato,
I., Pini, A., Stamm, A., Vantini, S. (2020) "Model-free two-sample test for
network-valued data" <doi:10.1016/j.csda.2019.106896>; Lovato, I., Pini, A.,
Stamm, A., Taquet, M., Vantini, S. (2021) "Multiscale null hypothesis
testing for network-valued data: Analysis of brain networks of patients with
autism" <doi:10.1111/rssc.12463>.

Aymeric Stamm

nevada

Network-Valued Data Analysis

Ilenia Lovato

Alessia Pini

Simone Vantini

representations function

<dl><dt>network</dt>
<dd>An <code><a href="/link/igraph?package=nevada&version=0.2.0" data-mini-rdoc="nevada::igraph">igraph</a></code> object.</dd>
<dt>validate</dt>
<dd>A boolean specifying whether the function should check the
class of its input (default: <code>TRUE</code>).</dd></dl>

Arguments

This is a collection of functions that convert a graph stored as an
<code><a href='https://rdrr.io/pkg/igraph/man/aaa-igraph-package.html'>igraph</a></code> object into a desired matrix representation
among adjacency matrix, graph laplacian, modularity matrix or graphon (edge
probability matrix).

Network Representation Functions — representations

<dl>

<dt>network</dt>
<dd>An <code><a href='https://rdrr.io/pkg/igraph/man/aaa-igraph-package.html'>igraph</a></code> object.</dd>


<dt>validate</dt>
<dd>A boolean specifying whether the function should check the
class of its input (default: <code>TRUE</code>).</dd>

</dl>

representations: Network Representation Functions

Description

Usage

Value

Arguments

Examples