SearcharxivSearch

arXiv subjects

Robin Delabays

Publications and source records attributed to Robin Delabays.

At least 19 recordsLinked to original sources

Demographic Dependence of Vaccine Adoption under Opinion Persuasion

Inspired by contagion models of social belief formation, we develop an epistemically-informed modeling framework, SIS-Vo, in which vaccine-related information propagates on a signed opinion network. Our model allows for heterogeneous treatment effects of policy messages across subpopulations through demographic-specific responses. We derive fixed-point characterizations of the healthy (disease-free) and endemic equilibria of this model, and obtain conditions for local stability of the healthy state in terms of the contact network and opinion-dependent vaccination capacities. Using numerical simulations, we illustrate how suitably targeted policy interventions, acting through opinion dynamics, can stabilize the epidemic process by moving the system towards the healthy regime. The SIS-Vo framework thus provides a natural basis for control-theoretic analysis of vaccination policies that remain robust even when misinformation targets specific subgroups.

physics.soc-ph

Data-driven Control of Hypergraphs: Leveraging THIS to Damp Noise in Diffusive Hypergraphs

Controllability determines whether a system's state can be guided toward any desired configuration, making it a fundamental prerequisite for designing effective control strategies. In the context of networked systems, controllability is a well-established concept. However, many real-world systems, from biological collectives to engineered infrastructures, exhibit higher-order interactions that cannot be captured by simple graphs. Moreover, the way in which agents interact and influence one another is often unknown and must be inferred from partial observations of the system. Here, we close the loop between a hypergraph representation and our recently developed hypergraph inference algorithm, THIS, to infer the underlying multibody couplings. Building on the inferred structure, we design a parsimonious controller that, given a minimal set of controllable nodes, steers the system toward a desired configuration. We validate the proposed system identification and control framework on a network of Kuramoto oscillators evolving over a hypergraph.

eess.SY

Route to Chaos in Multi-Species Ecosystems

We investigate species-rich mathematical models of ecosystems. While much of the existing literature focuses on the properties of equilibrium fixed points, persistent dynamics (e.g., limit cycles or chaos) have also been observed, both in natural or lab-controlled ecosystems and in mathematical models. Here we emphasize the emergence of limit cycles following Hopf bifurcations tuned by the variability of interspecies interaction. As this variability increases, and owing to the large dimensionality of the system, limit cycles typically acquire a growing spectrum of frequencies. This often leads to the appearance of strange attractors, with a chaotic dynamics of species abundances characterized by a positive Lyapunov exponent. We observe that limit cycles and strange attractors preserve biodiversity to some extent, as they maintain dynamical stability without species extinction. We give numerical evidences that this route to chaos dominates in ecosystems with strong enough interactions and where predator-prey behavior dominates over competition and mutualism. Based on arguments from random matrix theory, we further conjecture that this scenario is generic in ecosystems with large number of species, and identify the key parameters driving it. Overall, we show that the model we consider provides a unifying framework, where a wide range of population dynamics emerge from a simple few-parameter model.

nlin.AO

Small-signal stability of power systems with voltage droop

The stability of inverter-dominated power grids remains an active area of research. This paper presents novel sufficient conditions for ensuring small-signal stability in lossless and constant $R/X$ grids with highly heterogeneous mixes of grid-forming inverters that implement an adapted $V$-$q$ droop control. The proposed conditions can be evaluated in the neighborhood of each bus without information on the rest of the grid. Apart from the presence of $V$-$q$ droop, no additional assumptions are made regarding the inverter control strategies, nor is dynamical homogeneity across the system assumed. The analysis is enabled by recasting the node dynamics in terms of complex frequency and power, resulting in transfer functions that directly capture the small-signal frequency and amplitude responses to active and reactive power imbalances. These transfer functions are directly aligned with typical design considerations in grid-forming control. Building on an adapted small-phase theorem and viewing the system as a closed feedback loop between nodes and lines, the derived stability conditions also yield new insights when applied to established inverter control designs. We demonstrate in simulations that our conditions are not overly conservative and can identify individual inverters that are misconfigured and cause instability.

math.OC

