QuACN (version 1.8.0)

QuACN: Quantitative Analysis of Complex Networks

Description

Quantitative Analysis of Complex Networks. This package offers a set of topological network measures to analyze complex Networks structurally.

Copy Link

Version

Install

install.packages('QuACN')

Monthly Downloads

Version

1.8.0

License

LGPL

Maintainer

Karl Kugler

Last Published

November 19th, 2014

Functions in QuACN (1.8.0)

Mean information content of the distance equalities

balabanlike1

BALABAN-like information index U(G)

augmentedZagreb

Augmented Zagreb index

bonchev2

Magnitude-based information index by Bonchev I_D^W(G)

balabanID

Balaban ID number

balabanlike2

BALABAN-like information index XU(G)

atomBondConnectivity

Atom-bond connectivity (ABC) index

bertz

Bertz complexity index

bondOrderID

Conventional bond order ID number

chemicalElements

Information about chemical elements

degreeDistribution

Degree Distribution

complexityIndexB

The complexity index B

calculateDescriptors

Generalized descriptor calculation

compactness

Compactness

distanceDegreeCentric

Distance degree centric index

distanceCodeCentric

Distance code centric index

diameter

Diameter

connectivityID

Randi\'c connectivity ID number

Edge-deleted subgraphs

distanceDegreeCompactness

Compactness measure based on distance degrees

distanceDegreeMIC

Mean information content of the distance degrees

edgeEqualityMIC

Mean information content on the edge equality

edgeMagnitudeMIC

Mean information content on the edge magnitude

distanceDegreeEquality

Mean information content of distance-degree equality

distSumConnectMatrix

Distance-sum-connectivity matrix

geometricArithmetic2

Second geometric-arithmetic index

efficiency

Efficiency complexity index

eigenvalueBased

Eigenvalue-based Descriptors

getLargestSubgraph

A function to extract the largest subgraph from a graphNEL object

getLabels

This method returns the label of a descripor as expression.

geometricArithmetic1

First geometric-arithmetic index

energy

Graph energy

extendedAdjacencyMatrix

Extended Adjacency Matrix

geometricArithmetic3

Third geometric-arithmetic index

estrada

Estrada index

graphIndexComplexity

Graph index complexity measure

hyperDistancePathIndex

Hyper Distance Path Index

informationBondIndex

Information bond index

infoTheoreticLabeledE

Information functional for edge-labeled graphs

informationLayerIndex

Information layer index

infoTheoreticGCM

Information theoretic graph complexity meassures

graphDistanceComplexity

Graph distance complexity measure

globalClusteringCoeff

Global Clustering Coefficient

localClusteringCoeff

Local Clustering Coefficient

meanDistanceDeviation

Mean Distance Deviation

QuACN-package

QuACN: Quantitative Analysis of Complex Networks

radialCentric

Radial Centric Information Index

infoTheoreticLabeledV2

V2 information functional for vertex-labeled graphs

infoTheoreticLabeledV1

V1 information functional for vertex-labeled graphs

minBalabanID

Balaban ID number considering shortest paths only

randomWalkMatrix

Random Walk Markov Matrix

randic

Randic connectivity index

mediumArticulation

Medium articulation index

weightStrucFuncMatrix_exp

Weighted Structure Function Matrix

weightStrucFuncMatrix_lin

Weighted Structure Function Matrix

laplacianEstrada

Laplacian Estrada index

totalAdjacency

Index of total Adjacency

Layer (sphere) matrix

zagreb2

Zagreb group index 2

twoEdgesDeletedSubgraphComplexity

Two-edges-deleted subgraph complexity

laplaceMatrix

Laplacian Matrix

laplacianEnergy

Laplacian energy of a graph

minConnectivityID

Connectivity ID number considering shortest paths only

modifiedZagreb

Modified Zagreb index

konstantinova

Konstantinova

vertConnectMatrix

Vertex Connectivity Matrix

infoTheoreticSum

Add the results of two information functionals

topologicalInfoContent

Topological Information Conten

variableZagreb

Variable Zagreb index

symmetryIndex

Symmetry Index

narumiKatayama

Narumi-Katayama index

vertexDegree

Vertex degree equality-based information index.

normalizedEdgeComplexity

Normalized Edge Complexity

weightedID

Weighted ID number

spanningTreeSensitivity

Spanning tree sensitivity measures

spectralRadius

Spectral radius

offdiagonal

Offdiagonal complexity index

oneEdgeDeletedSubgraphComplexity

One-edge-deleted subgraph complexity measures