arXiv subjects

Konstantin Klemm

Publications and source records attributed to Konstantin Klemm.

At least 19 recordsLinked to original sources

arXiv2024

Inferring Leader-Follower Behavior from Presence Data in the Marine Environment: A Case Study on Reef Manta Rays

Social interactions are fundamental in animal groups, including humans, and can take various forms, such as competition, cooperation, or kinship. Understanding these interactions in marine environments has been historically challenging due to data collection difficulties. However, advancements in acoustic telemetry now enable remote analysis of such behaviors. This study proposes a method to derive leader-follower networks from presence data collected by a single acoustic receiver at a specific location. Using the Kolmogorov-Smirnov distance, the method analyzes lag times between consecutive presences of individuals to infer directed relationships. Tested on simulated data, it was then applied to detection data from acoustically tagged reef manta rays (\textit{Mobula~alfredi}) frequenting a known site. Results revealed temporal patterns, including circadian rhythms and burst-like behavior with power-law distributed time gaps between presences. The inferred leader-follower network highlighted key behavioral patterns: females followed males more often than expected, males showed stronger but fewer associations with specific females, and smaller individuals followed others less consistently than larger ones. These findings align with ecological insights, revealing structured social interactions and providing a novel framework for studying marine animal behavior through network theory.

q-bio.QM↗

arXiv2024

Non-local transitions and ground state switching in the self-organization of vascular networks

The model by Hu and Cai [Phys. Rev. Lett., Vol. 111(13) (2013)] describes the self-organization of vascular networks for transport of fluids from source to sinks. Diameters, and thereby conductances, of vessel segments evolve so as to minimize a cost functional E. The cost is the trade-off between the power required for pumping the fluid and the energy consumption for vessel maintenance. The model has been used to show emergence of cyclic structures in the presence of locally fluctuating demand, i.e. non-constant net flow at sink nodes. Under rapid and sufficiently large fluctuations, the dynamics exhibits bistability of tree-like and cyclic network structures. We compare these solutions in terms of the cost functional E. Close to the saddle-node bifurcation giving rise to the cyclic solutions, we find a parameter regime where the tree-like solution rather than the cyclic solution is cost-optimal. Thus we discover an additional, non-local transition where tree-like and cyclic solutions exchange their roles as minimum-cost (or ground) states. The findings hold both in a small system of one source and a few sinks and in an empirical vascular network with hundreds of sinks. In the small system, we further analyze the case of slower fluctuations, i.e., on the same time scale as network adaptation. We find that the noisy dynamics settles around the cyclic structures even when these structures are not cost-optimal.

nlin.AO↗

arXiv2024

Shipping traffic through the Arctic Ocean: spatial distribution, temporal evolution and its dependence on the sea ice extent

The reduction in sea ice cover with Arctic warming facilitates the transit of ships through routes that are remarkably shorter than the traditional shipping routes. Automatic Identification System (AIS), ideally designed to avoid vessel collisions, transmits on vessel navigation information (currently 27 types of messages) such as name, position or speed, is a powerful data source to monitor the progress of Arctic shipping as the ice cover decreases. Based on the analysis of an online platform collecting shipping AIS data, we quantified the spatial distribution of shipping through the Arctic Ocean, its intensity and the temporal evolution, in relation to the area released by the sea ice area. Shipping through the Arctic Ocean is distributed spatially following a heavy-tailed distribution, implying heavy traffic through a limited Arctic area, with an exponent that depends on the vessel category. Fishing is the category with the largest spatial spread, with the width of shipping routes correlated with the proximal sea ice area. The time evolution of these routes is characterized by increasing extended periods of shipping activity through the year. AIS data offers valuable information on the activity of the international fleet worldwide. In the context of the new international agreements, it is a valuable source to monitor shipping, fishing and the potential impact in marine life among other aspects. Here we have focused on the Arctic shipping in recent years, which is rapidly growing, particularly around the Northeastern and Northwest Passage coastal routes, providing an opportunity for the design of shorter shipping routes and reduced greenhouse gas emissions from transport of goods, but at a risk of impacts on the Arctic ecosystem.

physics.soc-ph↗

arXiv2023

Optimisation via encodings: a renormalisation group perspective

