Trophic Coherence

Trophic coherence is a property of directed graphs (or directed networks). It is based on the concept of trophic levels used mainly in ecology, but which can be defined for directed networks in general and provides a measure of hierarchical structure among nodes. Trophic coherence is the tendency of nodes to fall into well-defined trophic levels. It has been related to several structural and dynamical properties of directed networks, including the prevalence of cycles and network motifs, ecological stability, intervality, and spreading processes like epidemics and neuronal avalanches.

Definition

Consider a directed network defined by
the $N\times N$ adjacency matrix $A=(a_)$.
Each node $i$ can be assigned a trophic level $s_i$ according to
::$s_i=1+\frac\sum_j a_ s_j,$
where $k_i^\text=\sum_j a_$ is $i$'s in-degree, and nodes
with $k_i^\text=0$ (basal nodes) have $s_i=1$ by convention.
Each edge has a ''trophic difference'' associated, defined as $x_=s_i-s_j$.
The ''trophic coherence'' of the network is a measure of how tightly peaked the distribution of trophic distances,
$p(x)$,
is around its mean value, which is always $\langle x\rangle =1$.
This can be captured by an ''incoherence parameter'' $q$,
equal to the standard deviation of $p(x)$:
::$q=\sqrt,$
where $L=\sum_a_$ is the number of edges in the network.

The figure shows two networks which differ in their trophic coherence. The position of the nodes on the vertical axis corresponds to their trophic level. In the network on the left, nodes fall into distinct (integer) trophic levels, so the network is maximally coherent $(q=0)$.
In the one on the right, many of the nodes have fractional trophic levels, and the network is more incoherent $(q=0.49)$.

Trophic coherence in nature

The degree to which empirical networks are trophically coherent (or incoherent) can be investigated by comparison with a null model.
This is provided by the ''basal ensemble'', which comprises networks in which all non-basal nodes have the same proportion of basal nodes
for in-neighbours. Expected values in this ensemble converge to those of the widely used ''configuration ensemble'' in the limit $N\rightarrow\infty$, $L/N\rightarrow\infty$ (with $N$ and $L$ the numbers of nodes and edges),
and can be shown numerically to be a good approximation for finite random networks. The basal ensemble expectation for the incoherence parameter is
::$\tilde=\sqrt,$
where $L_B$ is the number of edges connected to basal nodes.
The ratio $q/\tilde$ measured in empirical networks reveals whether they are more or less coherent than the random expectation.
For instance, Johnson and Jones find in a set of networks that food webs are significantly coherent $(q/\tilde=0.44 \pm 0.17)$, metabolic networks are significantly incoherent $(q/\tilde=1.81 \pm 0.11)$, and gene regulatory networks are close to the random expectation $(q/\tilde=0.99 \pm 0.05)$.

Trophic levels and node function

There is as yet little understanding of the mechanisms which might lead to particular kinds of networks becoming significantly
coherent or incoherent. However, in systems which present correlations between trophic level and other features of nodes,
processes which tended to favour the creation of edges between nodes with particular characteristics could induce coherence or incoherence.
In the case of food webs, predators tend to specialise on consuming prey with certain biological properties (such as size, speed or behaviour)
which correlate with their diet, and hence with trophic level.
This has been suggested as the reason for food-web coherence. However, food-web models based on a ''niche axis'' do not reproduce realistic trophic coherence, which may mean either that this explanation is insufficient, or that several niche dimensions need to be considered.

The relation between trophic level and node function can be seen in networks other than food webs. The figure shows a word adjacency network derived from the book '' Green Eggs and Ham'', by Dr. Seuss. The height of nodes represents their trophic levels (according here to the edge direction which is the opposite of that suggested by the arrows, which indicate the order in which words are concatenated in sentences). The syntactic function of words is also shown with node colour. There is a clear relationship between syntactic function and trophic level: the mean trophic level of common nouns (blue) is $s_ = 1.4 \pm 1.2$, whereas that of verbs (red) is $s_ = 7.0 \pm 2.7$.
This example illustrates how trophic coherence or incoherence might emerge from node function, and also that the trophic structure of networks provides a means of identifying node function in certain systems.

