Stochastic cycle selection in active flow networks

Fractal networks: Topology, dimension, and complexity

Over the past two decades, the study of self-similarity and fractality in discrete structures, particularly complex networks, has gained momentum. This surge of interest is fueled by the theoretical developments within the theory of complex networks and the practical demands of real-world applications. Nonetheless, translating the principles of fractal geometry from the domain of general topology, dealing with continuous or infinite objects, to finite structures in a mathematically rigorous way poses a formidable challenge. In this paper, we overview such a theory that allows to identify and analyze fractal networks through the innate methodologies of graph theory and combinatorics. It establishes the direct graph-theoretical analogs of topological (Lebesgue) and fractal (Hausdorff) dimensions in a way that naturally links them to combinatorial parameters that have been studied within the realm of graph theory for decades. This allows to demonstrate that the self-similarity in networks is defined by the patterns of intersection among densely connected network communities. Moreover, the theory bridges discrete and continuous definitions by demonstrating how the combinatorial characterization of Lebesgue dimension via graph representation by its subsets (subgraphs/communities) extends to general topological spaces. Using this framework, we rigorously define fractal networks and connect their properties with established combinatorial concepts, such as graph colorings and descriptive complexity. The theoretical framework surveyed here sets a foundation for applications to real-life networks and future studies of fractal characteristics of complex networks using combinatorial methods and algorithms.

Network topology enables efficient response to environment inPhysarum polycephalum

The network-shaped body plan distinguishes the unicellular slime mouldPhysarum polycephalumin body architecture from other unicellular organisms. Yet, network-shaped body plans dominate branches of multi-cellular life such as in fungi. What survival advantage does a network structure provide when facing a dynamic environment with adverse conditions? Here, we probe how network topology impactsP. polycephalum's avoidance response to an adverse blue light. We stimulate either an elongated, I-shaped amoeboid or a Y-shaped networked specimen and subsequently quantify the evacuation process of the light-exposed body part. The result shows that Y-shaped specimen complete the avoidance retraction in a comparable time frame, even slightly faster than I-shaped organisms, yet, at a lower almost negligible increase in migration velocity. Contraction amplitude driving mass motion is further only locally increased in Y-shaped specimen compared to I-shaped-providing further evidence that Y-shaped's avoidance reaction is energetically more efficient than in I-shaped amoeboid organisms. The difference in the retraction behaviour suggests that the complexity of network topology provides a key advantage when encountering adverse environments. Our findings could lead to a better understanding of the transition from unicellular to multicellularity.

Monte Carlo Physarum Machine: Characteristics of Pattern Formation in Continuous Stochastic Transport Networks

We present Monte Carlo Physarum Machine (MCPM): a computational model suitable for reconstructing continuous transport networks from sparse 2D and 3D data. MCPM is a probabilistic generalization of Jones's (2010) agent-based model for simulating the growth of Physarum polycephalum (slime mold). We compare MCPM to Jones's work on theoretical grounds, and describe a task-specific variant designed for reconstructing the large-scale distribution of gas and dark matter in the Universe known as the cosmic web. To analyze the new model, we first explore MCPM's self-patterning behavior, showing a wide range of continuous network-like morphologies-called polyphorms-that the model produces from geometrically intuitive parameters. Applying MCPM to both simulated and observational cosmological data sets, we then evaluate its ability to produce consistent 3D density maps of the cosmic web. Finally, we examine other possible tasks where MCPM could be useful, along with several examples of fitting to domain-specific data as proofs of concept.

Emergence of behaviour in a self-organized living matter network

What is the origin of behaviour? Although typically associated with a nervous system, simple organisms also show complex behaviours. Among them, the slime mold Physarum polycephalum, a giant single cell, is ideally suited to study emergence of behaviour. Here, we show how locomotion and morphological adaptation behaviour emerge from self-organized patterns of rhythmic contractions of the actomyosin lining of the tubes making up the network-shaped organism. We quantify the spatio-temporal contraction dynamics by decomposing experimentally recorded contraction patterns into spatial contraction modes. Notably, we find a continuous spectrum of modes, as opposed to a few dominant modes. Our data suggests that the continuous spectrum of modes allows for dynamic transitions between a plethora of specific behaviours with transitions marked by highly irregular contraction states. By mapping specific behaviours to states of active contractions, we provide the basis to understand behaviour’s complexity as a function of biomechanical dynamics.