Difficult, in particular NP-complete, optimization problems are traditionally solved approximately using search heuristics. These are usually slowed down by the rugged landscapes encountered, because local minima arrest the search process. Cover-encoding maps were devised to circumvent this problem by transforming the original landscape to one that is free of local minima and enriched in near-optimal solutions. By definition, these involve the mapping of the original (larger) search space into smaller subspaces, by processes that typically amount to a form of coarse-graining. In this paper, we explore the details of this coarse-graining using formal arguments, as well as concrete examples of cover-encoding maps, that are investigated analytically as well as computationally. Our results strongly suggest that the coarse-graining involved in cover-encoding maps bears a strong resemblance to that encountered in renormalisation group schemes. Given the apparently disparate nature of these two formalisms, these strong similarities are rather startling, and suggest deep mathematical underpinnings that await further exploration.

cs.AI↗

arXiv2023

Bifurcations in adaptive vascular networks: towards model calibration

Transport networks are crucial for the functioning of natural and technological systems. We study a mathematical model of vascular network adaptation, where the network structure dynamically adjusts to changes in blood flow and pressure. The model is based on local feedback mechanisms that occur on different time scales in the mammalian vasculature. The cost exponent $γ$ tunes the vessel growth in the adaptation rule, and we test the hypothesis that the cost exponent is $γ=1/2$ for vascular systems [Hu and Cai, Phys. Rev. Lett., Vol. 111(13) (2013)1 ]. We first perform a bifurcation analysis for a simple triangular network motif with fluctuating demand, and then conduct numerical simulations on network topologies extracted from perivascular networks of rodent brains. We compare the model predictions with experimental data and find that $γ$ is closer to 1 than to 1/2 for the model to be consistent with the data. Our study thus aims at addressing two questions: (i) Is a specific measured flow network consistent in terms of physical reality? (ii) Is the adaptive dynamic model consistent with measured network data? We conclude that the model can capture some aspects of vascular network formation and adaptation, but also suggest some limitations and directions for future research. Our findings contribute to a general understanding of the dynamics in adaptive transport networks, which is essential for studying mammalian vasculature and developing self-organizing piping systems.

nlin.AO↗

arXiv2023

Order-disorder transition in the zero-temperature Ising model on random graphs

The zero-temperature Ising model is known to reach a fully ordered ground state in sufficiently dense random graphs. In sparse random graphs, the dynamics gets absorbed in disordered local minima at magnetization close to zero. Here, we find that the non-equilibrium transition between the ordered and the disordered regime occurs at an average degree that slowly grows with the graph size. The system shows bistability: The distribution of the absolute magnetization in the reached absorbing state is bimodal, with peaks only at zero and unity. For a fixed system size, the average time to absorption behaves nonmonotonically as a function of average degree. The peak value of the average absorption time grows as a power law of the system size. These findings have relevance for community detection, opinion dynamics, and games on networks.

physics.soc-ph↗

arXiv2021

Exact statistical mechanics of the Ising model on networks

The Ising model is an equilibrium stochastic process used as a model in several branches of science including magnetic materials, geophysics, neuroscience, sociology and finance. Real systems of interest have finite size and a fixed coupling matrix exhibiting quenched disorder. Exact methods for the Ising model, however, employ infinite size limits, translational symmetries of lattices and the Cayley tree, or annealed structures as ensembles of networks. Here we show how the Ising partition function can be evaluated exactly by exploiting small tree-width. This structural property is exhibited by a large set of networks, both empirical and model generated.

cond-mat.stat-mech↗

arXiv2020

Tree decompositions of real-world networks from simulated annealing

Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network. Tree and branch decompositions considered here directly represent network structure as trees for recursive computation of network properties. Unlike coarse-graining approximations in terms of community structure or metapopulations, tree decompositions of sufficiently small width allow for exact results on equilibrium processes. Here we use simulated annealing to find tree decompositions of narrow width for a set of medium-size empirical networks. Rather than optimizing tree decompositions directly, we employ a search space constituted by so-called elimination orders being permutations on the network's node set. For each in a database of empirical networks with up to 1000 edges, we find a tree decomposition of low width.

cond-mat.dis-nn↗

arXiv2020

Altruism in populations at the extinction transition

