Local Communication Efficeiency — LCE • intsegration

The average inverse shortest path length is a measure known as the global efficiency (see Latora and Marchiori, 2001). We implement the local communication efficiency of node \(i \in G\) as the global communication efficency of the subgraph induced by \(i\), GCE.

LCE(g, directed = FALSE, normalised = TRUE, weights = NULL)

Arguments

g	a network.
directed	default FALSE.
normalised	logical, default TRUE.
weights	edge weights, representing the appeal of each link. if weights is NULL (the default) and g has a weight edge attribute that will be passed to the igraph `distances` function, as \(w_{ij}^{-1}\).

Value

local communication efficiency vector, for each node \(i \in G\) \(LCE(G_i)\) if normalised = TRUE, \(E(G_i)\) otherwise.

References

Latora, V., & Marchiori, M. (2001). Efficient Behavior of Small-World Networks. https://doi.org/10.1103/PhysRevLett.87.198701

Examples

library(intsegration)
library(igraph)
karate <- make_graph("zachary")
LCE(karate)
#> Error in rcpp_floyd_flow(x): vector is too large