Janis Klaise
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Janis Klaise has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Samuel Johnson
School of Mathematics, University of Birmingham, Birmingham, UK
4 shared publications - Arnaud Van Looveren
Seldon Technologies
1 shared publication Samuel Johnson
Centre for Complexity Science University of Warwick CV4 7AL Coventry United Kingdom
1 shared publication
Latest Publications
- Top Cited Papers
- 10 September 2021
- Published by Springer Nature
- p. 650-665
Interpretable Counterfactual Explanations Guided by Prototypes
- 10 September 2021
- Published by Springer Nature
- p. 650-665
Top Cited PapersInterpretable Counterfactual Explanations Guided by Prototypes
- 3 January 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 97 (1) , 012302
Relaxation dynamics of maximally clustered networks
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős-Rényi phenomenology.
- 3 January 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 97 (1) , 012302
Relaxation dynamics of maximally clustered networks
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős-Rényi phenomenology.
- Open Access
- 23 November 2017
- Published by Springer Nature in Scientific Reports
- Vol. 7 (1) , 1-11
The origin of motif families in food webs
Food webs have been found to exhibit remarkable “motif profiles”, patterns in the relative prevalences of all possible three-species subgraphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks—trophic coherence. We find that trophic coherence is also a good predictor for the extent of omnivory, defined as the tendency of species to feed on multiple trophic levels. We compare our results to a network assembly model that admits tunable trophic coherence via a single free parameter. The model is able to generate food webs in either of the two families by varying this parameter, and correctly classifies almost all the food webs in our database. This is in contrast with the two most popular food web models, the generalized cascade and niche models, which can only generate food webs within a single motif family. Our findings suggest the importance of trophic coherence in modelling local preying patterns in food webs.
- 23 November 2017
- Published by Springer Nature in Scientific Reports
- Vol. 7 (1) , 1-11
Open AccessThe origin of motif families in food webs
Food webs have been found to exhibit remarkable “motif profiles”, patterns in the relative prevalences of all possible three-species subgraphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks—trophic coherence. We find that trophic coherence is also a good predictor for the extent of omnivory, defined as the tendency of species to feed on multiple trophic levels. We compare our results to a network assembly model that admits tunable trophic coherence via a single free parameter. The model is able to generate food webs in either of the two families by varying this parameter, and correctly classifies almost all the food webs in our database. This is in contrast with the two most popular food web models, the generalized cascade and niche models, which can only generate food webs within a single motif family. Our findings suggest the importance of trophic coherence in modelling local preying patterns in food webs.
- Open Access
Relaxation dynamics of maximally clustered networks
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erd\H{o}s--R\'enyi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erd\H{o}s--R\'enyi phenomenology.
Open AccessRelaxation dynamics of maximally clustered networks
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erd\H{o}s--R\'enyi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erd\H{o}s--R\'enyi phenomenology.
- Open Access
The Origin of Motif Families in Food Webs
Food webs have been found to exhibit remarkable motif profiles, patterns in the relative prevalences of all possible three-species sub-graphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks - trophic coherence. We find that trophic coherence is also a good predictor for the extent of omnivory, defined as the tendency of species to feed on multiple trophic levels. We compare our results to a network assembly model that admits tunable trophic coherence via a single free parameter. The model is able to generate food webs in either of the two families by varying this parameter, and correctly classifies almost all the food webs in our database. This establishes a link between global order and local preying patterns in food webs.
Open AccessThe Origin of Motif Families in Food Webs
Food webs have been found to exhibit remarkable motif profiles, patterns in the relative prevalences of all possible three-species sub-graphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks - trophic coherence. We find that trophic coherence is also a good predictor for the extent of omnivory, defined as the tendency of species to feed on multiple trophic levels. We compare our results to a network assembly model that admits tunable trophic coherence via a single free parameter. The model is able to generate food webs in either of the two families by varying this parameter, and correctly classifies almost all the food webs in our database. This establishes a link between global order and local preying patterns in food webs.
- 1 June 2016
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 26 (6) , 065310
From neurons to epidemics: How trophic coherence affects spreading processes
Trophic coherence, a measure of the extent to which the nodes of a directed network are organised in levels, has recently been shown to be closely related to many structural and dynamical aspects of complex systems, including graph eigenspectra, the prevalence or absence of feedback cycles, and linear stability. Furthermore, non-trivial trophic structures have been observed in networks of neurons, species, genes, metabolites, cellular signalling, concatenated words, P2P users, and world trade. Here, we consider two simple yet apparently quite different dynamical models—one a susceptible-infected-susceptible epidemic model adapted to include complex contagion and the other an Amari-Hopfield neural network—and show that in both cases the related spreading processes are modulated in similar ways by the trophic coherence of the underlying networks. To do this, we propose a network assembly model which can generate structures with tunable trophic coherence, limiting in either perfectly stratified networks or random graphs. We find that trophic coherence can exert a qualitative change in spreading behaviour, determining whether a pulse of activity will percolate through the entire network or remain confined to a subset of nodes, and whether such activity will quickly die out or endure indefinitely. These results could be important for our understanding of phenomena such as epidemics, rumours, shocks to ecosystems, neuronal avalanches, and many other spreading processes.
- 1 June 2016
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 26 (6) , 065310
From neurons to epidemics: How trophic coherence affects spreading processes
Trophic coherence, a measure of the extent to which the nodes of a directed network are organised in levels, has recently been shown to be closely related to many structural and dynamical aspects of complex systems, including graph eigenspectra, the prevalence or absence of feedback cycles, and linear stability. Furthermore, non-trivial trophic structures have been observed in networks of neurons, species, genes, metabolites, cellular signalling, concatenated words, P2P users, and world trade. Here, we consider two simple yet apparently quite different dynamical models—one a susceptible-infected-susceptible epidemic model adapted to include complex contagion and the other an Amari-Hopfield neural network—and show that in both cases the related spreading processes are modulated in similar ways by the trophic coherence of the underlying networks. To do this, we propose a network assembly model which can generate structures with tunable trophic coherence, limiting in either perfectly stratified networks or random graphs. We find that trophic coherence can exert a qualitative change in spreading behaviour, determining whether a pulse of activity will percolate through the entire network or remain confined to a subset of nodes, and whether such activity will quickly die out or endure indefinitely. These results could be important for our understanding of phenomena such as epidemics, rumours, shocks to ecosystems, neuronal avalanches, and many other spreading processes.