Ecological networks are variable both in time and space [@Poisot2015SpeWhy;
@Trojelsgaard2016EcoNet] - this variability motivated the emergence of
methodology to compare ecological networks, including in a way that meshes with
the core concept for the comparison of ecological communities, namely
@Poisot2012DisSpe and @Canard2014EmpEva have suggested an approach to
This approach has been widely adopted since its publication, with recent examples using it to understand the effect of fire on pollination systems [@Baronio2021NatFir]; the impact of rewiring on spatio-temporal network dynamics [@Campos-Moreno2021ImpInt]; the effects of farming on rural and urban landscapes on species interactions [@Olsson2021IntPla]; the impact of environment gradients on multi-trophic metacommunities [@Ohlmann2018MapImp]; and as a tool to estimate the sampling completeness of networks [@Souza2021PlaSam]. It has, similarly, received a number of extensions, including the ability to account for interaction strength [@Magrach2017PlaNet], the ability to handle probabilistic ecological networks [@Poisot2016StrPro], and the integration into the Local Contribution to Beta Diversity [@Legendre2013BetDiv] approach to understand how environment changes drive network dissimilarity [@Poisot2017HosPar].
Yet, the precise meaning of
Furthermore, much like the definition of
Here, I present a mathematical analysis of the @Poisot2012DisSpe method, explain
how information about species turnover and link rewiring can be extracted from
its decomposition, and conduct numerical experiments to guide the interpretation
of the
The approach to quantifying the difference between pairs of networks established
in @Poisot2012DisSpe is a simple extension of the overall method by
@Koleff2003MeaBet for species dissimilarity based on presence-absence data. The
objects to compare,
Applying this framework to networks requires a few additional definitions.
Although ecologists tend to think of networks as their adjacency matrix (as is
presented in @fig:conceptual), this representation is not optimal to reach a
robust understanding of which elements should be counted as part of which set
when measuring network dissimilarity. For this reason, we need fall back on the
definition of a graph as a pair of sets, wherein
In the context of networks comparison (assuming the networks to compare are
and
where
The metaweb [@Dunne2006NetStr], which is to say the entire regional species pool
and their interaction, can be defined as
This operation gives us an equivalent to
We can similarly define the intersection (also commutative) of two networks:
The decomposition of
Component | |||
---|---|---|---|
It is fundamental to note that these components can be measured entirely from the interactions, and that the number of species in either network are never directly involved.
In the following sections, I present a series of calculations aimed at
expressing the values of Symbolics.jl
[@Gowda2021HigSym], and subsequently transformed
in executable code for Julia [@Bezanson2017JulFre], used to produce the
figures.
The difference between
Based on a partition between three sets of cardinality
Note that this measure is written as
There are two important points to note here. First, as mentionned earlier, the
number or proportion of species that are shared is not involved in the
calculation. Second, the connectance of either network is not involved in the
calculation. That all links counted in e.g.
The final component of network dissimilarity in @Poisot2012DisSpe is
Using the
and
Note that
We can get an expression for
Note that this value varies in a non-monotonic way with regards to the number of
interactions that are part of the common set of species -- this is obvious when
developing the denominator into
which reduces to
The roots of this expression are
As the decomposition of beta diversity into sets presented above reveals, the
value of the components
In order to simplify the calculations, I make the assumptions that the networks
have equal species richness (noted
The value of
With the values of
This is a first noteworthy result: the value of
Similarly, we can write
The overall dissimilarity responds to
Expressing
It is worth examining this solution in some detail.
The results presented in @fig:turnrew include the strong assumption that the two
networks have equal connectance. Although the range of connectances in nature
tends to be very strongly conserved within a system, we can relax this
assumption, by letting one network have more interactions than the other. Note
that for the sake of notation simplicity, I maintain the constraint that the two
networks are equally species rich. Therefore, the sole variation in this
numerical experiment is that one network has
The maximal number of links that can be shared is
As in the previous section, we can use these values to write
and
The values of these components are visualized in @fig:connectance. The
introduction of the connectance ratio makes these expressions marginally more
complex than in the case without differences in connectance, but the noteworthy
result remains that in the presence of differences of connectance, the value of
which gives the probability of rewiring as
One of the arguments put forth in a recent paper by @Frund2021DisSpe is that the
decomposition outlined above will overestimate the effect of rewiring; I argue
that this is based on a misunderstanding of what
We can re-calculate the illustration of @Frund2021DisSpe, wherein a pair of
networks with two shared interactions (
2 | 0 | 0 | 0 | 0 | 0 | |
2 | 1 | 0 | 0 | 0 | ||
2 | 0 | 1 | 0 | 0 | ||
2 | 1 | 1 |
The over-estimation argument hinges on the fact that
Based on the arguments presented above, I do not think the suggestion of
@Frund2021DisSpe to change the denominator of
Therefore the argument of @Frund2021DisSpe, whereby the
In this numerical experiment, we reproduce the results in @fig:turnrew, but
using the alternative normalization described above. The results are presented
in @fig:commden. Producing the analytical solutions for the various components,
following the expressions for
Based on the numerical experiments and the derivations presented in this paper,
we can establish a number of recommendations for the measurement and analysis of
network dissimilarity. First,
Conflict of interest disclosure: the authors of this article declare that they have no financial conflict of interest with the content of this article; TP is one of the PCIEcology recommenders.