Generating trophically coherent networks

There are various ways of generating directed networks with specified trophic coherence, all based on gradually introducing new edges
to the system in such a way that the probability of each new candidate edge being accepted depends on the expected trophic difference it would have.

The ''preferential preying model'' is an evolving network model similar to the Barábasi-Albert model of preferential attachment, but inspired on an ecosystem that grows through immigration of new species.
One begins with $B$ basal nodes and proceeds to introduce new nodes up to a total of $N$.
Each new node $i$ is assigned a first in-neighbour $j$ (a prey species in the food-web context) and a new
edge is placed from $j$ to $i$. The new node is given a temporary trophic level $s_i^t=s_j+1$.
Then a further $\kappa_i$ new in-neighbours $l$ are chosen for $i$ from among those in the network according to their trophic levels. Specifically, for a new candidate in-neighbour $l$, the probability of being chosen is a function of
$x_^t=s_i^t-s_l$. Johnson ''et al'' use
::$P_\propto \exp\left(-\frac\right),$
where $T$ is a parameter which tunes the trophic coherence: for $T=0$ maximally coherent networks are generated, and
$q$ increases monotonically with $T$ for $T>0$.
The choice of $\kappa_i$ is arbitrary. One possibility is to
set to $\kappa_i=z_i n_i$,
where $n_i$ is the number of nodes already in the network when $i$ arrives, and $z_i$ is a random variable drawn from a Beta distribution
with parameters $\alpha=1$ and
::$\beta=\frac-1$
($L_d$ being the desired number of edges).
This way, the ''generalised cascade model'' is recovered in the limit $T\rightarrow \infty$, and the degree distributions are as in the ''niche model'' and ''generalised niche model''.
This algorithm, as described above, generates networks with no cycles (except for self-cycles, if the new node $i$ is itself considered among its candidate in-neighbours $l$). In order for cycles of all lengths to be a possible, one can consider new candidate edges in which the new node $i$ is the in-neighbour as well as those in which it would be the out-neighbour. The probability of acceptance of these edges,
$P_$, then depends on $x_^t=s_l-s_i^t$.

The ''generalised preferential preying model'' is similar to the one described above, but has certain advantages. In particular, it is more analytically tractable, and one can generate networks with a precise number of edges $L$.
The network begins with $B$ basal nodes, and then a further $N-B$ new nodes are added in the following way. When each enters the system, it is assigned a single in-neighbour randomly from among those already there. Every node then has an integer temporary trophic level
$s_i^t$. The remaining $L-N+B$ edges are introduced as follows. Each pair of nodes $(i,j)$ has two temporary trophic distances associated, $x_^t=s_i^t-s_j^t$ and $x_^t=s_j^t-s_i^t$. Each of these candidate edges is accepted with a probability that depends on this temporary distance. Klaise and Johnson use
::$P_\propto \exp\left(-\frac\right),$
because they find the distribution of trophic distances in several kinds of networks to be approximately normal, and this choice leads to a range of the parameter $T$ in which $q \simeq T$. Once all the edges have been introduced, one must recalculate the trophic levels of all nodes, since these will differ from the temporary ones originally assigned unless $T \simeq 0$.
As with the preferential preying model, the average incoherence parameter $q$ of the resulting networks is a monotonically increasing function of $T$ for $T \geq 0$. The figure above shows two networks with different trophic coherence generated with this algorithm.

References

{{Reflist

External links

Why don't large ecosystems just collapse?



Trophic Coherence Could Help Solve the Mystery of Coexistence within Complex Ecosystems


* ttps://www.samuel-johnson.org/ Samuel Johnson's website
Nick Jones's website


Ecology
Directed graphs
Graph theory