A unified framework for simplicial Kuramoto models.

Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three main groups: "simple" models, "Hodge-coupled" models, and "order-coupled" (Dirac) models. Our framework is based on topology and discrete differential geometry, as well as gradient systems and frustrations, and permits a systematic analysis of their properties. We establish an equivalence between the simple simplicial Kuramoto model and the standard Kuramoto model on pairwise networks under the condition of manifoldness of the simplicial complex. Then, starting from simple models, we describe the notion of simplicial synchronization and derive bounds on the coupling strength necessary or sufficient for achieving it. For some variants, we generalize these results and provide new ones, such as the controllability of equilibrium solutions. Finally, we explore a potential application in the reconstruction of brain functional connectivity from structural connectomes and find that simple edge-based Kuramoto models perform competitively or even outperform complex extensions of node-based models.

A universal workflow for creation, validation, and generalization of detailed neuronal models.

Detailed single-neuron modeling is widely used to study neuronal functions. While cellular and functional diversity across the mammalian cortex is vast, most of the available computational tools focus on a limited set of specific features characteristic of a single neuron. Here, we present a generalized automated workflow for the creation of robust electrical models and illustrate its performance by building cell models for the rat somatosensory cortex. Each model is based on a 3D morphological reconstruction and a set of ionic mechanisms. We use an evolutionary algorithm to optimize neuronal parameters to match the electrophysiological features extracted from experimental data. Then we validate the optimized models against additional stimuli and assess their generalizability on a population of similar morphologies. Compared to the state-of-the-art canonical models, our models show 5-fold improved generalizability. This versatile approach can be used to build robust models of any neuronal type.

Controlling morpho-electrophysiological variability of neurons with detailed biophysical models.

Variability, which is known to be a universal feature among biological units such as neuronal cells, holds significant importance, as, for example, it enables a robust encoding of a high volume of information in neuronal circuits and prevents hypersynchronizations. While most computational studies on electrophysiological variability in neuronal circuits were done with single-compartment neuron models, we instead focus on the variability of detailed biophysical models of neuron multi-compartmental morphologies. We leverage a Markov chain Monte Carlo method to generate populations of electrical models reproducing the variability of experimental recordings while being compatible with a set of morphologies to faithfully represent specifi morpho-electrical type. We demonstrate our approach on layer 5 pyramidal cells and study the morpho-electrical variability and in particular, find that morphological variability alone is insufficient to reproduce electrical variability. Overall, this approach provides a strong statistical basis to create detailed models of neurons with controlled variability.

Sensitivity and spectral control of network lasers.

Recently, random lasing in complex networks has shown efficient lasing over more than 50 localised modes, promoted by multiple scattering over the underlying graph. If controlled, these network lasers can lead to fast-switching multifunctional light sources with synthesised spectrum. Here, we observe both in experiment and theory high sensitivity of the network laser spectrum to the spatial shape of the pump profile, with some modes for example increasing in intensity by 280% when switching off 7% of the pump beam. We solve the nonlinear equations within the steady state ab-initio laser theory (SALT) approximation over a graph and we show selective lasing of around 90% of the strongest intensity modes, effectively programming the spectrum of the lasing networks. In our experiments with polymer networks, this high sensitivity enables control of the lasing spectrum through non-uniform pump patterns. We propose the underlying complexity of the network modes as the key element behind efficient spectral control opening the way for the development of optical devices with wide impact for on-chip photonics for communication, sensing, and computation.

Relative, local and global dimension in complex networks.

Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and distorted by inhomogeneities, or to intrinsically discrete systems such as networks. To take into account locality, finiteness and discreteness, dynamical processes can be used to probe the space geometry and define its dimension. Here we show that each point in space can be assigned a relative dimension with respect to the source of a diffusive process, a concept that provides a scale-dependent definition for local and global dimension also applicable to networks. To showcase its application to physical systems, we demonstrate that the local dimension of structural protein graphs correlates with structural flexibility, and the relative dimension with respect to the active site uncovers regions involved in allosteric communication. In simple models of epidemics on networks, the relative dimension is predictive of the spreading capability of nodes, and identifies scales at which the graph structure is predictive of infectivity. We further apply our dimension measures to neuronal networks, economic trade, social networks, ocean flows, and to the comparison of random graphs.

Computational synthesis of cortical dendritic morphologies.

Neuronal morphologies provide the foundation for the electrical behavior of neurons, the connectomes they form, and the dynamical properties of the brain. Comprehensive neuron models are essential for defining cell types, discerning their functional roles, and investigating brain-disease-related dendritic alterations. However, a lack of understanding of the principles underlying neuron morphologies has hindered attempts to computationally synthesize morphologies for decades. We introduce a synthesis algorithm based on a topological descriptor of neurons, which enables the rapid digital reconstruction of entire brain regions from few reference cells. This topology-guided synthesis generates dendrites that are statistically similar to biological reconstructions in terms of morpho-electrical and connectivity properties and offers a significant opportunity to investigate the links between neuronal morphology and brain function across different spatiotemporal scales. Synthesized cortical networks based on structurally altered dendrites associated with diverse brain pathologies revealed principles linking branching properties to the structure of large-scale networks.