Active topolectrical circuits

The transfer of topological concepts from the quantum world to classical mechanical and electronic systems has opened fundamentally different approaches to protected information transmission and wave guidance. A particularly promising emergent technology is based on recently discovered topolectrical circuits that achieve robust electric signal transduction by mimicking edge currents in quantum Hall systems. In parallel, modern active matter research has shown how autonomous units driven by internal energy reservoirs can spontaneously self-organize into collective coherent dynamics. Here, we unify key ideas from these two previously disparate fields to develop design principles for active topolectrical circuits (ATCs) that can self-excite topologically protected global signal patterns. Realizing autonomous active units through nonlinear Chua diode circuits, we theoretically predict and experimentally confirm the emergence of self-organized protected edge oscillations in one- and two-dimensional ATCs. The close agreement between theory, simulations, and experiments implies that nonlinear ATCs provide a robust and versatile platform for developing high-dimensional autonomous electrical circuits with topologically protected functionalities.

CycFlowDec: A Python module for decomposing flow networks using simple cycles

New algorithms for determining the expected flow through simple cycles in a closed network are presented. Current network analysis software do not implement algorithms for expected cyclic flow decomposition, despite its potential value. Decomposing networks into expected cycle flows provides a quantitative characterization of network cycles that can be further analyzed for sensitivity and correlative behavior. An efficient, general algorithm has been coded into CycFlowDec, an open source Python module available at https://github.com/austenb28/CycFlowDec.

Graph fractal dimension and the structure of fractal networks

Fractals are geometric objects that are self-similar at different scales and whose geometric dimensions differ from so-called fractal dimensions. Fractals describe complex continuous structures in nature. Although indications of self-similarity and fractality of complex networks has been previously observed, it is challenging to adapt the machinery from the theory of fractality of continuous objects to discrete objects such as networks. In this article, we identify and study fractal networks using the innate methods of graph theory and combinatorics. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to known graph-theoretical characteristics: rank dimension and product dimension. Our approach reveals how self-similarity and fractality of a network are defined by a pattern of overlaps between densely connected network communities. It allows us to identify fractal graphs, explore the relations between graph fractality, graph colourings and graph descriptive complexity, and analyse the fractality of several classes of graphs and network models, as well as of a number of real-life networks. We demonstrate the application of our framework in evolutionary biology and virology by analysing networks of viral strains sampled at different stages of evolution inside their hosts. Our methodology revealed gradual self-organization of intra-host viral populations over the course of infection and their adaptation to the host environment. The obtained results lay a foundation for studying fractal properties of complex networks using combinatorial methods and algorithms.

Resilience of three-dimensional sinusoidal networks in liver tissue

Can three-dimensional, microvasculature networks still ensure blood supply if individual links fail? We address this question in the sinusoidal network, a plexus-like microvasculature network, which transports nutrient-rich blood to every hepatocyte in liver tissue, by building on recent advances in high-resolution imaging and digital reconstruction of adult mice liver tissue. We find that the topology of the three-dimensional sinusoidal network reflects its two design requirements of a space-filling network that connects all hepatocytes, while using shortest transport routes: sinusoidal networks are sub-graphs of the Delaunay graph of their set of branching points, and also contain the corresponding minimum spanning tree, both to good approximation. To overcome the spatial limitations of experimental samples and generate arbitrarily-sized networks, we developed a network generation algorithm that reproduces the statistical features of 0.3-mm-sized samples of sinusoidal networks, using multi-objective optimization for node degree and edge length distribution. Nematic order in these simulated networks implies anisotropic transport properties, characterized by an empirical linear relation between a nematic order parameter and the anisotropy of the permeability tensor. Under the assumption that all sinusoid tubes have a constant and equal flow resistance, we predict that the distribution of currents in the network is very inhomogeneous, with a small number of edges carrying a substantial part of the flow-a feature known for hierarchical networks, but unexpected for plexus-like networks. We quantify network resilience in terms of a permeability-at-risk, i.e., permeability as function of the fraction of removed edges. We find that sinusoidal networks are resilient to random removal of edges, but vulnerable to the removal of high-current edges. Our findings suggest the existence of a mechanism counteracting flow inhomogeneity to balance metabolic load on the liver.

