Food Web Topology and Nested Keystone Species Complexes

Capocefalo, Daniele; Pereira, Juliana; Mazza, Tommaso; Jordán, Ferenc

doi:https://doi.org/10.1155/2018/1979214

Complexity

On this page

Abstract Introduction Materials and Methods Results Discussion Data Availability Conflicts of Interest Acknowledgments Supplementary Materials References Copyright Related Articles

Research Article | Open Access

Volume 2018 | Article ID 1979214 | https://doi.org/10.1155/2018/1979214

Food Web Topology and Nested Keystone Species Complexes

Daniele Capocefalo,^1,2Juliana Pereira,³Tommaso Mazza,¹and Ferenc Jordán^3,4

Academic Editor: Sandro Azaele

Received18 Mar 2018

Revised09 Aug 2018

Accepted26 Aug 2018

Published02 Dec 2018

Abstract

Important species may be in critically central network positions in ecological interaction networks. Beyond quantifying which one is the most central species in a food web, a multinode approach can identify the key sets of the most central species as well. However, for sets of different size , these structural keystone species complexes may differ in their composition. If larger sets contain smaller sets, higher nestedness may be a proxy for predictive ecology and efficient management of ecosystems. On the contrary, lower nestedness makes the identification of keystones more complicated. Our question here is how the topology of a network can influence nestedness as an architectural constraint. Here, we study the role of keystone species complexes in 27 real food webs and quantify their nestedness. After quantifying their topology properties, we determine their keystone species complexes, calculate their nestedness, and statistically analyze the relationship between topological indices and nestedness. A better understanding of the cores of ecosystems is crucial for efficient conservation efforts, and to know which networks will have more nested keystone species complexes would be a great help for prioritizing species that could preserve the ecosystem’s structural integrity.

1. Introduction

Understanding and predicting the robustness and vulnerability of complex ecological networks is a topic of increasing relevance. There is a general agreement that nodes in certain critical network positions may have disproportionately large effects on network functioning. The loss of these key nodes may easily generate cascading effects in the network, so their management is important. These cascading interactions are hard to predict, since secondary effects depend on the particular architecture of the network. Thus, the question of how network topology influences the systemic importance of critical nodes emerges. Focusing research on these key nodes can be one way on how to tame and handle complexity [1] and assess the relative importance of species in ecological communities [2–4].

Various network centrality measures can quantify and identify important network positions [5, 6], and structural analyses [7–9] are increasingly supported by dynamical studies [10, 11]. The latter suggest that key positions may not be identified only by local indices (e.g., node degree). Instead, network measures considering the indirect neighbourhood (e.g., betweenness centrality) of nodes are needed. A number of experimental [12] and modelling [13] works support the importance of indirect effects in biological systems. There is growing interest in nonlocal, mesoscale network indices [5].

Apart from expanding the neighbourhood of focal nodes (increasing the distance for network effects), it has also been suggested that the number of local nodes may also be expanded from 1 to . The centrality of node sets has been discussed [14, 15] and applied in other fields of science (e.g., landscape ecology [16, 17]). This approach suggests that the positional importance of network nodes may not be characterized independently, one by one, but rather simultaneously. Support for the relevance of multispecies vulnerability analyses comes from both empirical (e.g., keystone species complexes [18]) and modelling (multispecies fisheries [19]) directions. Recent attempts have been made to model and determine the identity of keystone species complexes in real ecosystems by network analysis [20–22].

Although the predominant view on network robustness is focused on local and single-node analyses (i.e., degree distribution [8, 23, 24]), here, we take a nonlocal, multinode approach to the problem. In this paper, (1) we quantify the macroscopic (network-level) topological properties of 27 real food webs, (2) we calculate the centrality of their node sets, (3) we quantify the nestedness of the highest centrality sets, and (3) we study the correlation between nestedness and topological network properties. We argue that large nestedness makes the network more predictable and manageable [25], so our results may have implications to the efficiency of conservation efforts.

2. Materials and Methods

2.1. Food Webs

