edgeEqualityMIC: Mean information content on the edge equality

Description Usage Arguments Value Author(s) References Examples

Description

This method calculates the mean information content on the edge equality.

Usage

1

Arguments

g

a graph as a graphNEL object.

deg

the degree of each node of g. Will be automatically calculated if not supplied.

Value

The return value is the mean information content on the edge equality, a measure based on the partition of edges according to the equivalence of their edge connectivity values.

Author(s)

Michael Schutte

References

Bonchev, D., Mekenyan, O. and Trinajstic, N. Isomer Discrimination by Topological Information Approach. J. Comput. Chem., 2:127-148, 1981

Examples

1
2
3
4
5
set.seed(987)
g <- randomEGraph(LETTERS[1:10], 0.3)
deg <- graph::degree(g)

edgeEqualityMIC(g, deg)


Search within the QuACN package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.