offdiagonal: Offdiagonal complexity index

Description Usage Arguments Details Value Author(s) References Examples

View source: R/offdiagonal.R

Description

This method calculates the offdiagonal complexity measure.

Usage

1
offdiagonal(g, deg = NULL)

Arguments

g

a graph as a graphNEL object.

deg

the degree of all nodes of g. Will be calculated automatically if left empty.

Details

This method calculates the offdiagonal complexity measure.

Value

It returns the offdiagonal complexity measure as a double-precision floating point value.

Author(s)

Lavanya Sivakumar, Michael Schutte

References

J. Kim and T. Wilhelm. What is a complex graph? Physica A, 387:2637-2652, 2008

Examples

1
2
3
4
5
6
7
8
9
library(graph)
set.seed(123)
g <- randomEGraph(as.character(1:10), 0.6)

offdiagonal(g)

# alternatively:
deg <- graph::degree(g)
offdiagonal(g, deg)

QuACN documentation built on May 2, 2019, 5:46 p.m.