We study the evolution of cooperation as a birth-death process in spatially extended populations. The benefit from the altruistic behavior of a cooperator is implemented by decreasing the death rate of its direct neighbors. The cost of cooperation is the increase of a cooperator's death rate proportional to the number of its neighbors. When cooperation has higher cost than benefit, cooperators disappear. Then the dynamics reduces to the contact process with defectors as the single particle type. Increasing the benefit-cost ratio above 1, the extinction transition of the contact process splits into a set of nonequilibrium transitions between four regimes when increasing the baseline death rate $p$ as a control parameter: (i) defection only, (ii) coexistence, (iii) cooperation only, (iv) extinction. We investigate the transitions between these regimes. As the main result, we find that full cooperation is established at the extinction transition as long as benefit is strictly larger than cost. Qualitatively identical phase diagrams are obtained for populations on square lattices and in pair approximation. Spatial correlations with nearest neighbors only are thus sufficient for sustained cooperation.

q-bio.PE↗

arXiv2019

Cyclic structure induced by load fluctuations in adaptive transportation networks

Transport networks are crucial to the functioning of natural systems and technological infrastructures. For flow networks in many scenarios, such as rivers or blood vessels, acyclic networks (i.e., trees) are optimal structures when assuming time-independent in- and outflow. Dropping this assumption, fluctuations of net flow at source and/or sink nodes may render the pure tree solutions unstable even under a simple local adaptation rule for conductances. Here, we consider tree-like networks under the influence of spatially heterogeneous distribution of fluctuations, where the root of the tree is supplied by a constant source and the leaves at the bottom are equipped with sinks with fluctuating loads. We find that the network divides into two regions characterized by tree-like motifs and stable cycles. The cycles emerge through transcritical bifurcations at a critical amplitude of fluctuation. For a simple network structure, depending on parameters defining the local adaptation, cycles first appear close to the leaves (or root) and then appear closer towards the root (or the leaves). The interaction between topology and dynamics gives rise to complex feedback mechanisms with many open questions in the theory of network dynamics. A general understanding of the dynamics in adaptive transport networks is essential in the study of mammalian vasculature, and adaptive transport networks may find technological applications in self-organizing piping systems.

nlin.AO↗

arXiv2018

Patterning the insect eye: from stochastic to deterministic mechanisms

While most processes in biology are highly deterministic, stochastic mechanisms are sometimes used to increase cellular diversity, such as in the specification of sensory receptors. In the human and Drosophila eye, photoreceptors sensitive to various wavelengths of light are distributed randomly across the retina. Mechanisms that underlie stochastic cell fate specification have been analysed in detail in the Drosophila retina. In contrast, the retinas of another group of dipteran flies exhibit highly ordered patterns. Species in the Dolichopodidae, the "long-legged" flies, have regular alternating columns of two types of ommatidia (unit eyes), each producing corneal lenses of different colours. Individual flies sometimes exhibit perturbations of this orderly pattern, with "mistakes" producing changes in pattern that can propagate across the entire eye, suggesting that the underlying developmental mechanisms follow local, cellular-automaton-like rules. We hypothesize that the regulatory circuitry patterning the eye is largely conserved among flies such that the difference between the Drosophila and Dolichopodidae eyes should be explicable in terms of relative interaction strengths, rather than requiring a rewiring of the regulatory network. We present a simple stochastic model which, among its other predictions, is capable of explaining both the random Drosophila eye and the ordered, striped pattern of Dolichopodidae.

q-bio.CB↗

arXiv2018

Cover-Encodings of Fitness Landscapes

The traditional way of tackling discrete optimization problems is by using local search on suitably defined cost or fitness landscapes. Such approaches are however limited by the slowing down that occurs when the local minima that are a feature of the typically rugged landscapes encountered arrest the progress of the search process. Another way of tackling optimization problems is by the use of heuristic approximations to estimate a global cost minimum. Here we present a combination of these two approaches by using cover-encoding maps which map processes from a larger search space to subsets of the original search space. The key idea is to construct cover-encoding maps with the help of suitable heuristics that single out near-optimal solutions and result in landscapes on the larger search space that no longer exhibit trapping local minima. We present cover-encoding maps for the problems of the traveling salesman, number partitioning, maximum matching and maximum clique; the practical feasibility of our method is demonstrated by simulations of adaptive walks on the corresponding encoded landscapes which find the global minima for these problems.

cond-mat.dis-nn↗

arXiv2017