Phase and gain stability for adaptive dynamical networks

In adaptive dynamical networks, the dynamics of the nodes and the edges influence each other. We show that we can treat such systems as a closed feedback loop between edge and node dynamics. Using recent advances on the stability of feedback systems from control theory, we derive local, sufficient conditions for steady states of such systems to be linearly stable. These conditions are local in the sense that they are written entirely in terms of the (linearized) behavior of the edges and nodes. We apply these conditions to the Kuramoto model with inertia written in adaptive form, and the adaptive Kuramoto model. For the former we recover a classic result, for the latter we show that our sufficient conditions match necessary conditions where the latter are available, thus completely settling the question of linear stability in this setting. The method we introduce can be readily applied to a vast class of systems. It enables straightforward evaluation of stability in highly heterogeneous systems.

nlin.AO

Nontrivial Kron Reduction for Power Grid Dynamics Modeling

The Kron reduction is used in power grid modeling when the analysis can -- supposedly -- be restricted to a subset of nodes. Typically, when one is interested in the phases' dynamics, it is common to reduce the load buses and focus on the generators' behavior. The rationale behind this reduction is that voltage phases at load buses adapt quickly to their neighbors' phases and, at the timescale of generators, they have virtually no dynamics. We show that the dynamics of the Kron-reduced part of a network can have a significant impact on the dynamics of the non-reduced buses. Therefore, Kron reduction should be used with care and, depending on the context, reduced nodes cannot be simply ignored. We demonstrate that the noise in the reduced part can unexpectedly affect the non-reduced part, even under the assumption that nodal disturbances are independent. Therefore, the common assumption that the noise in the non-reduced part is uncorrelated may lead to inaccurate assessments of the grid's behavior. To cope with such shortcomings of the Kron reduction, we show how to properly incorporate the contribution of the reduced buses into the reduced model using the Mori-Zwanzig formalism.

math.DS

Hypergraph reconstruction from dynamics

A plethora of methods have been developed in the past two decades to infer the underlying network structure of an interconnected system from its collective dynamics. However, methods capable of inferring nonpairwise interactions are only starting to appear. Here, we develop an inference algorithm based on sparse identification of nonlinear dynamics (SINDy) to reconstruct hypergraphs and simplicial complexes from time-series data. Our model-free method does not require information about node dynamics or coupling functions, making it applicable to complex systems that do not have a reliable mathematical description. We first benchmark the new method on synthetic data generated from Kuramoto and Lorenz dynamics. We then use it to infer the effective connectivity in the brain from resting-state EEG data, which reveals significant contributions from non-pairwise interactions in shaping the macroscopic brain dynamics.

physics.soc-ph

On the Robustness of Democratic Electoral Processes to Computational Propaganda

There is growing evidence of systematic attempts to influence democratic elections by controlled and digitally organized dissemination of fake news. This raises the question of the intrinsic robustness of democratic electoral processes against external influences. Particularly interesting is to identify the social characteristics of a voter population that renders it more resilient against opinion manipulation. Equally important is to determine which of the existing democratic electoral systems is more robust to external influences. Here we construct a mathematical electoral model to address these two questions. We find that, not unexpectedly, biased electorates with clear-cut elections are overall quite resilient against opinion manipulations, because inverting the election outcome requires to change the opinion of many voters. More interesting are unbiased or weakly biased electorates with close elections. We find that such populations are more resilient against opinion manipulations (i) if they are less polarized and (ii) when voters interact more with each other, regardless of their opinion differences, and that (iii) electoral systems based on proportional representation are generally the most robust. Our model qualitatively captures the volatility of the US House of Representatives elections. We take this as a solid validation of our approach.

physics.soc-ph

Locating the source of forced oscillations in transmission power grids