A dynamic preferred direction model for the self-organization dynamics of bacterial microfluidic pumping

It is known that some flagellated bacteria like Serratia marcescens, when deposited and affixed onto a surface to form a "bacterial carpet", self-organize in a collective motion of the flagella that is capable of pumping fluid through microfluidic channels. We set up a continuum model comprising two macroscopic variables that is capable of describing this self-organization mechanism as well as quantifying it to the extent that an agreement with the experimentally observed channel width dependence of the pumping is reached. The activity is introduced through a collective angular velocity of the helical flagella rotation, which is an example of a dynamic macroscopic preferred direction. Our model supports and quantifies the view that the self-coordination is due to a positive feedback loop between the bacterial flagella and the local flow generated by their rotation. Moreover, our results indicate that this biological active system is operating close to the self-organization threshold.

Nutrient Transport Driven by Microbial Active Carpets

We demonstrate that active carpets of bacteria or self-propelled colloids generate coherent flows towards the substrate, and propose that these currents provide efficient pathways to replenish nutrients that feed back into activity. A full theory is developed in terms of gradients in the active matter density and velocity, and applied to bacterial turbulence, topological defects and clustering. Currents with complex spatiotemporal patterns are obtained, which are tunable through confinement. Our findings show that diversity in carpet architecture is essential to maintain biofunctionality.

Topology-dependent density optima for efficient simultaneous network exploration

A random search process in a networked environment is governed by the time it takes to visit every node, termed the cover time. Often, a networked process does not proceed in isolation but competes with many instances of itself within the same environment. A key unanswered question is how to optimize this process: How many concurrent searchers can a topology support before the benefits of parallelism are outweighed by competition for space? Here, we introduce the searcher-averaged parallel cover time (APCT) to quantify these economies of scale. We show that the APCT of the networked symmetric exclusion process is optimized at a searcher density that is well predicted by the spectral gap. Furthermore, we find that nonequilibrium processes, realized through the addition of bias, can support significantly increased density optima. Our results suggest alternative hybrid strategies of serial and parallel search for efficient information gathering in social interaction and biological transport networks.

Mode Selection in Compressible Active Flow Networks

Coherent, large-scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. Here, we introduce and explore an analytically tractable nonlinear model for compressible active flow networks. In contrast to thermally driven systems, we find that active friction selects discrete states with a limited number of oscillation modes activated at distinct fixed amplitudes. Using perturbation theory, we systematically predict the stationary states of noisy networks and find good agreement with a Bayesian state estimation based on a hidden Markov model applied to simulated time series data. Our results suggest that the macroscopic response of active network structures, from actomyosin force networks to cytoplasmic flows, can be dominated by a significantly reduced number of modes, in contrast to energy equipartition in thermal equilibrium. The model is also well suited to study topological sound modes and spectral band gaps in active matter.

Active matter logic for autonomous microfluidics

Chemically or optically powered active matter plays an increasingly important role in materials design, but its computational potential has yet to be explored systematically. The competition between energy consumption and dissipation imposes stringent physical constraints on the information transport in active flow networks, facilitating global optimization strategies that are not well understood. Here, we combine insights from recent microbial experiments with concepts from lattice-field theory and non-equilibrium statistical mechanics to introduce a generic theoretical framework for active matter logic. Highlighting conceptual differences with classical and quantum computation, we demonstrate how the inherent non-locality of incompressible active flow networks can be utilized to construct universal logical operations, Fredkin gates and memory storage in set-reset latches through the synchronized self-organization of many individual network components. Our work lays the conceptual foundation for developing autonomous microfluidic transport devices driven by bacterial fluids, active liquid crystals or chemically engineered motile colloids.