Transitions from trees to cycles in adaptive flow networks

Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization principles, here, we take a dynamical systems approach and study a simple model of a flow network with dynamically adapting weights (conductances). We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable. The network converges to a spatially non-uniform stable configuration composed of both cyclic and tree-like structures. Cyclic structures emerge locally in a transcritical bifurcation as the amplitude of the load fluctuations is increased. The resulting adaptive dynamics thus partitions the network into two distinct regions with cyclic and tree-like structures. The location of the boundary between these two regions is determined by the amplitude of the fluctuations. These findings may explain why natural transport networks display cyclic structures in the micro-vascular regions near terminal nodes, but tree-like features in the regions with larger veins.

nlin.AO↗

arXiv2016

Temporal interactions facilitate endemicity in the susceptible-infected-susceptible epidemic model

Data of physical contacts and face-to-face communications suggest temporally varying networks as the media on which infections take place among humans and animals. Epidemic processes on temporal networks are complicated by complexity of both network structure and temporal dimensions. Theoretical approaches are much needed for identifying key factors that affect dynamics of epidemics. In particular, what factors make some temporal networks stronger media of infection than other temporal networks is under debate. We develop a theory to understand the susceptible-infected-susceptible epidemic model on arbitrary temporal networks, where each contact is used for a finite duration. We show that temporality of networks lessens the epidemic threshold such that infections persist more easily in temporal networks than in their static counterparts. We further show that the Lie commutator bracket of the adjacency matrices at different times is a key determinant of the epidemic threshold in temporal networks. The effect of temporality on the epidemic threshold, which depends on a data set, is approximately predicted by the magnitude of a commutator norm.

physics.soc-ph↗

arXiv2015

Competition in the presence of aging: order, disorder, and synchronized collective behavior

We study the stochastic dynamics of coupled states with transition probabilities depending on local persistence, this is, the time since a state has changed. When the population has a preference to adopt older states the system orders quickly due to the dominance of the old state. When preference for new states prevails, the system can show coexistence of states or synchronized collective behavior resulting in long ordering times. In this case, the magnetization $m(t)$ of the system oscillates around $m(t)=0$. Implications for social systems are discussed.

physics.soc-ph↗

arXiv2015

Anomalous scaling in an age-dependent branching model

We introduce a one-parametric family of tree growth models, in which branching probabilities decrease with branch age $τ$ as $τ^{-α}$. Depending on the exponent $α$, the scaling of tree depth with tree size $n$ displays a transition between the logarithmic scaling of random trees and an algebraic growth. At the transition ($α=1$) tree depth grows as $(\log n)^2$. This anomalous scaling is in good agreement with the trend observed in evolution of biological species, thus providing a theoretical support for age-dependent speciation and associating it to the occurrence of a critical point.

q-bio.PE↗

arXiv2014

Boolean networks with veto functions

Boolean networks are discrete dynamical systems for modeling regulation and signaling in living cells. We investigate a particular class of Boolean functions with inhibiting inputs exerting a veto (forced zero) on the output. We give analytical expressions for the sensitivity of these functions and provide evidence for their role in natural systems. In an intracellular signal transduction network [Helikar et al., PNAS (2008)], the functions with veto are over-represented by a factor exceeding the over-representation of threshold functions and canalyzing functions in the same system. In Boolean networks for control of the yeast cell cycle [Fangting Li et al., PNAS (2004), Davidich et al., PLoS One (2009)], none or minimal changes to the wiring diagrams are necessary to formulate their dynamics in terms of the veto functions introduced here.

q-bio.MN↗

arXiv2013

Temporal networks: slowing down diffusion by long lasting interactions

Interactions among units in complex systems occur in a specific sequential order thus affecting the flow of information, the propagation of diseases, and general dynamical processes. We investigate the Laplacian spectrum of temporal networks and compare it with that of the corresponding aggregate network. First, we show that the spectrum of the ensemble average of a temporal network has identical eigenmodes but smaller eigenvalues than the aggregate networks. In large networks without edge condensation, the expected temporal dynamics is a time-rescaled version of the aggregate dynamics. Even for single sequential realizations, diffusive dynamics is slower in temporal networks. These discrepancies are due to the noncommutability of interactions. We illustrate our analytical findings using a simple temporal motif, larger network models and real temporal networks.

physics.soc-ph↗