Forced oscillation event in power grids refers to a state where malfunctioning or abnormally operating equipment causes persisting periodic disturbances in the system. While power grids are designed to damp most of perturbations during standard operations, some of them can excite normal modes of the system and cause significant energy transfers across the system, creating large oscillations thousands of miles away from the source. Localization of the source of such disturbances remains an outstanding challenge due to a limited knowledge of the system parameters outside of the zone of responsibility of system operators. Here, we propose a new method for locating the source of forced oscillations which addresses this challenge by performing a simultaneous dynamic model identification using a principled maximum likelihood approach. We illustrate the validity of the algorithm on a variety of examples where forcing leads to resonance conditions in the system dynamics. Our results establish that an accurate knowledge of system parameters is not required for a successful inference of the source and frequency of a forced oscillation. We anticipate that our method will find a broader application in general dynamical systems that can be well-described by their linearized dynamics over short periods of time.

nlin.AO

Semicontraction and Synchronization of Kuramoto-Sakaguchi Oscillator Networks

This paper studies the celebrated Kuramoto-Sakaguchi model of coupled oscillators adopting two recent concepts. First, we consider appropriately-defined subsets of the $n$-torus called winding cells. Second, we analyze the semicontractivity of the model, i.e., the property that the distance between trajectories decreases when measured according to a seminorm. This paper establishes the local semicontractivity of the Kuramoto-Sakaguchi model, which is equivalent to the local contractivity for the reduced model. The reduced model is defined modulo the rotational symmetry. The domains where the system is semicontracting are convex phase-cohesive subsets of winding cells. Our sufficient conditions and estimates of the semicontracting domains are less conservative and more explicit than in previous works. Based on semicontraction on phase-cohesive subsets, we establish the "at most uniqueness" of synchronous states within these domains, thereby characterizing the multistability of this model.

math.DS

Broadcasting solutions on networked systems of phase oscillators

Networked systems have been used to model and investigate the dynamical behavior of a variety of systems. For these systems, different levels of complexity can be considered in the modeling procedure. On one hand, this can offer a more realistic and rich modeling option. On the other hand, it can lead to intrinsic difficulty in analyzing the system. Here, we present an approach to investigate the dynamics of Kuramoto oscillators on networks with different levels of connections: a network of networks. To do so, we utilize a construction in network theory known as the join of networks, which represents ``intra-area" and ``inter-area" connections. This approach provides a reduced representation of the original, multi-level system, where both systems have equivalent dynamics. Then, we can find solutions for the reduced system and broadcast them to the original network of networks. Moreover, using the same idea we can investigate the stability of these states, where we can obtain information on the Jacobian of the multi-level system by analyzing the reduced one. This approach is general for arbitrary connection schemes between nodes within the same area. Finally, our work opens the possibility of studying the dynamics of networked systems using a simpler representation, thus leading to a better understanding of the dynamical behavior of these systems.

math.DS

Multistability and anomalies in oscillator models of lossy power grids

The analysis of dissipatively coupled oscillators is challenging and highly relevant in power grids. Standard mathematical methods are not applicable, due to the lack of network symmetry induced by dissipative couplings. Here we demonstrate a close correspondence between stable synchronous states in dissipatively coupled oscillators, and the {winding partition} of their state space, a geometric notion induced by the network topology. Leveraging this winding partition, we accompany this article with an algorithms to compute all synchronous solutions of complex networks of dissipatively coupled oscillators. These geometric and computational tools allow us to identify anomalous behaviors of lossy networked systems. Counterintuitively, we show that loop flows and dissipation can increase the system's transfer capacity, and that dissipation can promote multistability. We apply our geometric framework to compute power flows on the IEEE RTS-96 test system, where we identify two high voltage solutions with distinct loop flows.

nlin.AO

Heavy-Tailed Distribution of the Number of Papers within Scientific Journals

Scholarly publications represent at least two benefits for the study of the scientific community as a social group. First, they attest of some form of relation between scientists (collaborations, mentoring, heritage,...), useful to determine and analyze social subgroups. Second, most of them are recorded in large data bases, easily accessible and including a lot of pertinent information, easing the quantitative and qualitative study of the scientific community. Understanding the underlying dynamics driving the creation of knowledge in general, and of scientific publication in particular can contribute to maintaining a high level of research, by identifying good and bad practices in science. In this article, we aim at advancing this understanding by a statistical analysis of publication within peer-reviewed journals. Namely, we show that the distribution of the number of papers published by an author in a given journal is heavy-tailed, but has lighter tail than a power law. Interestingly, we demonstrate (both analytically and numerically) that such distributions match the result of an modified preferential attachment process, where, on top of a Barabási-Albert process, we take finite career span of scientists into account.

