sparsity {BDgraph}R Documentation

Compute the sparsity of a graph

Description

Compute the sparsity of a graph (or a network) or an object of calsses "sim" from function bdgraph.sim and "graph" from function graph.sim.

Usage

 sparsity( adj ) 

Arguments

adj

An adjacency matrix corresponding to a graph structure in which a_{ij}=1 if there is a link between notes i and j, otherwise a_{ij}=0. It can be an object with S3 class "sim" from function bdgraph.sim. It can be an object with S3 class "graph" from function graph.sim.

Value

A value corresponding to the sparsity of a graph.

Author(s)

Reza Mohammadi a.mohammadi@uva.nl

References

Mohammadi, R. and Wit, E. C. (2019). BDgraph: An R Package for Bayesian Structure Learning in Graphical Models, Journal of Statistical Software, 89(3):1-30

See Also

graph.sim, adj2link, link2adj

Examples

# Generating a 'random' graph 
adj <- graph.sim( p = 10, vis = TRUE )

sparsity( adj )

[Package BDgraph version 2.64 Index]