Digital Reconstruction of the Neuro-Glia-Vascular Architecture.

Astrocytes connect the vasculature to neurons mediating the supply of nutrients and biochemicals. They are involved in a growing number of physiological and pathophysiological processes that result from biophysical, physiological, and molecular interactions in this neuro-glia-vascular ensemble (NGV). The lack of a detailed cytoarchitecture severely restricts the understanding of how they support brain function. To address this problem, we used data from multiple sources to create a data-driven digital reconstruction of the NGV at micrometer anatomical resolution. We reconstructed 0.2 mm3 of the rat somatosensory cortex with 16 000 morphologically detailed neurons, 2500 protoplasmic astrocytes, and its microvasculature. The consistency of the reconstruction with a wide array of experimental measurements allows novel predictions of the NGV organization, allowing the anatomical reconstruction of overlapping astrocytic microdomains and the quantification of endfeet connecting each astrocyte to the vasculature, as well as the extent to which they cover the latter. Structural analysis showed that astrocytes optimize their positions to provide uniform vascular coverage for trophic support and signaling. However, this optimal organization rapidly declines as their density increases. The NGV digital reconstruction is a resource that will enable a better understanding of the anatomical principles and geometric constraints, which govern how astrocytes support brain function.

Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature.

Describing networks geometrically through low-dimensional latent metric spaces has helped design efficient learning algorithms, unveil network symmetries and study dynamical network processes. However, latent space embeddings are limited to specific classes of networks because incompatible metric spaces generally result in information loss. Here, we study arbitrary networks geometrically by defining a dynamic edge curvature measuring the similarity between pairs of dynamical network processes seeded at nearby nodes. We show that the evolution of the curvature distribution exhibits gaps at characteristic timescales indicating bottleneck-edges that limit information spreading. Importantly, curvature gaps are robust to large fluctuations in node degrees, encoding communities until the phase transition of detectability, where spectral and node-clustering methods fail. Using this insight, we derive geometric modularity to find multiscale communities based on deviations from constant network curvature in generative and real-world networks, significantly outperforming most previous methods. Our work suggests using network geometry for studying and controlling the structure of and information spreading on networks.

HCGA: Highly comparative graph analysis for network phenotyping.

Networks are widely used as mathematical models of complex systems across many scientific disciplines. Decades of work have produced a vast corpus of research characterizing the topological, combinatorial, statistical, and spectral properties of graphs. Each graph property can be thought of as a feature that captures important (and sometimes overlapping) characteristics of a network. In this paper, we introduce HCGA, a framework for highly comparative analysis of graph datasets that computes several thousands of graph features from any given network. HCGA also offers a suite of statistical learning and data analysis tools for automated identification and selection of important and interpretable features underpinning the characterization of graph datasets. We show that HCGA outperforms other methodologies on supervised classification tasks on benchmark datasets while retaining the interpretability of network features. We exemplify HCGA by predicting the charge transfer in organic semiconductors and clustering a dataset of neuronal morphology images.

Un-reduction in field theory.

The un-reduction procedure introduced previously in the context of classical mechanics is extended to covariant field theory. The new covariant un-reduction procedure is applied to the problem of shape matching of images which depend on more than one independent variable (for instance, time and an additional labelling parameter). Other possibilities are also explored: nonlinear [Formula: see text]-models and the hyperbolic flows of curves.

Noise and Dissipation on Coadjoint Orbits.

We derive and study stochastic dissipative dynamics on coadjoint orbits by incorporating noise and dissipation into mechanical systems arising from the theory of reduction by symmetry, including a semidirect product extension. Random attractors are found for this general class of systems when the Lie algebra is semi-simple, provided the top Lyapunov exponent is positive. We study in details two canonical examples, the free rigid body and the heavy top, whose stochastic integrable reductions are found and numerical simulations of their random attractors are shown.

G-Strands on symmetric spaces.

We study the G-strand equations that are extensions of the classical chiral model of particle physics in the particular setting of broken symmetries described by symmetric spaces. These equations are simple field theory models whose configuration space is a Lie group, or in this case a symmetric space. In this class of systems, we derive several models that are completely integrable on finite dimensional Lie group G, and we treat in more detail examples with symmetric space SU(2)/S1 and SO(4)/SO(3). The latter model simplifies to an apparently new integrable nine-dimensional system. We also study the G-strands on the infinite dimensional group of diffeomorphisms, which gives, together with the Sobolev norm, systems of 1+2 Camassa-Holm equations. The solutions of these equations on the complementary space related to the Witt algebra decomposition are the odd function solutions.