R/calcTopologicalIndices.r
In lsaravia/EcoNetwork: Ecological network analysis includind multiplex networks
Defines functions
calc_modularity
classify_topological_roles
calc_topological_roles
calc_swness_zscore
calcModularitySWnessZScore
calc_modularity_swness_zscore
calcIncoherence
calc_incoherence
calcTopologicalIndices
calc_topological_indices
Documented in
calc_incoherence
calcIncoherence
calc_modularity
calc_modularity_swness_zscore
calc_swness_zscore
calc_topological_indices
calcTopologicalIndices
calc_topological_roles
classify_topological_roles
#' Calculate topological indices for ecological networks. The mean trophic level
#' and Omnivory and the Level of omnivory are calculated with the function [NetIndices::TrophInd()]
#'
#' @param ig vector of igraph objects
#' @param ncores number of cores used to compute in parallel, if 0 sequential processing is used.
#'
#' @return a data.frame with the following fields:
#'
#' \item{Size:}{Number of species}
#' \item{Top:}{Number of top predator species}
#' \item{Basal:}{Number of basal especies}
#' \item{Omnivory:}{ Proportion of omnivorous species }
#' \item{Links:}{ number of interactions}
#' \item{LD:}{ linkage density}
#' \item{Connectance:}{ directed Connectance}
#' \item{PathLength:}{ average path length}
#' \item{Clustering:}{ clustering coeficient}
#' \item{Cannib:}{ number of cannibalistic species}
#' \item{TLmean:}{ mean trophic level}
#' \item{TLmax:}{ maximum trophic level}
#' \item{LOmnivory:} { Level of omnivory, quantifies mean of the variety in trophic levels of the preys of a consumer}
#' \item{Components:}{ number of weakly connected components}
#' \item{Vulnerability:}{ mean of number of consumers per prey}
#' \item{VulSD:}{ the standard deviation of normalized Vulnerability}
#' \item{Generality:}{ mean number of prey per consumer}
#' \item{GenSD:}{ the standard deviation of normalized Generality}
#'
#'
#' @export
#' @importFrom NetIndices TrophInd
#' @import igraph
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
#'
#' @aliases calcTopologicalIndices
#'
#' @examples
#'
#' calc_topological_indices(netData)
#'
#' # Generate a test network
#'
#' g <- graph_from_literal( 1 -+ 4 -+ 7,2 -+ 5 -+7, 3-+6-+7, 7-+7, 4+-3, simplify = FALSE)
#'
#' calc_topological_indices(g)
calc_topological_indices <- function(ig,ncores=0){
if(inherits(ig,"igraph")) {
ig <- list(ig)
} else if(class(ig[[1]])!="igraph") {
stop("parameter ig must be an igraph object")
}
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
df <- foreach(g=ig,.combine='rbind',.inorder=FALSE,.packages=c('igraph','NetIndices')) %dopar%
{
deg <- degree(igraph::simplify(g), mode="out") # calculate the out-degree: the number of predators
V(g)$outdegree <- deg
nTop <- length(V(g)[outdegree==0]) # Top predators do not have predators
deg <- degree(g, mode="in") # calculate the in-degree: the number of preys
V(g)$indegree <- deg
nBasal <- length(V(g)[indegree==0]) # Basal species do not have preys
#vcount(g)-nTop-nBasal
size <- vcount(g)
links <- ecount(g)
linkDen <- links/size # Linkage density
conn <- links/size^2 # Connectance
pathLength <- mean_distance(g) # Average path length
clusCoef <- transitivity(g, type = "global")
cannib <- sum(which_loop(g))
a <- get.adjacency(g,sparse=F)
tl <- TrophInd(a) # Calculate the trophic level
omn <- sum(round(tl$OI,5)>0)/size # Omnivory proportion
lomn <- mean(tl$OI) # Level of omnivory
vulnerability <- links / (size - nTop) # l/(nb + ni)
generality <- links / (size - nBasal) # l/(nt + ni)
vulSD <- sd(apply(a, 1, sum)*1/linkDen)
genSD <- sd(apply(a, 2, sum)*1/linkDen)
data.frame(Size=size,Top=nTop,Basal=nBasal,Omnivory=omn,Links=links, LD=linkDen,Connectance=conn,PathLength=pathLength,
Clustering=clusCoef, Cannib=cannib, TLmean=mean(tl$TL),TLmax=max(tl$TL),LOmnivory=lomn,Components=components(g)$no,
Vulnerability=vulnerability,VulSD=vulSD,Generality=generality,GenSD=genSD)
}
return(df)
}
#' @export
calcTopologicalIndices <- function(ig,ncores=0){
calc_topological_indices(ig,ncores)
}
#' Calculate the incoherence index of a food web
#'
#' The incoherence index is based in how the species fit in discrete trophic levels
#' when Q is closer to 0 more coherent and stable is a food web, and the less omnivory it has.
#' It calculates the trophic level using the package NetIndices.
#'
#' Based on:
#'
#' @references Johnson, S., Domínguez-García, V., Donetti, L., & Muñoz, M. A. (2014). Trophic coherence determines food-web stability. Proceedings of the National Academy of Sciences , 111(50), 17923–17928. https://doi.org/10.1073/pnas.1409077111
#'
#' @references Johnson, S., & Jones, N. S. (2017). Looplessness in networks is linked to trophic coherence. Proceedings of the National Academy of Sciences, 114(22), 5618–5623. https://doi.org/10.1073/pnas.1613786114
#'
#'
#' @param ig an igraph object or a list of igraph objects
#' @param ncores number of cores used to compute in parallel, if 0 sequential processing is used.
#'
#' @return a data.frame with the following fields
#'
#' \item{Q}{incoherence (0=coherent)}
#' \item{rQ}{ratio of Q with expected Q under null expectation of a random network given N=nodes L=links B=basal nodes Lb=basal links}
#' \item{mTI}{mean trophic level}
#' \item{rTI}{ratio of mTI with expected TI under the same null model expectation than Q}
#
#' @aliases calcIncoherence
#'
#' @export
#'
#' @examples
#'
#' calc_incoherence(netData[[1]])
#'
#'
#' @importFrom NetIndices TrophInd
#' @importFrom igraph V degree get.adjacency vcount ecount
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
calc_incoherence <- function(ig,ncores=0) {
if(inherits(ig,"igraph")) {
ig <- list(ig)
} else if(class(ig[[1]])!="igraph") {
stop("parameter ig must be an igraph object")
}
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
# if(!is.null(ncores)) {
# cn <-parallel::detectCores()
# if(cn>ncores)
# cn <- ncores
# else
# cn <- cn-1
#
# # cl <- makeCluster(cn,outfile="foreach.log") # Logfile to debug
# cl <- parallel::makeCluster(cn)
# doParallel::registerDoParallel(cl)
# on.exit(parallel::stopCluster(cl))
# } else {
# foreach::registerDoSEQ()
# }
df <- foreach(g=ig,.combine='rbind',.inorder=FALSE,.packages=c('igraph','NetIndices')) %dopar%
{
ti<-TrophInd(get.adjacency(g,sparse=FALSE))
v <- ti$TL
z <- round(outer(v,v,'-'),8);
A <- get.adjacency(g,sparse = FALSE)
xx <- A>0
x <- (A*t(z))[xx]
Q <- round(sqrt(sum((x-1)^2)/ecount(g) ),8)
basal <- which(round(v,8)==1)
bedges <- sum(degree(g,basal,mode='out'))
mTI <- mean(v)
mK <- mean(degree(g,mode='out'))
eTI <- 1+(1-length(basal)/vcount(g))*ecount(g)/bedges
eQ <- sqrt(ecount(g)/bedges-1)
data.frame(Q=Q,rQ=Q/eQ,mTI=mTI,rTI=mTI/eTI)
}
return(df)
}
#' @export
calcIncoherence <- function(ig,ncores=0){
calc_incoherence(ig,ncores)
}
#' Calculation of Modularity and Small-world-ness z-scores
#'
#' The function calculates modularity, number of groups and small-world-ness z-scores and 99\% CI intervals
#' using as null model the list of networks in the nullDist parameters. Modularity is calculated using the [igraph::cluster_spinglass()]
#' if the parameter weights is NULL the atribute "weigths" is used, or if it has the name of an network attribute, that is used as a weigth
#' to build the modules, when this parameter is NA then no weigth is used.
#' Only works for one component networks
#'
#' @references
#' Marina, T. I., Saravia, L. A., Cordone, G., Salinas, V., Doyle, S. R., & Momo, F. R. (2018). Architecture of marine food webs: To be or not be a ‘small-world.’ PLoS ONE, 13(5), 1–13. https://doi.org/10.1371/journal.pone.0198217
#'
#' @param g igraph object
#' @param nullDist list of igraph object with the null model simulations
#' @param sLevel significance level to calculate CI (two tails)
#' @param ncores number of cores to use paralell computation, if 0 sequential processing is used.
#' @param weights The weights of the edges. Either a numeric vector or NULL or NA. If it is null and the input graph has a ‘weight’ edge attribute
#' then that will be used. If NULL and no such attribute is present then the edges will have equal weights.
#' Set this to NA if the graph was a ‘weight’ edge attribute, but you don't want to use it for community detection.
#'
#'
#' @return a list with two data frames: one with indices z-scores and CI
#'
#' \item{Clustering}{ Clustering coefficient, measures the average fraction of pairs of neighbors of a node that are also neighbors of each other}
#' \item{PathLength}{ Mean of the shortest paths between all pair of vertices }
#' \item{Modularity}{ modularity measures how separated are different groups from each other, the algorithm \code{cluster_spinglass} was used to obtain the groups}
#' \item{zCC,zCP,zMO}{Z-scores of Clustering,PathLength and Modularity with respect to a random Erdos-Renyi null model}
#' \item{CClow,CChigh,CPlow,CPhigh,MOlow,MOhigh}{sLevel confidence intervals}
#' \item{SWness,SWnessCI}{ Small-world-ness and it CI value}
#' \item{isSW,isSWness}{ Logical variable signalling if the network is Small-world by the method of Marina 2018 or the method of Humprhies & Gurney 2008 }
#'
#' Another data.frame with the values calculated for the nullDist.
#'
#' @export
#'
#' @importFrom igraph transitivity average.path.length cluster_spinglass
#' @importFrom future.apply future_lapply
#' @importFrom future sequential multiprocess
#'
#' @examples
#' \dontrun{
#' nullg <- generateERbasal(netData[[1]],10)
#' calcModularitySWnessZScore(netData[[1]],nullg)
#' }
#'
calc_modularity_swness_zscore<- function(g, nullDist,sLevel=0.01,ncores=0,weights=NA){
if(!is_igraph(g))
stop("Parameter g must be an igraph object")
t <- calcTopologicalIndices(g)
if(length(nullDist)<5)
stop("nullDist: There has to be more than 5 elements in the list")
if(any(sapply(nullDist, function(g) components(g)$no>1)))
stop("nullDist: one or more igraph object from nullDist have more than one component")
# nullDist <- lapply(1:nsim, function (x) {
# e <- sample_gnm(t$Size, t$Links, directed = TRUE)
#
# # Check that the ER networks has only one connected component
# #
# while(components(e)$no>1)
# e <- erdos.renyi.game(t$Size, t$Links, type="gnm",directed = TRUE)
#
# return(e) }
# )
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
ind <- data.frame()
ind <- future_lapply(1:length(nullDist), function(i)
{
m<-cluster_spinglass(nullDist[[i]],weights=weights)
modl <- m$modularity
clus.coef <- transitivity(nullDist[[i]], type="Global")
cha.path <- average.path.length(nullDist[[i]])
data.frame(modularity=modl,clus.coef=clus.coef,cha.path=cha.path)
}, future.seed = TRUE)
ind <- bind_rows(ind)
ind$gamma <- t$Clustering/ind$clus.coef
ind$lambda <- t$PathLength/ind$cha.path
ind$SWness <- ind$gamma/ind$lambda
# 99% confidence interval
#
sLevel <- sLevel/2
qSW <- quantile(ind$SWness,c(sLevel,1-sLevel),na.rm = TRUE)
qmo <- quantile(ind$modularity,c(sLevel,1-sLevel))
mcc <- mean(ind$clus.coef)
mcp <- mean(ind$cha.path)
zcc <- (t$Clustering-mcc)/sd(ind$clus.coef)
zcp <- (t$PathLength-mcp)/sd(ind$cha.path)
qcc <- quantile(ind$clus.coef,c(sLevel,1-sLevel),na.rm = TRUE)
qcp <- quantile(ind$cha.path,c(sLevel,1-sLevel),na.rm = TRUE)
m<-cluster_spinglass(g, weights=weights)
zmo <- (m$modularity - mean(ind$modularity))/sd(ind$modularity)
mSW <- mean(t$Clustering/mcc*mcp/t$PathLength)
mCI <- 1+(qSW[2]-qSW[1])/2
isLowInsideCPL <- t$PathLength<=qcp[2]
isGreaterCC <- t$Clustering>qcc[2]
isSW <- (isLowInsideCPL & isGreaterCC)
isSWness <- (mSW>mCI)
return(list(da=data.frame(Clustering=t$Clustering, PathLength= t$PathLength, Modularity=m$modularity,
zCC=zcc,zCP=zcp,zMO=zmo,
CClow=qcc[1],CChigh=qcc[2],CPlow=qcp[1],CPhigh=qcp[2],MOlow=qmo[1],MOhigh=qmo[2],
SWness=mSW,SWnessCI=mCI,
isSW=isSW,isSWness=isSWness),sims=ind))
}
#' @export
calcModularitySWnessZScore<- function(g, nullDist,sLevel=0.01,ncores=0){
calc_modularity_swness_zscore(g, nullDist,sLevel,ncores)
}
#' Calculation Small-world-ness z-scores
#'
#' The function calculates small-world-ness z-scores and 99\% CI intervals,
#' using as null model the list of networks in the nullDist parameter.
#'
#' @references
#' Marina, T. I., Saravia, L. A., Cordone, G., Salinas, V., Doyle, S. R., & Momo, F. R. (2018). Architecture of marine food webs: To be or not be a ‘small-world.’ PLoS ONE, 13(5), 1–13. https://doi.org/10.1371/journal.pone.0198217
#'
#' @param g igraph object
#' @param nullDist list of igraph object with the null model simulations
#' @param sLevel significance level to calculate CI (two tails)
#' @param ncores number of cores to use paralell computation, if 0 sequential processing is used.
#'
#'
#' @return a list with two data frames: one with indices z-scores and CI
#'
#' \item{Clustering}{ Clustering coefficient, measures the average fraction of pairs of neighbors of a node that are also neighbors of each other}
#' \item{PathLength}{ Mean of the shortest paths between all pair of vertices }
#' \item{Modularity}{ modularity measures how separated are different groups from each other, the algorithm \code{cluster_spinglass} was used to obtain the groups}
#' \item{zCC,zCP,zMO}{Z-scores of Clustering,PathLength and Modularity with respect to a random Erdos-Renyi null model}
#' \item{CClow,CChigh,CPlow,CPhigh,MOlow,MOhigh}{sLevel confidence intervals}
#' \item{SWness,SWnessCI}{ Small-world-ness and it CI value}
#' \item{isSW,isSWness}{ Logical variable signalling if the network is Small-world by the method of Marina 2018 or the method of Humprhies & Gurney 2008 }
#'
#' Another data.frame with the values calculated for the nullDist.
#'
#' @export
#'
#' @importFrom igraph transitivity average.path.length
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
#'
#' @examples
#' \dontrun{
#' nullg <- generateERbasal(netData[[1]],10)
#' calc_swness_zscore(netData[[1]],nullg)
#' }
#'
calc_swness_zscore<- function(g, nullDist,sLevel=0.01,ncores=0,weights=NA){
if(!is_igraph(g))
stop("Parameter g must be an igraph object")
t <- calcTopologicalIndices(g)
if(length(nullDist)<5)
stop("nullDist: There has to be more than 5 elements in the list")
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
ind <- data.frame()
ind <- foreach(i=1:length(nullDist),.combine='rbind',.inorder=FALSE,.packages='igraph') %dopar%
{
clus.coef <- transitivity(nullDist[[i]], type="Global")
cha.path <- average.path.length(nullDist[[i]])
data.frame(clus.coef=clus.coef,cha.path=cha.path)
}
ind$gamma <- t$Clustering/ind$clus.coef
ind$lambda <- t$PathLength/ind$cha.path
ind$SWness <- ind$gamma/ind$lambda
# 99% confidence interval
#
sLevel <- sLevel/2
qSW <- quantile(ind$SWness,c(sLevel,1-sLevel),na.rm = TRUE)
mcc <- mean(ind$clus.coef)
mcp <- mean(ind$cha.path)
zcc <- (t$Clustering-mcc)/sd(ind$clus.coef)
zcp <- (t$PathLength-mcp)/sd(ind$cha.path)
qcc <- quantile(ind$clus.coef,c(sLevel,1-sLevel),na.rm = TRUE)
qcp <- quantile(ind$cha.path,c(sLevel,1-sLevel),na.rm = TRUE)
mSW <- mean(t$Clustering/mcc*mcp/t$PathLength)
mCI <- 1+(qSW[2]-qSW[1])/2
isLowInsideCPL <- t$PathLength<=qcp[2]
isGreaterCC <- t$Clustering>qcc[2]
isSW <- (isLowInsideCPL & isGreaterCC)
isSWness <- (mSW>mCI)
return(list(da=data.frame(Clustering=t$Clustering, PathLength= t$PathLength,
zCC=zcc,zCP=zcp,
CClow=qcc[1],CChigh=qcc[2],CPlow=qcp[1],CPhigh=qcp[2],
SWness=mSW,SWnessCI=mCI,
isSW=isSW,isSWness=isSWness),sims=ind))
}
#' Calc topological roles among network communities/modules
#'
#' Topological roles characterize species as its roles between communities or modules, we calculate the modules using
#' the [igraph::cluster_spinglass()] function.
#' Topological roles are described by two parameters: the standardized within-module degree \eqn{dz} and the among-module
#' connectivity participation coefficient \eqn{PC}. The within-module degree is a z-score that measures how well a species is
#' connected to other species within its own module compared with a random graph. The participation coefficient \eqn{PC}
#' estimates the distribution of the links of species among modules. As the community algorithm is stochastic we run it several
#' times and return the repeated runs for both parameters.
#'
#' @references
#'
#' 1. Guimerà, R. & Nunes Amaral, L.A. (2005). Functional cartography of complex metabolic networks. Nature, 433, 895–900
#'
#' 1. Kortsch, S. et al. 2015. Climate change alters the structure of arctic marine food webs due to poleward shifts of boreal generalists. - Proceedings of the Royal Society B: Biological Sciences 282: 20151546. https://doi.org/10.1098/rspb.2015.1546
#'
#' @param g an Igraph object with the network
#' @param nsim number of simulations with different community
#' @param ncores number of cores to use paralell computation, if 0 sequential processing is used.
#'
#' @return a data frame with two numeric fields: within_module_degree, among_module_conn
#'
#' @export
#'
#' @import igraph
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
#'
#' @examples
#' #' \dontrun{
#'
#' g <- netData[[2]]
#'
#' tp <- calc_topological_roles(g,nsim=10)
#'
#' }
calc_topological_roles <- function(g,nsim=1000,ncores=0)
{
if(!is_igraph(g))
stop("Parameter g must be an igraph object")
toRol <- data.frame()
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
toRol <- foreach(idx=1:nsim,.combine='rbind',.inorder=FALSE,.packages='igraph') %dopar%
{
# within-module degree
#
# Standarized Within module degree z-score
#
m<-cluster_spinglass(g,weights = NA)
spingB.mem<- m$membership
l<-vector()
memMod<-vector()
for (i in 1:vcount(g)){
sp.in.deg <- V(g)[nei(i, "in")]
sp.out.deg<- V(g)[nei(i, "out")]
mem.sp<-spingB.mem[i]
k<- length(which(spingB.mem[c(sp.in.deg, sp.out.deg)]==mem.sp))
mem<- which(spingB.mem==mem.sp)
for (m in 1:length(mem)){
mem.in.deg <- V(g)[nei(mem[m], "in")]
mem.out.deg<- V(g)[nei(mem[m], "out")]
memMod.id<- length(which(spingB.mem[c(mem.in.deg, mem.out.deg)]==mem.sp))
memMod[m]<- memMod.id
}
k.ave<- mean(memMod)
k.sd<- sd(memMod)
l[i]<- (k-k.ave)/k.sd
}
# among module connectivity
r<- vector()
for (i in 1:vcount(g)){
d<-degree(g)[i]
sp.in.deg <- V(g)[nei(i, "in")]
sp.out.deg<- V(g)[nei(i, "out")]
mod.sp<-table(spingB.mem[c(sp.in.deg, sp.out.deg)])
mod.no<-as.numeric(names(mod.sp))
mod<-rep(0, length(unique(spingB.mem)))
mod[mod.no]<-c(mod.sp)
r[i]<- 1-(sum((mod/d)^2))
}
return(data.frame(node=1:vcount(g),within_module_degree=l, among_module_conn=r))
}
return(toRol)
}
#' Classify and plot topological roles
#'
#' We use the topological roles calculated with [calc_topological_roles()] and categorize them following the approach of
#' Kortsch (2015), that defines species roles based in two thresholds \eqn{PC=0.625} and \eqn{dz=2.5}.
#' If a species had at least 60% of links within its own module then \eqn{PC<0.625}, and if it also had \eqn{dz\ge 2.5}, thus it was
#' classified as a module hub, labeled **modhub**. If a species had \eqn{PC<0.625} and \eqn{dz<2.5}, then it was called a peripheral
#' or specialist, labeled **modspe**. Species that had \eqn{PC\ge0.625} and \eqn{dz<2.5} were considered module connectors **modcon**.
#' Finally, if a species had \eqn{PC\ge0.625} and \eqn{dz\ge 2.5}, then it was classified as a super-generalist or hub-connector **hubcon**.
#'
#' @references
#'
#'1. Kortsch, S., Primicerio, R., Fossheim, M., Dolgov, A. V & Aschan, M. (2015). Climate change alters the structure of arctic marine food webs due to poleward shifts of boreal generalists. Proc. R. Soc. B Biol. Sci., 282
#'
#' 1. Saravia, L.A., Marina, T.I., De Troch, M. & Momo, F.R. (2018). Ecological Network assembly: how the regional meta web influence local food webs. bioRxiv, 340430, doi: https://doi.org/10.1101/340430
#'
#' @param tRoles Calculated topological roles with the function [calc_topological_roles()]
#' @param g Igraph network object
#' @param spingB Igraph community object
#' @param plt logical whether a plot is generated
#'
#' @return a data.frame with the classified topological roles
#' @export
#'
#' @importFrom RColorBrewer brewer.pal
#' @importFrom dplyr %>% group_by summarise_all inner_join
#'
#' @examples
#' \dontrun{
#'
#' g <- netData[[2]]
#'
#' tp <- calc_topological_roles(g,nsim=10)
#'
#' classify_topological_roles(tp,g,plt=TRUE)
#' }
classify_topological_roles <- function(tRoles,g,spingB=NULL,plt=FALSE){
if(is.null(spingB))
spingB <- cluster_spinglass(g,weights=NA)
spingB.mem<- spingB$membership
tRoles <- tRoles %>% group_by(node) %>% summarise_all(mean)
l <- tRoles$within_module_degree
r <- tRoles$among_module_conn
# Plot
if(plt){
colbar.FG <- brewer.pal(length(spingB$csize),"Dark2")
old_par <- par(mfrow=c(1,1))
par(oma=c(2.7,1.3,0.7,1)) # change outer figure margins
par(mai=c(1,1,0.7,0.7)) # size of figure margins
yran <- range(l,na.rm = TRUE,finite=TRUE)
xran <- range(r)
plot(l~r, type="n", axes=T ,tck=F, lwd=2, ann=F, cex.axis=1.2, xlim=xran, ylim=yran)
lines(c(0.625,0.625), yran, col="grey")
lines(xran, c(2.5, 2.5), col="grey")
points(r, l, col=colbar.FG[spingB.mem], pch=20, cex=2)
mtext(2, text="Within module degree", line=4,font=2, cex=1.2)
mtext(1, text="Among module connectivity",line=4, font=2, cex=1.2)
axis(1, tck=0.02, lwd=1,las=2,lty=1, labels=F, xlim=c(0,1))
axis(2,tck=0.02, labels=FALSE)
}
# Which are the module hubs: many links within its own module.
#
modhub <- which(l>2.5)
modhub <- modhub[which(l>2.5) %in% which(r<=0.625)]
modlbl <- vertex_attr(g, "name", index=modhub)
if(is.null(modlbl))
modlbl <- modhub
hub_conn <- data.frame()
if(length(modhub)) {
if(plt) text(r[modhub],l[modhub],labels = modlbl,cex=0.7,pos=3)
hub_conn <- data.frame(type="modhub",node=modhub,name=modlbl)
}
#points(r[modhub], l[modhub], cex=4, col="blue", pch=20)
# Which are the hub connectors: high within and between-module connectivity
# and are classified super-generalists
#
modhub <- which(l>2.5)
modhub <- modhub[which(l>2.5) %in% which(r>0.625)]
modlbl <- vertex_attr(g,"name",index=modhub)
if(is.null(modlbl))
modlbl <- modhub
if(length(modhub)) {
if(plt) {
text(r[modhub],l[modhub],labels = modlbl,cex=0.7,pos=3)
par(old_par)
}
}
#points(r[modhub], l[modhub], cex=4, col="blue", pch=20)
if(length(modhub)){
hub_conn <- rbind(hub_conn, data.frame(type="hubcon",node=modhub,name=modlbl))
}
# Which are the module specialist: Few links and most of them within its own module
#
modhub <- which(l<=2.5)
modhub <- modhub[which(l<=2.5) %in% which(r<=0.625)]
modlbl <- vertex_attr(g,"name",index=modhub)
if(is.null(modlbl))
modlbl <- modhub
hub_conn <- rbind(hub_conn, data.frame(type="modspe",node=modhub,name=modlbl))
# Which are the module connectors: Few links and between modules
#
modhub <- which(l<=2.5)
modhub <- modhub[which(l<=2.5) %in% which(r>0.625)]
modlbl <- vertex_attr(g,"name", index=modhub)
if(is.null(modlbl))
modlbl <- modhub
hub_conn <- rbind(hub_conn, data.frame(type="modcon",node=modhub,name=modlbl))
hub_conn <- hub_conn %>% inner_join(tRoles)
return(hub_conn)
}
#' Calculation of Modularity for a list of igraph objects
#'
#' The function calculates modularity of the list of networks in the nullDist parameter.
#' Modularity is calculated using the [igraph::cluster_spinglass()]
#' Only works for one component networks.
#'
#'
#' @param ig list of igraph objects to calculate modularity
#' @param ncores number of cores used to compute in parallel, if 0 sequential processing is used.
#' @param weights The weights of the edges. Either a numeric vector or NULL or NA. If it is null and the input graph has a ‘weight’ edge attribute
#' then that will be used. If NULL and no such attribute is present then the edges will have equal weights.
#' Set this to NA if the graph was a ‘weight’ edge attribute, but you don't want to use it for community detection.
#'
#' @return a data.frame with the field Modularity
#'
#' @export
#'
#' @import igraph
#' @importFrom future.apply future_lapply
#' @importFrom future sequential multiprocess
#'
#'
#' @examples
#' \dontrun{
#' nullg <- generateERbasal(netData[[1]],10)
#' calc_modularity(nullg)
#' }
#'
calc_modularity <- function(ig,ncores=0,weights=NA){
if(inherits(ig,"igraph")) {
ig <- list(ig)
} else if(class(ig[[1]])!="igraph") {
stop("parameter ig must be an igraph object")
}
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
df <- future_lapply(ig, function(g)
{
m<-cluster_spinglass(g,weights=weights)
modl <- m$modularity
data.frame(Modularity=modl)
}, future.seed=TRUE)
return(bind_rows(df))
}
lsaravia/EcoNetwork documentation built on June 12, 2022, 6:57 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Defines functions calc_modularity classify_topological_roles calc_topological_roles calc_swness_zscore calcModularitySWnessZScore calc_modularity_swness_zscore calcIncoherence calc_incoherence calcTopologicalIndices calc_topological_indices
Documented in calc_incoherence calcIncoherence calc_modularity calc_modularity_swness_zscore calc_swness_zscore calc_topological_indices calcTopologicalIndices calc_topological_roles classify_topological_roles
#' Calculate topological indices for ecological networks. The mean trophic level
#' and Omnivory and the Level of omnivory are calculated with the function [NetIndices::TrophInd()]
#'
#' @param ig vector of igraph objects
#' @param ncores number of cores used to compute in parallel, if 0 sequential processing is used.
#'
#' @return a data.frame with the following fields:
#'
#' \item{Size:}{Number of species}
#' \item{Top:}{Number of top predator species}
#' \item{Basal:}{Number of basal especies}
#' \item{Omnivory:}{ Proportion of omnivorous species }
#' \item{Links:}{ number of interactions}
#' \item{LD:}{ linkage density}
#' \item{Connectance:}{ directed Connectance}
#' \item{PathLength:}{ average path length}
#' \item{Clustering:}{ clustering coeficient}
#' \item{Cannib:}{ number of cannibalistic species}
#' \item{TLmean:}{ mean trophic level}
#' \item{TLmax:}{ maximum trophic level}
#' \item{LOmnivory:} { Level of omnivory, quantifies mean of the variety in trophic levels of the preys of a consumer}
#' \item{Components:}{ number of weakly connected components}
#' \item{Vulnerability:}{ mean of number of consumers per prey}
#' \item{VulSD:}{ the standard deviation of normalized Vulnerability}
#' \item{Generality:}{ mean number of prey per consumer}
#' \item{GenSD:}{ the standard deviation of normalized Generality}
#'
#'
#' @export
#' @importFrom NetIndices TrophInd
#' @import igraph
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
#'
#' @aliases calcTopologicalIndices
#'
#' @examples
#'
#' calc_topological_indices(netData)
#'
#' # Generate a test network
#'
#' g <- graph_from_literal( 1 -+ 4 -+ 7,2 -+ 5 -+7, 3-+6-+7, 7-+7, 4+-3, simplify = FALSE)
#'
#' calc_topological_indices(g)
calc_topological_indices <- function(ig,ncores=0){
if(inherits(ig,"igraph")) {
ig <- list(ig)
} else if(class(ig[[1]])!="igraph") {
stop("parameter ig must be an igraph object")
}
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
df <- foreach(g=ig,.combine='rbind',.inorder=FALSE,.packages=c('igraph','NetIndices')) %dopar%
{
deg <- degree(igraph::simplify(g), mode="out") # calculate the out-degree: the number of predators
V(g)$outdegree <- deg
nTop <- length(V(g)[outdegree==0]) # Top predators do not have predators
deg <- degree(g, mode="in") # calculate the in-degree: the number of preys
V(g)$indegree <- deg
nBasal <- length(V(g)[indegree==0]) # Basal species do not have preys
#vcount(g)-nTop-nBasal
size <- vcount(g)
links <- ecount(g)
linkDen <- links/size # Linkage density
conn <- links/size^2 # Connectance
pathLength <- mean_distance(g) # Average path length
clusCoef <- transitivity(g, type = "global")
cannib <- sum(which_loop(g))
a <- get.adjacency(g,sparse=F)
tl <- TrophInd(a) # Calculate the trophic level
omn <- sum(round(tl$OI,5)>0)/size # Omnivory proportion
lomn <- mean(tl$OI) # Level of omnivory
vulnerability <- links / (size - nTop) # l/(nb + ni)
generality <- links / (size - nBasal) # l/(nt + ni)
vulSD <- sd(apply(a, 1, sum)*1/linkDen)
genSD <- sd(apply(a, 2, sum)*1/linkDen)
data.frame(Size=size,Top=nTop,Basal=nBasal,Omnivory=omn,Links=links, LD=linkDen,Connectance=conn,PathLength=pathLength,
Clustering=clusCoef, Cannib=cannib, TLmean=mean(tl$TL),TLmax=max(tl$TL),LOmnivory=lomn,Components=components(g)$no,
Vulnerability=vulnerability,VulSD=vulSD,Generality=generality,GenSD=genSD)
}
return(df)
}
#' @export
calcTopologicalIndices <- function(ig,ncores=0){
calc_topological_indices(ig,ncores)
}
#' Calculate the incoherence index of a food web
#'
#' The incoherence index is based in how the species fit in discrete trophic levels
#' when Q is closer to 0 more coherent and stable is a food web, and the less omnivory it has.
#' It calculates the trophic level using the package NetIndices.
#'
#' Based on:
#'
#' @references Johnson, S., Domínguez-García, V., Donetti, L., & Muñoz, M. A. (2014). Trophic coherence determines food-web stability. Proceedings of the National Academy of Sciences , 111(50), 17923–17928. https://doi.org/10.1073/pnas.1409077111
#'
#' @references Johnson, S., & Jones, N. S. (2017). Looplessness in networks is linked to trophic coherence. Proceedings of the National Academy of Sciences, 114(22), 5618–5623. https://doi.org/10.1073/pnas.1613786114
#'
#'
#' @param ig an igraph object or a list of igraph objects
#' @param ncores number of cores used to compute in parallel, if 0 sequential processing is used.
#'
#' @return a data.frame with the following fields
#'
#' \item{Q}{incoherence (0=coherent)}
#' \item{rQ}{ratio of Q with expected Q under null expectation of a random network given N=nodes L=links B=basal nodes Lb=basal links}
#' \item{mTI}{mean trophic level}
#' \item{rTI}{ratio of mTI with expected TI under the same null model expectation than Q}
#
#' @aliases calcIncoherence
#'
#' @export
#'
#' @examples
#'
#' calc_incoherence(netData[[1]])
#'
#'
#' @importFrom NetIndices TrophInd
#' @importFrom igraph V degree get.adjacency vcount ecount
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
calc_incoherence <- function(ig,ncores=0) {
if(inherits(ig,"igraph")) {
ig <- list(ig)
} else if(class(ig[[1]])!="igraph") {
stop("parameter ig must be an igraph object")
}
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
# if(!is.null(ncores)) {
# cn <-parallel::detectCores()
# if(cn>ncores)
# cn <- ncores
# else
# cn <- cn-1
#
# # cl <- makeCluster(cn,outfile="foreach.log") # Logfile to debug
# cl <- parallel::makeCluster(cn)
# doParallel::registerDoParallel(cl)
# on.exit(parallel::stopCluster(cl))
# } else {
# foreach::registerDoSEQ()
# }
df <- foreach(g=ig,.combine='rbind',.inorder=FALSE,.packages=c('igraph','NetIndices')) %dopar%
{
ti<-TrophInd(get.adjacency(g,sparse=FALSE))
v <- ti$TL
z <- round(outer(v,v,'-'),8);
A <- get.adjacency(g,sparse = FALSE)
xx <- A>0
x <- (A*t(z))[xx]
Q <- round(sqrt(sum((x-1)^2)/ecount(g) ),8)
basal <- which(round(v,8)==1)
bedges <- sum(degree(g,basal,mode='out'))
mTI <- mean(v)
mK <- mean(degree(g,mode='out'))
eTI <- 1+(1-length(basal)/vcount(g))*ecount(g)/bedges
eQ <- sqrt(ecount(g)/bedges-1)
data.frame(Q=Q,rQ=Q/eQ,mTI=mTI,rTI=mTI/eTI)
}
return(df)
}
#' @export
calcIncoherence <- function(ig,ncores=0){
calc_incoherence(ig,ncores)
}
#' Calculation of Modularity and Small-world-ness z-scores
#'
#' The function calculates modularity, number of groups and small-world-ness z-scores and 99\% CI intervals
#' using as null model the list of networks in the nullDist parameters. Modularity is calculated using the [igraph::cluster_spinglass()]
#' if the parameter weights is NULL the atribute "weigths" is used, or if it has the name of an network attribute, that is used as a weigth
#' to build the modules, when this parameter is NA then no weigth is used.
#' Only works for one component networks
#'
#' @references
#' Marina, T. I., Saravia, L. A., Cordone, G., Salinas, V., Doyle, S. R., & Momo, F. R. (2018). Architecture of marine food webs: To be or not be a ‘small-world.’ PLoS ONE, 13(5), 1–13. https://doi.org/10.1371/journal.pone.0198217
#'
#' @param g igraph object
#' @param nullDist list of igraph object with the null model simulations
#' @param sLevel significance level to calculate CI (two tails)
#' @param ncores number of cores to use paralell computation, if 0 sequential processing is used.
#' @param weights The weights of the edges. Either a numeric vector or NULL or NA. If it is null and the input graph has a ‘weight’ edge attribute
#' then that will be used. If NULL and no such attribute is present then the edges will have equal weights.
#' Set this to NA if the graph was a ‘weight’ edge attribute, but you don't want to use it for community detection.
#'
#'
#' @return a list with two data frames: one with indices z-scores and CI
#'
#' \item{Clustering}{ Clustering coefficient, measures the average fraction of pairs of neighbors of a node that are also neighbors of each other}
#' \item{PathLength}{ Mean of the shortest paths between all pair of vertices }
#' \item{Modularity}{ modularity measures how separated are different groups from each other, the algorithm \code{cluster_spinglass} was used to obtain the groups}
#' \item{zCC,zCP,zMO}{Z-scores of Clustering,PathLength and Modularity with respect to a random Erdos-Renyi null model}
#' \item{CClow,CChigh,CPlow,CPhigh,MOlow,MOhigh}{sLevel confidence intervals}
#' \item{SWness,SWnessCI}{ Small-world-ness and it CI value}
#' \item{isSW,isSWness}{ Logical variable signalling if the network is Small-world by the method of Marina 2018 or the method of Humprhies & Gurney 2008 }
#'
#' Another data.frame with the values calculated for the nullDist.
#'
#' @export
#'
#' @importFrom igraph transitivity average.path.length cluster_spinglass
#' @importFrom future.apply future_lapply
#' @importFrom future sequential multiprocess
#'
#' @examples
#' \dontrun{
#' nullg <- generateERbasal(netData[[1]],10)
#' calcModularitySWnessZScore(netData[[1]],nullg)
#' }
#'
calc_modularity_swness_zscore<- function(g, nullDist,sLevel=0.01,ncores=0,weights=NA){
if(!is_igraph(g))
stop("Parameter g must be an igraph object")
t <- calcTopologicalIndices(g)
if(length(nullDist)<5)
stop("nullDist: There has to be more than 5 elements in the list")
if(any(sapply(nullDist, function(g) components(g)$no>1)))
stop("nullDist: one or more igraph object from nullDist have more than one component")
# nullDist <- lapply(1:nsim, function (x) {
# e <- sample_gnm(t$Size, t$Links, directed = TRUE)
#
# # Check that the ER networks has only one connected component
# #
# while(components(e)$no>1)
# e <- erdos.renyi.game(t$Size, t$Links, type="gnm",directed = TRUE)
#
# return(e) }
# )
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
ind <- data.frame()
ind <- future_lapply(1:length(nullDist), function(i)
{
m<-cluster_spinglass(nullDist[[i]],weights=weights)
modl <- m$modularity
clus.coef <- transitivity(nullDist[[i]], type="Global")
cha.path <- average.path.length(nullDist[[i]])
data.frame(modularity=modl,clus.coef=clus.coef,cha.path=cha.path)
}, future.seed = TRUE)
ind <- bind_rows(ind)
ind$gamma <- t$Clustering/ind$clus.coef
ind$lambda <- t$PathLength/ind$cha.path
ind$SWness <- ind$gamma/ind$lambda
# 99% confidence interval
#
sLevel <- sLevel/2
qSW <- quantile(ind$SWness,c(sLevel,1-sLevel),na.rm = TRUE)
qmo <- quantile(ind$modularity,c(sLevel,1-sLevel))
mcc <- mean(ind$clus.coef)
mcp <- mean(ind$cha.path)
zcc <- (t$Clustering-mcc)/sd(ind$clus.coef)
zcp <- (t$PathLength-mcp)/sd(ind$cha.path)
qcc <- quantile(ind$clus.coef,c(sLevel,1-sLevel),na.rm = TRUE)
qcp <- quantile(ind$cha.path,c(sLevel,1-sLevel),na.rm = TRUE)
m<-cluster_spinglass(g, weights=weights)
zmo <- (m$modularity - mean(ind$modularity))/sd(ind$modularity)
mSW <- mean(t$Clustering/mcc*mcp/t$PathLength)
mCI <- 1+(qSW[2]-qSW[1])/2
isLowInsideCPL <- t$PathLength<=qcp[2]
isGreaterCC <- t$Clustering>qcc[2]
isSW <- (isLowInsideCPL & isGreaterCC)
isSWness <- (mSW>mCI)
return(list(da=data.frame(Clustering=t$Clustering, PathLength= t$PathLength, Modularity=m$modularity,
zCC=zcc,zCP=zcp,zMO=zmo,
CClow=qcc[1],CChigh=qcc[2],CPlow=qcp[1],CPhigh=qcp[2],MOlow=qmo[1],MOhigh=qmo[2],
SWness=mSW,SWnessCI=mCI,
isSW=isSW,isSWness=isSWness),sims=ind))
}
#' @export
calcModularitySWnessZScore<- function(g, nullDist,sLevel=0.01,ncores=0){
calc_modularity_swness_zscore(g, nullDist,sLevel,ncores)
}
#' Calculation Small-world-ness z-scores
#'
#' The function calculates small-world-ness z-scores and 99\% CI intervals,
#' using as null model the list of networks in the nullDist parameter.
#'
#' @references
#' Marina, T. I., Saravia, L. A., Cordone, G., Salinas, V., Doyle, S. R., & Momo, F. R. (2018). Architecture of marine food webs: To be or not be a ‘small-world.’ PLoS ONE, 13(5), 1–13. https://doi.org/10.1371/journal.pone.0198217
#'
#' @param g igraph object
#' @param nullDist list of igraph object with the null model simulations
#' @param sLevel significance level to calculate CI (two tails)
#' @param ncores number of cores to use paralell computation, if 0 sequential processing is used.
#'
#'
#' @return a list with two data frames: one with indices z-scores and CI
#'
#' \item{Clustering}{ Clustering coefficient, measures the average fraction of pairs of neighbors of a node that are also neighbors of each other}
#' \item{PathLength}{ Mean of the shortest paths between all pair of vertices }
#' \item{Modularity}{ modularity measures how separated are different groups from each other, the algorithm \code{cluster_spinglass} was used to obtain the groups}
#' \item{zCC,zCP,zMO}{Z-scores of Clustering,PathLength and Modularity with respect to a random Erdos-Renyi null model}
#' \item{CClow,CChigh,CPlow,CPhigh,MOlow,MOhigh}{sLevel confidence intervals}
#' \item{SWness,SWnessCI}{ Small-world-ness and it CI value}
#' \item{isSW,isSWness}{ Logical variable signalling if the network is Small-world by the method of Marina 2018 or the method of Humprhies & Gurney 2008 }
#'
#' Another data.frame with the values calculated for the nullDist.
#'
#' @export
#'
#' @importFrom igraph transitivity average.path.length
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
#'
#' @examples
#' \dontrun{
#' nullg <- generateERbasal(netData[[1]],10)
#' calc_swness_zscore(netData[[1]],nullg)
#' }
#'
calc_swness_zscore<- function(g, nullDist,sLevel=0.01,ncores=0,weights=NA){
if(!is_igraph(g))
stop("Parameter g must be an igraph object")
t <- calcTopologicalIndices(g)
if(length(nullDist)<5)
stop("nullDist: There has to be more than 5 elements in the list")
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
ind <- data.frame()
ind <- foreach(i=1:length(nullDist),.combine='rbind',.inorder=FALSE,.packages='igraph') %dopar%
{
clus.coef <- transitivity(nullDist[[i]], type="Global")
cha.path <- average.path.length(nullDist[[i]])
data.frame(clus.coef=clus.coef,cha.path=cha.path)
}
ind$gamma <- t$Clustering/ind$clus.coef
ind$lambda <- t$PathLength/ind$cha.path
ind$SWness <- ind$gamma/ind$lambda
# 99% confidence interval
#
sLevel <- sLevel/2
qSW <- quantile(ind$SWness,c(sLevel,1-sLevel),na.rm = TRUE)
mcc <- mean(ind$clus.coef)
mcp <- mean(ind$cha.path)
zcc <- (t$Clustering-mcc)/sd(ind$clus.coef)
zcp <- (t$PathLength-mcp)/sd(ind$cha.path)
qcc <- quantile(ind$clus.coef,c(sLevel,1-sLevel),na.rm = TRUE)
qcp <- quantile(ind$cha.path,c(sLevel,1-sLevel),na.rm = TRUE)
mSW <- mean(t$Clustering/mcc*mcp/t$PathLength)
mCI <- 1+(qSW[2]-qSW[1])/2
isLowInsideCPL <- t$PathLength<=qcp[2]
isGreaterCC <- t$Clustering>qcc[2]
isSW <- (isLowInsideCPL & isGreaterCC)
isSWness <- (mSW>mCI)
return(list(da=data.frame(Clustering=t$Clustering, PathLength= t$PathLength,
zCC=zcc,zCP=zcp,
CClow=qcc[1],CChigh=qcc[2],CPlow=qcp[1],CPhigh=qcp[2],
SWness=mSW,SWnessCI=mCI,
isSW=isSW,isSWness=isSWness),sims=ind))
}
#' Calc topological roles among network communities/modules
#'
#' Topological roles characterize species as its roles between communities or modules, we calculate the modules using
#' the [igraph::cluster_spinglass()] function.
#' Topological roles are described by two parameters: the standardized within-module degree \eqn{dz} and the among-module
#' connectivity participation coefficient \eqn{PC}. The within-module degree is a z-score that measures how well a species is
#' connected to other species within its own module compared with a random graph. The participation coefficient \eqn{PC}
#' estimates the distribution of the links of species among modules. As the community algorithm is stochastic we run it several
#' times and return the repeated runs for both parameters.
#'
#' @references
#'
#' 1. Guimerà, R. & Nunes Amaral, L.A. (2005). Functional cartography of complex metabolic networks. Nature, 433, 895–900
#'
#' 1. Kortsch, S. et al. 2015. Climate change alters the structure of arctic marine food webs due to poleward shifts of boreal generalists. - Proceedings of the Royal Society B: Biological Sciences 282: 20151546. https://doi.org/10.1098/rspb.2015.1546
#'
#' @param g an Igraph object with the network
#' @param nsim number of simulations with different community
#' @param ncores number of cores to use paralell computation, if 0 sequential processing is used.
#'
#' @return a data frame with two numeric fields: within_module_degree, among_module_conn
#'
#' @export
#'
#' @import igraph
#' @importFrom foreach foreach %dopar%
#' @importFrom doFuture registerDoFuture
#' @importFrom future sequential multiprocess
#'
#' @examples
#' #' \dontrun{
#'
#' g <- netData[[2]]
#'
#' tp <- calc_topological_roles(g,nsim=10)
#'
#' }
calc_topological_roles <- function(g,nsim=1000,ncores=0)
{
if(!is_igraph(g))
stop("Parameter g must be an igraph object")
toRol <- data.frame()
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
toRol <- foreach(idx=1:nsim,.combine='rbind',.inorder=FALSE,.packages='igraph') %dopar%
{
# within-module degree
#
# Standarized Within module degree z-score
#
m<-cluster_spinglass(g,weights = NA)
spingB.mem<- m$membership
l<-vector()
memMod<-vector()
for (i in 1:vcount(g)){
sp.in.deg <- V(g)[nei(i, "in")]
sp.out.deg<- V(g)[nei(i, "out")]
mem.sp<-spingB.mem[i]
k<- length(which(spingB.mem[c(sp.in.deg, sp.out.deg)]==mem.sp))
mem<- which(spingB.mem==mem.sp)
for (m in 1:length(mem)){
mem.in.deg <- V(g)[nei(mem[m], "in")]
mem.out.deg<- V(g)[nei(mem[m], "out")]
memMod.id<- length(which(spingB.mem[c(mem.in.deg, mem.out.deg)]==mem.sp))
memMod[m]<- memMod.id
}
k.ave<- mean(memMod)
k.sd<- sd(memMod)
l[i]<- (k-k.ave)/k.sd
}
# among module connectivity
r<- vector()
for (i in 1:vcount(g)){
d<-degree(g)[i]
sp.in.deg <- V(g)[nei(i, "in")]
sp.out.deg<- V(g)[nei(i, "out")]
mod.sp<-table(spingB.mem[c(sp.in.deg, sp.out.deg)])
mod.no<-as.numeric(names(mod.sp))
mod<-rep(0, length(unique(spingB.mem)))
mod[mod.no]<-c(mod.sp)
r[i]<- 1-(sum((mod/d)^2))
}
return(data.frame(node=1:vcount(g),within_module_degree=l, among_module_conn=r))
}
return(toRol)
}
#' Classify and plot topological roles
#'
#' We use the topological roles calculated with [calc_topological_roles()] and categorize them following the approach of
#' Kortsch (2015), that defines species roles based in two thresholds \eqn{PC=0.625} and \eqn{dz=2.5}.
#' If a species had at least 60% of links within its own module then \eqn{PC<0.625}, and if it also had \eqn{dz\ge 2.5}, thus it was
#' classified as a module hub, labeled **modhub**. If a species had \eqn{PC<0.625} and \eqn{dz<2.5}, then it was called a peripheral
#' or specialist, labeled **modspe**. Species that had \eqn{PC\ge0.625} and \eqn{dz<2.5} were considered module connectors **modcon**.
#' Finally, if a species had \eqn{PC\ge0.625} and \eqn{dz\ge 2.5}, then it was classified as a super-generalist or hub-connector **hubcon**.
#'
#' @references
#'
#'1. Kortsch, S., Primicerio, R., Fossheim, M., Dolgov, A. V & Aschan, M. (2015). Climate change alters the structure of arctic marine food webs due to poleward shifts of boreal generalists. Proc. R. Soc. B Biol. Sci., 282
#'
#' 1. Saravia, L.A., Marina, T.I., De Troch, M. & Momo, F.R. (2018). Ecological Network assembly: how the regional meta web influence local food webs. bioRxiv, 340430, doi: https://doi.org/10.1101/340430
#'
#' @param tRoles Calculated topological roles with the function [calc_topological_roles()]
#' @param g Igraph network object
#' @param spingB Igraph community object
#' @param plt logical whether a plot is generated
#'
#' @return a data.frame with the classified topological roles
#' @export
#'
#' @importFrom RColorBrewer brewer.pal
#' @importFrom dplyr %>% group_by summarise_all inner_join
#'
#' @examples
#' \dontrun{
#'
#' g <- netData[[2]]
#'
#' tp <- calc_topological_roles(g,nsim=10)
#'
#' classify_topological_roles(tp,g,plt=TRUE)
#' }
classify_topological_roles <- function(tRoles,g,spingB=NULL,plt=FALSE){
if(is.null(spingB))
spingB <- cluster_spinglass(g,weights=NA)
spingB.mem<- spingB$membership
tRoles <- tRoles %>% group_by(node) %>% summarise_all(mean)
l <- tRoles$within_module_degree
r <- tRoles$among_module_conn
# Plot
if(plt){
colbar.FG <- brewer.pal(length(spingB$csize),"Dark2")
old_par <- par(mfrow=c(1,1))
par(oma=c(2.7,1.3,0.7,1)) # change outer figure margins
par(mai=c(1,1,0.7,0.7)) # size of figure margins
yran <- range(l,na.rm = TRUE,finite=TRUE)
xran <- range(r)
plot(l~r, type="n", axes=T ,tck=F, lwd=2, ann=F, cex.axis=1.2, xlim=xran, ylim=yran)
lines(c(0.625,0.625), yran, col="grey")
lines(xran, c(2.5, 2.5), col="grey")
points(r, l, col=colbar.FG[spingB.mem], pch=20, cex=2)
mtext(2, text="Within module degree", line=4,font=2, cex=1.2)
mtext(1, text="Among module connectivity",line=4, font=2, cex=1.2)
axis(1, tck=0.02, lwd=1,las=2,lty=1, labels=F, xlim=c(0,1))
axis(2,tck=0.02, labels=FALSE)
}
# Which are the module hubs: many links within its own module.
#
modhub <- which(l>2.5)
modhub <- modhub[which(l>2.5) %in% which(r<=0.625)]
modlbl <- vertex_attr(g, "name", index=modhub)
if(is.null(modlbl))
modlbl <- modhub
hub_conn <- data.frame()
if(length(modhub)) {
if(plt) text(r[modhub],l[modhub],labels = modlbl,cex=0.7,pos=3)
hub_conn <- data.frame(type="modhub",node=modhub,name=modlbl)
}
#points(r[modhub], l[modhub], cex=4, col="blue", pch=20)
# Which are the hub connectors: high within and between-module connectivity
# and are classified super-generalists
#
modhub <- which(l>2.5)
modhub <- modhub[which(l>2.5) %in% which(r>0.625)]
modlbl <- vertex_attr(g,"name",index=modhub)
if(is.null(modlbl))
modlbl <- modhub
if(length(modhub)) {
if(plt) {
text(r[modhub],l[modhub],labels = modlbl,cex=0.7,pos=3)
par(old_par)
}
}
#points(r[modhub], l[modhub], cex=4, col="blue", pch=20)
if(length(modhub)){
hub_conn <- rbind(hub_conn, data.frame(type="hubcon",node=modhub,name=modlbl))
}
# Which are the module specialist: Few links and most of them within its own module
#
modhub <- which(l<=2.5)
modhub <- modhub[which(l<=2.5) %in% which(r<=0.625)]
modlbl <- vertex_attr(g,"name",index=modhub)
if(is.null(modlbl))
modlbl <- modhub
hub_conn <- rbind(hub_conn, data.frame(type="modspe",node=modhub,name=modlbl))
# Which are the module connectors: Few links and between modules
#
modhub <- which(l<=2.5)
modhub <- modhub[which(l<=2.5) %in% which(r>0.625)]
modlbl <- vertex_attr(g,"name", index=modhub)
if(is.null(modlbl))
modlbl <- modhub
hub_conn <- rbind(hub_conn, data.frame(type="modcon",node=modhub,name=modlbl))
hub_conn <- hub_conn %>% inner_join(tRoles)
return(hub_conn)
}
#' Calculation of Modularity for a list of igraph objects
#'
#' The function calculates modularity of the list of networks in the nullDist parameter.
#' Modularity is calculated using the [igraph::cluster_spinglass()]
#' Only works for one component networks.
#'
#'
#' @param ig list of igraph objects to calculate modularity
#' @param ncores number of cores used to compute in parallel, if 0 sequential processing is used.
#' @param weights The weights of the edges. Either a numeric vector or NULL or NA. If it is null and the input graph has a ‘weight’ edge attribute
#' then that will be used. If NULL and no such attribute is present then the edges will have equal weights.
#' Set this to NA if the graph was a ‘weight’ edge attribute, but you don't want to use it for community detection.
#'
#' @return a data.frame with the field Modularity
#'
#' @export
#'
#' @import igraph
#' @importFrom future.apply future_lapply
#' @importFrom future sequential multiprocess
#'
#'
#' @examples
#' \dontrun{
#' nullg <- generateERbasal(netData[[1]],10)
#' calc_modularity(nullg)
#' }
#'
calc_modularity <- function(ig,ncores=0,weights=NA){
if(inherits(ig,"igraph")) {
ig <- list(ig)
} else if(class(ig[[1]])!="igraph") {
stop("parameter ig must be an igraph object")
}
registerDoFuture()
if(ncores) {
cn <- future::availableCores()
if(ncores>cn)
ncores <- cn
future::plan(multiprocess, workers=ncores)
on.exit(future::plan(sequential))
} else {
future::plan(sequential)
}
df <- future_lapply(ig, function(g)
{
m<-cluster_spinglass(g,weights=weights)
modl <- m$modularity
data.frame(Modularity=modl)
}, future.seed=TRUE)
return(bind_rows(df))
}
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.