We used 27 food webs freely available from the NCEAS database (http://www.nceas.ucsb.edu/interactionweb). These describe various, mostly terrestrial ecosystems. For the complete species lists and more biological information, see the original source. Before the analyses, we deleted isolated nodes and small components from the networks and focused only on the giant component (this typically means the deletion of only 0–5% of the original nodes). Furthermore, nodes were recoded, so numbering starts with zero.

The food webs are coded as follows: aka a (Akatore A, pine forest, Otago, New Zealand), aka b (Akatore B, pine forest, Otago, New Zealand), ber (Berwick, pine forest, Otago, New Zealand), black (Blackrock, pasture grassland, Otago, New Zealand), broad (Broad, pasture grassland, Otago, New Zealand), cant (Canton, pasture grassland, Otago, New Zealand), carpinteria (Carpinteria salt marsh, California, USA), cat (Catlins, pine forest, Otago, New Zealand), cow1 (Coweeta1, pine forest, North Carolina, USA), cow17 (Coweeta17, pine forest, North Carolina, USA), demp au (Dempsters tussock grassland in autumn, Otago, New Zealand), demp sp (Dempsters tussock grassland in spring, Otago, New Zealand), demp su (Dempsters tussock grassland in summer, Otago, New Zealand), german (German, tussock grassland, Otago, New Zealand), healy (Healy tussock grassland, Otago, New Zealand), kyeb (Kyeburn, tussock grassland, Otago, New Zealand), lilkye (LilKyeburn, tussock grassland, Otago, New Zealand), martins (Martins, pine forest, Maine, USA), narr (Narrowdale, pine forest, Otago, New Zealand), north (NorthCol, broadleaf forest, Otago, New Zealand), powder (Powder, broadleaf forest, Otago, New Zealand), stony (Stony, tussock grassland, Otago, New Zealand), sutton au (Sutton tussock grassland in autumn, Otago, New Zealand), sutton sp (Sutton tussock grassland in spring, Otago, New Zealand), sutton su (Sutton tussock grassland in summer, Otago, New Zealand), troy (Troy, pine forest, Maine, USA), and ven (Venlaw, pine forest, Otago, New Zealand). Geographic distribution is thus quite narrow, but this does not seem to have any known effect on the results.

2.2. Network Analysis

We calculated nine global (macroscopic) topological properties for each network. The number of nodes () and the number of interactions () are trivial properties of every network. Their combination provides the connectance () (or density) of the network: where undirected interactions are considered with no self-loop. Based on individual node degree values, we can compute a macroscopic network measure, the average degree (), calculated for all nodes in the network.

The clustering coefficient () of node equals the density of the subnetwork composed of the neighbours of node . This is the probability that its two neighbours and will be directly linked to each other. It can be defined as where is the subgraph composed of the nodes that are directly linked to node , is the number of edges in this subgraph, and is the degree of node . The whole network can be characterized by the average clustering oefficient calculated for all nodes (), and this can be also weighted by the degree value of particular nodes (weighted clustering coefficient: ). The latter gives larger emphasis on clusters around more connected nodes.

The distance between two nodes and in a network () is the minimal number of links connecting them (i.e., the length of the shortest path length between and ). The whole network can be characterized by the average of shortest path lengths () and their maximum value (diameter, ). When a network is composed of more than one component, some distance values will be infinite (for nodes and belonging to different components). This makes it impossible to calculate distance-based network metrics. In these cases, the reciprocal distance between nodes and can be given as and this measure can be used also when a network consists of more than one component (since the reciprocal of infinity equals, by definition, zero). The distance-weighted fragmentation () of the network can be calculated as which is the average reciprocal distance for each pair of nodes in the network.

We selected these macroscopic network properties because they are simple, yet, they reflect several local (degree-related), mesoscale (clustering-related) and global (distance-related) properties of the networks.

2.3. Multinode Centrality

Apart from computing the centrality of individual graph nodes, one can define and quantify also the centrality of sets of nodes (see Figure 1). Multinode centrality analyses have already been performed for different types of ecological networks including food webs [26] and habitat networks [27].

Figure 1

Toy network illustrating the nonnested centrality of node sets. The number of nodes reachable from nodes , , , and in two steps () equals 11, 9, 9, and 7, respectively. Thus, node has the highest -reach centrality in the network. Yet, from the () set of nodes only 12 and from the () or () set of nodes only 13, while from the () set of nodes, 14 other nodes are reachable in two steps. Thus, the () set is more central than the other sets, based on reachability. The highest centrality node () is not a subset of the highest centrality set of two nodes ().

The most central multinode sets of to 4 nodes were identified for the 27 food webs, according to two different aspects of key player selection. First, how to best fragment (disrupt) the network by removing key nodes (the “negative” version of the key player problem; KPP-Neg) and second, how to best send a message out from nodes of the network to others (the “positive” version; KPP-Pos, see [15]). For KPP-Neg, we determined the most central node sets considering binary () and distance-weighted (FR) fragmentation centrality. For KPP-Pos, we determined the most central node sets considering binary -reach centrality (Mm) and distance-weighted (DR) reachability with , 2 and 3 steps (M1, M2, and M3, respectively). Each of the four multinode centrality measures were computed for to 4 nodes ( is clearly single-node). Multinode key sets were calculated using Pyntacle, our high-performance network analysis tool.

2.4. Nestedness

The nestedness of presence-absence ecological data [28] has a rich literature with well-developed methods ([29, 30]; for software, see [31]). The nestedness approach has also been extended to ecological interactions in binary networks [32, 33]. Here, we study the nestedness of ecological interaction networks in a very different way (see [15, 20, 25]), quantifying the set–subset relationships of central nodes in a network.

We calculated the nestedness of central node sets (i.e., the overlap among the sets of size to 4) using the Nrow metric [34]. Nrow is the average percentage of nodes from smaller sets that are contained in larger sets, taking all possible pairs of sets. For example, for the food web demp au, the M2 key player sets for to 4 nodes were {0} for , {0 2} for , {0 68 76} for , and {76 18 37 66} for . For and , there is perfect overlap. For and , there is partial overlap, since the smaller set () is a subset of the larger one (). For and , there is no overlap, since the two sets have no common elements. Averaging all the 6 overlaps, we have Nrow = 47.22, which is the nestedness value for M2 in the demp au food web (see the species identities for this food web in Discussion). The same was done for the remaining centralities (, FR, M2, M3, and DR) and for all food webs.

2.5. Statistical Analysis

We compared the 9 topological properties of the 27 food webs with their 6 nestedness metrics by Spearman correlation, because most topological properties were not normally distributed. We considered only correlations of 0.60 and above (as well as −0.60 and below). Correlations were calculated in R 3.3.0 [35].

3. Results

3.1. Network Metrics

The studied macroscopic network parameters are presented in Table 1. The smallest and the largest networks, in terms of the number of nodes, were the cat () and the carpinteria food webs (), respectively. Depending on the various actual numbers of links (), connectance ranged from (aka a, cow17, martins, narr, and troy) to (demp su). Average degree ranged from avD = 4 (aka b, cow17, and narr) to avD = 18.72 (carpinteria). Diameter ranged from (black, cow17, german, healy, and stony) to (cow1), and the average shortest path length ranged from avSPL = 2.19 (carpinteria) to avSPL = 2.9 (cow1). The average clustering coefficient ranged from avCC = 0.02 (cat, kyeb, sutton sp, and sutton su) to avCC = 0.25 (carpinteria), and the weighted clustering coefficient ranged from wCC = 0 (broad, sutton sp, and sutton su) to wCC = 0.25 (carpinteria). Finally, distance-based fragmentation ranged from DF = 0.48 (carpinteria and demp su) to DF = 0.6 (troy).

Table 1

Topological properties and nestedness of multinode centrality sets for 27 food webs. The topological properties include the number of nodes (), the number of edges (), diameter (), average degree (avD), average shortest path length (avSPL), connectance (), average clustering coefficient (avCC), weighted clustering coefficient (wCC), and distance-based fragmentation (DF). Nestedness is always calculated for sets of to 4 nodes, based on fragmentation (), distance-based fragmentation (FR), weighted reachability (DR), and binary -reach for (M1), 2 (M2), and 3 (M3) steps.

3.2. Nestedness

Our question was if topology has any significant effect on the nestedness of keystone species complexes in the studied 27 food webs. Between 9 topological properties and 6 nestedness metrics for each food web, we analysed 54 correlations. Only 4 of them were significant (shown in Figure 2), and in each of these M2 was the nestedness index (, FR, DR, M1, and M3 did not show any significant correlation). M2 correlated positively with DF and avSPL and negatively with and avD (, , , avCC, and wCC did not show any significant correlation).

(a)

(b)

(c)

(d)

The four significant correlations are between M2 and DF (rho = 0.681; ), M2 and (rho = −0.678; ), M2 and avD (rho = −0.637; ), and M2 and avSPL (rho = 0.605; ). All of them are strongly significant.

Only a few topological features can be used as a proxy for assessing the nestedness of central node sets, but most of these show quite strong correlations. Our results suggest that in networks where shortest paths are shorter and density is higher, nestedness is lower, so systems-based conservation can be less predictive and efficient. One example is the Sutton tussock grassland in springtime (Figure 3(a), Supplementary Material (available here)). Here, the single most central organism in the network is unidentifiable detritus (#0, black in Figure 3(a)). The most central pair is the diatom Cocconeis sp. and the larvae of the riffle beetle Hydora nitida (#10 and #61, blue). The group of the three most central network positions is the red alga Audouinella sp., the diatom Navicula avenacea, and the caddisfly Pycnocentrodes spp. (#9, #30, and #70, red). The four most central organisms are the alga Epithemia zebra, the diatom Eunotia spp., the fishfly Archicauliodes diversus, and Chironomid type “Diamesid blond” (#18, #19, #49, and #52, orange). Hence, the increasing core of key organisms is perfectly unnested (M2 = 0, up to 4 groups). Accordingly, DF is low (0.51), is high (0.14), avD is high (10.49), and avSPL is small (2.39). Apart from the single-node core (), the larger cores () are always composed of both plants (e.g., diatoms) and animals (e.g., caddisfly).

(a)

(b)

On the contrary, in less connected and less compact networks, nestedness is higher, so a multispecies view fairly reinforce the results of single-species analyses. One example is the Dempsters tussock grassland in autumn (Figure 3(b), Supplementary Material). Here, the single most central organism in the network is unidentifiable detritus (#0, black). The most central pair is unidentifiable detritus and terrestrial invertebrates (#2, blue). The group of the three most central network positions is unidentifiable detritus, and the caddisflies Olinga feredayi, and Tiphobiosis sp. (#68 in orange and #76 in red). The four most central organisms are Tiphobiosis sp., alga Epithemia zebra (#18, yellow), another alga Spirogyra sp. (#37, yellow), and a mayfly Nesameletus ornatus (#66 yellow). Here, the composition of the core is a little bit more nested (M2 = 47.22) and, accordingly, DF is somewhat higher (0.53), is lower (0.12), avD is a little lower (9.88), and avSPL is longer (2.47).

Supplementary Material show the nestedness patterns for each food web. The numbers are the codes for species, and these are generally not comparable for different networks. However, node #0 is almost always unidentifiable detritus (or some similarly large aggregated group, e.g., terrestrial invertebrate remains). In many networks, this is part of the key player complexes. Biologically speaking, this is an artefact: the detritus is clearly a well-connected component of food webs. Only other species in the key player complexes can be biologically interpreted. It is also noted that Unidentifiable detritus, even if it is frequently the key group for , is frequently missing from larger key player sets (e.g., for in the demp au food web). So, even if it dominates the network structure in itself, its position is not significant anymore if we think in terms of a larger network core.

Apart from the large aggregated groups typically being in the centre of the network, the four organisms that can be in the key position also in single-species cores () are the diatom Fragilaria vaucheriae (#19 in the broad food web), the shore crab Hemigrapsus oregonensis (#45 in the carpinteria food web), the mayfly Deleatidium spp. (#34 in the north food web), and the diatom Rhoicosphenia curvata (#16 in the powder food web). Hemigrapsus appears in all of the four studied key player sets in the carpinteria food web (, 2, 3, 4).

Some communities are described by several versions of the food web (e.g., seasonal versions like demp au, demp sp, and demp su). In some cases, these versions differ a lot in nestedness (demp and sutton), while in other cases, there is only a small difference between the versions (aka and cow).

4. Discussion

The dynamical behaviour of complex ecological systems can be dominated by a few critically important components. Finding these could dramatically increase our understanding, the predictability of models, and the efficiency of management efforts. We studied a comparable set of empirical food webs and identified the structurally most important nodes in them. Whether these small sets were nested was correlated to some topological properties of these networks.

Network features influencing nestedness can be regarded as topological constraints on the predictability and efficiency of management and systems-based conservation. It remains unclear to us how M2 and M3 can be negatively and positively correlated with avD, respectively.

We need to much better understand the biology of the key groups and the ecology of nested vs. nonnested communities. If certain groups (e.g., zooplankton and diatoms) appear frequently in the core of food webs, these can be thought to be real keystone species. This is especially important if the core is nested: this means that the particular community is really dominated by a single species. We still know nothing about the kinds of communities (or the set of abiotic factors) that can be associated with nested patterns. Biologically speaking, this is the most promising future research line.

All of our results are based on a set of 27 empirical food webs in the size range between 48 and 128 trophic groups. This is the typical size scale for food webs in the literature. All the webs were described by the same methodological standards, so they are comparable to each other. In order to see if these results are generalizable, research is needed in at least two directions.

First, one wants to see if topological properties scale with network size. For this, much larger networks should be studied—and the topological properties studied here can be more and more relevant and interesting for larger graphs. The limitation here is that empirical networks are not larger. Much larger networks () could be constructed by dramatically increasing the resolution of trophic groups (e.g., by adding bacteria and replacing trophic groups by biological species), but these networks would not be biologically comparable to the present ones (even if being mathematically more interesting).

Second, the toy network of the same size range can be generated by various algorithms (already in progress), and empirical topologies could be compared to the theoretical distributions. This kind of randomization analysis is fairly straightforward in community ecology; however, it is not easy to see which generative algorithms give the most realistic results (e.g., [36] but see [37]). These studies could reveal if the reported relationships are universal properties of networks in general, or they are specific to only food webs for some biological (ecological) reasons (Capocefalo et al. unpublished). If the results are food web-specific, we need to understand the biological reasons. If the results will be shown to be of general nature, conclusions can be drawn also in other fields of research. For example, terrorist networks have been shown to have large average shortest paths and low density [38], properties suggesting that their efficient “management” is possible—in a security and defence sense.

This paper is of mostly conceptual and methodological nature. We suggest that the search for the cores of ecosystem networks opens several research lines that could massively contribute to systems-based conservation biology and management, with applications ranging from marine fisheries to pollination systems.

Data Availability

Data are available at the personal website of the corresponding author: https://ferencjordan.webnode.hu/.

Conflicts of Interest

The authors declare no conflict of interest.

Funding

FJ was funded by the grant GINOP-2.3.2-15-2016-00057. FJ and JP were funded by the grant OTKA K 116071.

Acknowledgments

We are grateful to Zsófia Benedek and Marco Scotti for earlier discussions.

Supplementary Materials

Supplementary Material: the M2 nestedness values for each network (-reach for 2 steps) and the identity of nodes for key player sets (of different sizes ) are presented. (Supplementary Materials)

References

F. Jordán, “Keystone species and food webs,” Philosophical Transactions of the Royal Society B: Biological Sciences, vol. 364, no. 1524, pp. 1733–1741, 2009.
View at: Publisher Site | Google Scholar
L. S. Mills and D. F. Doak, “The keystone-species concept in ecology and conservation: management and policy must explicitly consider the complexity of interactions in natural systems,” BioScience, vol. 43, no. 4, pp. 219–224, 1993.
View at: Publisher Site | Google Scholar
R. T. Paine, “A note on trophic complexity and community stability,” The American Naturalist, vol. 103, no. 929, pp. 91–93, 1969.
View at: Publisher Site | Google Scholar
M. E. Power, D. Tilman, J. A. Estes et al., “Challenges in the quest for keystones: identifying keystone species is difficult—but essential to understanding how loss of species will affect ecosystems,” BioScience, vol. 46, no. 8, pp. 609–620, 1996.
View at: Publisher Site | Google Scholar
E. Estrada, “Characterization of topological keystone species: local, global and “meso-scale” centralities in food webs,” Ecological Complexity, vol. 4, no. 1-2, pp. 48–57, 2007.
View at: Publisher Site | Google Scholar
F. Jordán and I. Scheuring, “Network ecology: topological constraints on ecosystem dynamics,” Physics of Life Reviews, vol. 1, no. 3, pp. 139–172, 2004.
View at: Publisher Site | Google Scholar
S. Allesina and A. Bodini, “Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions,” Journal of Theoretical Biology, vol. 230, no. 3, pp. 351–358, 2004.
View at: Publisher Site | Google Scholar
J. A. Dunne, R. J. Williams, and N. D. Martinez, “Network structure and biodiversity loss in food webs: robustness increases with connectance,” Ecology Letters, vol. 5, no. 4, pp. 558–567, 2002.
View at: Publisher Site | Google Scholar
F. Jordan, A. Takacs-Santa, and I. Molnar, “A reliability theoretical quest for keystones,” Oikos, vol. 86, no. 3, pp. 453–462, 1999.
View at: Publisher Site | Google Scholar
F. Jordán, T. A. Okey, B. Bauer, and S. Libralato, “Identifying important species: linking structure and function in ecological networks,” Ecological Modelling, vol. 216, no. 1, pp. 75–80, 2008.
View at: Publisher Site | Google Scholar
C. M. Livi, F. Jordán, P. Lecca, and T. A. Okey, “Identifying key species in ecosystems with stochastic sensitivity analysis,” Ecological Modelling, vol. 222, no. 14, pp. 2542–2551, 2011.
View at: Publisher Site | Google Scholar
B. A. Menge, “Indirect effects in marine rocky intertidal interaction webs: patterns and importance,” Ecological Monographs, vol. 65, no. 1, pp. 21–74, 1995.
View at: Publisher Site | Google Scholar
U. Brose, E. L. Berlow, and N. D. Martinez, “Scaling up keystone effects from simple to complex ecological networks,” Ecology Letters, vol. 8, no. 12, pp. 1317–1325, 2005.
View at: Publisher Site | Google Scholar
S. P. Borgatti, M. G. Everett, and L. C. Freeman, Ucinet for Windows: Software for Social Network Analysis, Analytic Technologies, Nicholasville, KY, USA, 2002.
S. P. Borgatti, “Identifying sets of key players in a social network,” Computational & Mathematical Organization Theory, vol. 12, no. 1, pp. 21–34, 2006.
View at: Publisher Site | Google Scholar
J. Pereira and F. Jordán, “Multi-node selection of patches for protecting habitat connectivity: fragmentation versus reachability,” Ecological Indicators, vol. 81, pp. 192–200, 2017.
View at: Publisher Site | Google Scholar
J. Pereira, S. Saura, and F. Jordán, “Single-node vs. multi-node centrality in landscape graph analysis: key habitat patches and their protection for 20 bird species in NE Spain,” Methods in Ecology and Evolution, vol. 8, no. 11, pp. 1458–1467, 2017.
View at: Publisher Site | Google Scholar
G. C. Daily, P. R. Ehrlich, and N. M. Haddad, “Double keystone bird in a keystone species complex,” Proceedings of the National Academy of Sciences of the United States of America, vol. 90, no. 2, pp. 592–594, 1993.
View at: Publisher Site | Google Scholar
R. M. May, J. R. Beddington, C. W. Clark, S. J. Holt, and R. M. Laws, “Management of multispecies fisheries,” Science, vol. 205, no. 4403, pp. 267–277, 1979.
View at: Publisher Site | Google Scholar
M. Ortiz, R. Levins, L. Campos et al., “Identifying keystone trophic groups in benthic ecosystems: implications for fisheries management,” Ecological Indicators, vol. 25, pp. 133–140, 2013.
View at: Publisher Site | Google Scholar
M. Ortiz, F. Rodriguez-Zaragoza, B. Hermosillo-Nuñez, and F. Jordán, “Control strategy scenarios for the alien lionfish Pterois volitans in Chinchorro Bank (Mexican Caribbean): based on semi-quantitative loop analysis,” PLoS One, vol. 10, no. 6, article e0130261, 2015.
View at: Publisher Site | Google Scholar
M. Ortiz, B. Hermosillo-Nuñez, J. González, F. Rodríguez-Zaragoza, I. Gómez, and F. Jordán, “Quantifying keystone species complexes: ecosystem-based conservation management in the King George Island (Antarctic Peninsula),” Ecological Indicators, vol. 81, pp. 453–460, 2017.
View at: Publisher Site | Google Scholar
R. Albert, H. Jeong, and A. L. Barabasi, “Error and attack tolerance of complex networks,” Nature, vol. 406, no. 6794, pp. 378–382, 2000.
View at: Publisher Site | Google Scholar
H. Jeong, S. P. Mason, A. L. Barabási, and Z. N. Oltvai, “Lethality and centrality in protein networks,” Nature, vol. 411, no. 6833, pp. 41-42, 2001.
View at: Publisher Site | Google Scholar
Z. Benedek, F. Jordán, and A. Báldi, “Topological keystone species complexes in ecological interaction networks,” Community Ecology, vol. 8, no. 1, pp. 1–7, 2007.
View at: Publisher Site | Google Scholar
J. González, M. Ortiz, F. Rodríguez-Zaragoza, and R. E. Ulanowicz, “Assessment of long-term changes of ecosystem indexes in Tongoy Bay (SE Pacific coast): based on trophic network analysis,” Ecological Indicators, vol. 69, pp. 390–399, 2016.
View at: Publisher Site | Google Scholar
L. Rubio, Ö. Bodin, L. Brotons, and S. Saura, “Connectivity conservation priorities for individual patches evaluated in the present landscape: how durable and effective are they in the long term?” Ecography, vol. 38, no. 8, pp. 782–791, 2015.
View at: Publisher Site | Google Scholar
J. Podani and D. Schmera, “A new conceptual and methodological framework for exploring and explaining pattern in presence–absence data,” Oikos, vol. 120, no. 11, pp. 1625–1638, 2011.
View at: Publisher Site | Google Scholar
W. Atmar and B. D. Patterson, The Nestedness Temperature Calculator: A Visual Basic Programme, Including 294 Presence-Absence Matrices, AICS Research, University Park, NM, and The Field Museum, Chicago, IL, USA, 1995.
J. Podani, C. Ricotta, and D. Schmera, “A general framework for analyzing beta diversity, nestedness and related community-level phenomena based on abundance data,” Ecological Complexity, vol. 15, pp. 52–61, 2013.
View at: Publisher Site | Google Scholar
W. An and Y. Liu, “Keyplayer: locating key players in social networks. R package version 1.0.3,” May 2016, https://CRAN.R-project.org/package=keyplayer.
View at: Google Scholar
M. A. Fortuna, D. B. Stouffer, J. M. Olesen et al., “Nestedness versus modularity in ecological networks: two sides of the same coin?” Journal of Animal Ecology, vol. 79, no. 4, pp. 811–817, 2010.
View at: Publisher Site | Google Scholar
J. Podani, F. Jordán, and D. Schmera, “A new approach to exploring architecture of bipartite (interaction) ecological networks,” Journal of Complex Networks, vol. 2, no. 2, pp. 168–186, 2014.
View at: Publisher Site | Google Scholar
M. Almeida-Neto, P. Guimarães, P. R. Guimarães Jr., R. D. Loyola, and W. Ulrich, “A consistent metric for nestedness analysis in ecological systems: reconciling concept and measurement,” Oikos, vol. 117, no. 8, pp. 1227–1239, 2008.
View at: Publisher Site | Google Scholar
R Core Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2016, https://www.R-project.org/.
R. J. Williams and N. D. Martinez, “Simple rules yield complex food webs,” Nature, vol. 404, no. 6774, pp. 180–183, 2000.
View at: Publisher Site | Google Scholar
J. W. Fox, “Current food web models cannot explain the overall topological structure of observed food webs,” Oikos, vol. 115, no. 1, pp. 97–109, 2006.
View at: Publisher Site | Google Scholar
V. E. Krebs, “Mapping networks of terrorist cells,” Connections, vol. 24, no. 3, pp. 43–52, 2001.
View at: Google Scholar

Copyright

Copyright © 2018 Daniele Capocefalo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

2246

Downloads

1415

Citations