Description Usage Arguments Details Value Author(s) References See Also Examples
Finds the harmonic mean of the geodesic distances between nodes in a graph.
1  harmMeanDist(A, nodesDegree = NULL)

A 

nodesDegree 
vector with nodes degree (in case it is been previously calculated). 
The geodesic distance d_{ij} between two nodes i and j of a graph is given by the shortest number of edges so that we can go from one of the nodes to the other. Then, the harmonic mean of these distances is given by
\bar{d} = [p(p1)/(2∑_{i<j} d_{ij})]^{1}.
The harmonic mean value.
Caballe, Adria <a.caballe@sms.ed.ac.uk>, Natalia Bochkina and Claus Mayer.
Costa, L. and F. Rodrigues (2007). Characterization of complex networks: A survey of measurements. Advances in Physics 56(1), 167242.
lambdaSelection
for lambda selection approaches.
1 2 3 4 5 6 7 8 9  # example to use of harmonic mean function
EX1 < pcorSimulator(nobs = 50, nclusters = 2, nnodesxcluster = c(40,30),
pattern = "powerLaw")
y < EX1$y
out3 < huge(y, method = "mb", lambda = 0.4)
PATH < out3$path[[1]]
hm < harmMeanDist(PATH)

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.