sparsity {BDgraph}

Compute the sparsity of a graph

Description

Compute the sparsity of a graph/network or an object of calss "graph" from function graph.sim or an object of calss "sim" from function bdgraph.sim.

Usage

 sparsity( adj ) 

Arguments

adj

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 "graph" from function graph.sim. It can be an object with S3 class "sim" from function bdgraph.sim.

Value

value corresponding to the graph sparsity which is the proportion of the non-links (non-zero elements) in adj.

Author(s)

Reza Mohammadi [e-mail]

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, doi:10.18637/jss.v089.i03

See Also

graph.sim, adj2link, link2adj

Examples

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

sparsity( adj )