cs.DL

Locating fast-varying line disturbances with the frequency mismatch

In an attempt to provide an efficient method for line disturbance identification in complex networks of diffusively coupled agents, we recently proposed to leverage the frequency mismatch. The frequency mismatch filters out the intricate combination of interactions induced by the network structure and quantifies to what extent the trajectory of each agent is affected by the disturbance. In this previous work, we provided some analytical evidence of its efficiency when the perturbation is assumed to be slow. In the present work, we claim that the frequency mismatch performs actually well for most disturbance regimes. This is shown through a series of simulations and is backed up by an analytical argument. Therefore, we argue that the frequency mismatch is an efficient and elegant tool for line disturbance location in complex networks of diffusively coupled agents.

nlin.AO

Reconstructing Network Structures from Partial Measurements

The dynamics of systems of interacting agents is determined by the structure of their coupling network. The knowledge of the latter is, therefore, highly desirable, for instance, to develop efficient control schemes, to accurately predict the dynamics, or to better understand inter-agent processes. In many important and interesting situations, the network structure is not known, however, and previous investigations have shown how it may be inferred from complete measurement time series on each and every agent. These methods implicitly presuppose that, even though the network is not known, all its nodes are. Here, we investigate the different problem of inferring network structures within the observed/measured agents. For symmetrically coupled dynamical systems close to a stable equilibrium, we establish analytically and illustrate numerically that velocity signal correlators encode not only direct couplings, but also geodesic distances in the coupling network within the subset of measurable agents. When dynamical data are accessible for all agents, our method is furthermore algorithmically more efficient than the traditional ones because it does not rely on matrix inversion.

nlin.AO

Network Inference using Sinusoidal Probing

The aim of this manuscript is to present a non-invasive method to recover the network structure of a dynamical system. We propose to use a controlled probing input and to measure the response of the network, in the spirit of what is done to determine oscillation modes in large electrical networks. For a large class of dynamical systems, we show that this approach is analytically tractable and we confirm our findings by numerical simulations of networks of Kuramoto oscillators. Our approach also allows us to determine the number of agents in the network by probing and measuring a single one of them.

math.DS

Locating line and node disturbances in networks of diffusively coupled dynamical agents

A wide variety of natural and human-made systems consist of a large set of dynamical units coupled into a complex structure. Breakdown of such systems can have a dramatic impact, as in the case of neurons in the brain or lines in an electric grid, to name but a few. Preventing such catastrophic events requires in particular to be able to detect and locate the source of disturbances as fast as possible. We propose a simple method to identify and locate disturbances in networks of coupled dynamical agents, relying only on time series measurements and on the knowledge of the (possibly Kron-reduced) network structure. The strength and the appeal of the present approach lies in its simplicity paired with the ability to precisely locate disturbances and even to differentiate between line and node disturbances. If we have access to measurement at only a subset of nodes, our method is still able to identify the location of the disturbance if the disturbed nodes are measured. If not, we manage to identify the region of the network where the disturbance occurs.

eess.SY

System Size Identification from Sinusoidal Probing in Diffusive Complex Networks

One of the most fundamental characteristic of a complex system is its size (or volume), which, in many modelling, is represented by the number of its individual components. Complex systems under investigation nowadays are typically large and/or time-varying, rendering their identification challenging. We propose here an accurate and efficient method to determine the size of (i.e., number of agents in) a complex, diffusively coupled dynamical system, that leverages the response of the system to an injected probing signal. For our method to be applicable, we rely on some assumptions on system's characteristics, namely, on the spectrum of the coupling graph and on the basin stability of its steady state(s). Even though such assumptions imply that our method cannot be applied to any instance of diffusively coupled group of dynamical agents, we argue that it covers relevant and interesting examples. Furthermore, the simplicity of the approach and its low computational complexity renders it very interesting for the systems to which it applies.

nlin.AO