Searcharxiv⌕ Search

arXiv subjects

Renaud Lambiotte

Publications and source records attributed to Renaud Lambiotte.

At least 19 recordsLinked to original sources

Skill erosion, individual memory and the reversibility of AI adoption

Generative AI can improve immediate performance but may erode the human skills needed for future work. We consider a population of agents who perform a task either with their own skill or with the help of AI. Agents tend to imitate more successful peers, and their skills evolve in time: improving with practice and eroding with reliance on AI. We study, analytically and with simulations, the collective consequences of AI adoption. We show that the mechanism of skill erosion makes adoption bistable and that the long-term behaviour of the population depends on how skills are distributed: populations with the same adoption and mean skill can reach opposite asymptotic states, depending on how expertise is shared between AI users and non-users. A deterministic description that follows the mean skills of the two groups and the variance of skills among non-users predicts the outcome of individual runs as accurately as the simulations allow, whereas the means alone are not sufficient. We also consider the situation when the benefit of AI improves in time. In that case, adoption can jump abruptly, and a temporary increase in benefit, such as in a period of low prices, can leave a population relying on AI after the benefit has returned to its original value. Skill erosion therefore creates a history-dependent switching cost that can make widespread AI adoption difficult to reverse.

cs.AI↗

Latent resonances in oscillator networks

In networks of coupled oscillators, from neural circuits to power grids, damping is expected to suppress oscillations because of its dissipativity. Here we show that local damping can, counterintuitively, amplify oscillations along some input-output channels, while the network's global oscillation energy decreases and its spectral properties improve. The amplified oscillation arises from a latent resonance that lies in the spectrum yet barely manifests. The added passive damping reshapes this resonance by mixing it with adjacent eigenmodes. In random power-grid networks, damping can boost weakly responding channels by more than an order of magnitude, while subdominant channels can grow to exceed the originally strongest channel. Damping thus not only suppresses oscillations but also provides a way to redistribute oscillatory energy. For any passive network, the amplified response and its upper bound follow exactly from baseline quantities, offering a principled route for network design and control.

eess.SY↗

Embedding stochastic dynamics in latent manifolds of recurrent neural networks

Recurrent neural networks (RNNs) provide a theoretical framework for understanding computation in biological neural circuits through their ability to support rich time-dependent behaviour. Whilst high-dimensional by construction, they can be used to encode low-dimensional dynamical systems, for example by restricting to low-rank connectivity, hence mirroring the emergence of latent neural manifolds found in empirical neural data. Here, we exploit a relationship between RNNs and a class of universal approximators to train networks that can represent arbitrary, nonlinear stochastic differential equations (SDEs), with given drift and diffusion coefficients, within a low-dimensional latent subspace. We show that RNNs can faithfully embed the drift and diffusion of a given SDE, including nonlinear and nonequilibrium dynamics such as chaotic attractors. We apply this approach by constructing RNN realisations of stochastic systems that transiently explore various attractors through both input-driven switching and autonomous transitions driven by nonequilibrium currents, which we interpret as models of associative and sequential (episodic) memory. To elucidate how these dynamics are encoded in the network, we introduce decompositions of the RNN based on its asymmetric connectivity and its time-irreversibility. Our results show that neural populations can implement a broad class of stochastic dynamics within low-dimensional manifolds, unifying ideas from the dynamics of neural computation, the theory of neural manifolds, associative memory, and nonequilibrium statistical mechanics.

cond-mat.dis-nn↗

From First Principles to Multi-scale Decomposition: Mutual Information as a Segregation Index

Segregation operates across demographic and spatial scales and requires careful and principled measurement. In this work, we derive mutual information from well-known general approaches to constructing segregation indices and interpret the mathematical properties that are unique to it. The properties relate mainly to its behaviour when demographic identities and spatial units are coarse-grained. Mutual information decomposes into the contributions of regions and supergroups, which reveals insights that would be inaccessible otherwise. We demonstrate this with an exploratory case study of residential ethnic segregation in England and Wales. Overall, we help researchers identify when mutual information is the only suitable segregation index and provide open source software to support multi-scale analysis.

physics.soc-ph↗

Community-Centers Identify Robust Biomarkers in High-Dimensional, Low-Sample-Size Gene Expression Data

High-dimensional, low-sample-size bulk gene expression data poses a fundamental challenge in transcriptomics, which typically includes tens of thousands of genes but relatively few samples, leading to overfitting and unstable selection for key features as biomarkers. We propose a regression by community centers (RCC) framework tailored for such data. RCC converts gene expression data into a feature proximity network and leverages the phase transition of the giant connected component to identify a critical distance threshold that yields a sparse yet maximally informative network representation, indicated by a minimum normalized shortest compression length. Intuitively, at the criticality, the network balances fragmentation and over-connectivity, allowing meaningful gene-gene associations communities to emerge while filtering noises, such that community-centers capture the most informative and non-redundant signals. These representative genes are then fed to a simple ordinary least squares (OLS) model for downstream predictions. Across five bulk gene expression datasets, RCC displays exceptional prediction performance, clearly outperforming benchmark methods, remains robust to missing data and noises, and does not rely on external biological knowledge. These results suggest that network-based representations provide an effective and general framework for high-dimensional, low-sample-size prediction tasks beyond transcriptomics and illustrate how network-science ideas can support robust learning in data-scarce regimes.

physics.soc-ph↗

A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks

Structural measures such as the clustering coefficient and the average shortest-path length characterise how a network is organised. These measures are typically formulated for real, non-negative edge weights. A class of quantum and photonic architectures has complex edge weights instead, whose phases determine whether alternative routes interfere constructively or destructively. These architectures are also bipartite, so triangles are absent and the smallest closed cycle is a four-node square. Existing measures address complex weights and bipartite structure separately: bipartite clustering coefficients quantify clustering through four-node squares but do not contain phase information, while interferometric coefficients retain phase but are defined on triangles. In this work, we define a clustering coefficient for complex-weighted bipartite networks which reduces to the classical bipartite coefficient when the phases vanish, becomes negative when alternative routes cancel, and can be obtained for all nodes from a single sparse matrix product. We show that the phase accumulated around a square is the smallest gauge-invariant carrier of structural phase information in a bipartite network. The clustering coefficient factorises into a topological contribution and a phase contribution, making a bipartite Watts--Strogatz ensemble analytically tractable. For phases uniformly distributed on $[-Δ,Δ]$, the mean phase contribution is $(\sinΔ/Δ)^4$, independent of node, degree, and topology. We also derive closed-form expressions for the clustering coefficient, open-path visibility, and phase variance. We numerically verify these predictions and further show that phase disorder increases coherent distance.

physics.soc-ph↗

Social Physics: A manifesto

Social Physics seeks quantitative, empirically testable explanations of collective human behavior. Its name has a long and contested history, but its contemporary program is neither the claim that society is literally a physical system nor an attempt to replace the social sciences with physics. It is an interdisciplinary practice: observation and experimentation, model construction, mathematical and computational analysis, and repeated confrontation with data. The field has been transformed by analyzing digital traces, network science, agent-based modeling, large-scale experiments, and the capacity to study coupled dynamics across economic, social, technological, biological, and physical layers. We review advances in financial analysis and modeling; economic complexity; the structure and evolution of social networks; spreading, opinion, and information dynamics; inequality, cooperation, conflict, mobility, cities, culture, science, and collective behavior; and the emerging study of human-AI ecosystems. Across these domains, common features recur - heterogeneity, interaction, feedback, adaptation, non-equilibrium dynamics, multiscale organization, and emergent collective outcomes. We also confront the limitations that have arisen in this field: convenience samples, platform dependence, weak causal identification, over-universal claims, insufficient engagement with meaning and institutions, privacy risks, and the danger that predictive models become instruments of manipulation. We propose a future Social Physics organized around theory - data reciprocity; causal and generative explanation; measurement validity and cross-context generalization; responsible, participatory data governance; genuinely interdisciplinary collaboration; and reflexive study of interventions and algorithms that alter the systems being observed.

physics.soc-ph↗

Do Higher-Order Models Win for Higher-Order Reasons? Rethinking Performance Gains in Hypergraph Learning

Higher-order models (e.g., hypergraph neural networks) often outperform lower-order baselines on hypergraph learning benchmarks, and their advantages are commonly attributed to their ability to exploit higher-order information. However, better performance alone does not establish this explanation. We therefore ask: Do higher-order models win for higher-order reasons? To investigate this question, we introduce a controlled performance-attribution framework that perturbs higher-order information while preserving the lower-order, i.e., pairwise, information. Across 25 commonly used hypergraph learning benchmarks spanning three tasks, we frequently observe an intriguing pattern: higher-order models originally outperform lower-order baselines, yet retain most of their advantage after perturbation. This suggests that much of the observed advantage remains achievable without the higher-order information. We then investigate potential lower-order explanations for these remaining gaps. We find that simple additions to a lower-order baseline, e.g., richer pairwise weighting, more steps of pairwise feature propagation, and normalization, reduce the remaining performance gaps, supporting lower-order explanations for part of the observed advantage. Our analysis calls for the hypergraph learning community to rethink performance attribution by distinguishing performance gains from their explanations, adopt stronger lower-order baselines, and use suitable benchmarks that better test the value of higher-order information.

cs.LG↗

Parametric and structure-aware information theory for multi-scale analysis of composition

Compositional data is common across the natural and social sciences, requiring methods to measure the diversity of compositions and the heterogeneity of collections of them. Via Bregman geometry, a strictly concave diversity index induces a measure of heterogeneity that decomposes across scales. A canonical example is Shannon entropy inducing mutual information. We develop this framework by incorporating category similarity into $α$-logarithmic entropy, a parametric diversity index. We disprove an existing general concavity result and prove that, for $α=3$, the region of strict concavity is always convex, complementing previous results for $α=1$ and $2$. The resulting geometry provides methods to compare compositions substantially faster than optimal transport. Applied to occupation compositions across England and Wales, they reveal distinct regionalisations based on different notions of occupation relatedness. Applied to ecological data, they recover established patterns of functional and taxonomic $β$-diversity, and reveal sensitivity to the diversity parameter.

cs.IT↗

Inferring Temporal Dependencies from Social Time Series with the Cross-Correlogram

Characterizing temporal interactions in social systems is challenging because social behavior can be bursty and non-stationary, violating the stationarity assumptions of many methods used to measure temporal dependence. The cross-correlogram, an existing technique used to profile neural excitations and inhibitions, offers an interpretable alternative to methods such as Granger causality or co-occurrence, as it produces a full profile of lagged dependence directly from event times rather than a single summary statistic. We adapt the cross-correlogram by integrating functional models of behavior with data-driven temporal response profiling. By characterizing how periodic structure biases traditional cross-correlograms, we propose a correction based on smooth intensity functions, specified from a known functional form or estimated empirically. This approach provides a robust, interpretable estimator of temporal dependency profiles even when collective rhythms operate on timescales that overlap those of the interactions of interest. We demonstrate theoretically and through simulation that the proposed method recovers temporal dependencies in periodic regimes, outperforming interval-jitter and Granger causality methods. Finally, we apply the method to 3.1 million event times from X (formerly Twitter) collected between 2019 and 2020, demonstrating how cross-correlograms reveal delayed temporal relationships in collective online behavior that are missed by co-occurrence measures. For a subset of television-related hashtags, recovered delays align with known broadcast schedules, providing evidence that the proposed method captures genuine temporal structure rather than artifacts of shared attention cycles.

cs.SI↗

Embedding networks with the random walk first return time distribution

We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any pair of nodes using standard metrics for discrete distributions. We present several arguments to motivate the FRTD embedding. First, we show that FRTDs are strictly more informative than eigenvalue spectra, yet insufficient for complete graph identification, thus placing FRTD equivalence between cospectrality and isomorphism. Second, we argue that FRTD equivalence between nodes captures structural similarity. Third, we empirically demonstrate that the FRTD embedding outperforms manually designed graph metrics in network alignment tasks. Finally, we show that random networks that approximately match the FRTD of a desired target also preserve other salient features. Together these results demonstrate the FRTD as a simple and mathematically principled embedding for complex networks.

cs.SI↗

The impact of the path ensemble on path percolation

Traffic-induced failures, from packet loss in communication networks to congestion breakdown in transport systems, occur when flows progressively exhaust the edges they traverse. Path percolation models this process by removing edges along sampled origin-destination paths. Existing work assumes locally tree-like networks and deterministic shortest-path routing, leaving unclear how path degeneracy and routing stochasticity affect fragmentation in the clustered networks typical of real systems. We introduce a generalised path-percolation framework where paths are drawn from a temperature-controlled routing ensemble interpolating between geodesic and noisy transport. We argue based on box-covering renormalisation and our numerical experiments that, for any finite routing horizon $C$, the process coarse-grains to ordinary mean-field percolation. Routing details affect non-universal quantities, especially the percolation threshold $p_c$, through the entropy of the load distribution and the capacity of finite clusters to accommodate flow. Load entropy therefore acts as a robustness measure for networks under path-based failures. When the routing horizon is tuned to the mean-field correlation length, $C=N^{1/3}$, within a source-uniform ensemble, the system enters a crossover regime with scaling exponents distinct from shortest-path percolation with infinite budget. In this regime, path elongation becomes decoupled in time from structural fragmentation: the characteristic path length reaches a growing maximum, associated with routing temperature, asymptotically ahead of the collapse of the giant component. These results clarify how microscopic routing organisation shapes macroscopic resilience, and identify path elongation as a measurable precursor of failure in communication and transport infrastructure.

physics.soc-ph↗

Synchronization of higher-dimensional Kuramoto oscillators on networks: from scalar to matrix-weighted couplings

The Kuramoto model is the paradigmatic model to study synchronization in coupled oscillator systems. In its classical formulation, the oscillators move on the unit circle, each characterized by a scalar phase and a natural frequency, by interacting through a sinusoidal coupling. In this work, we propose a d-dimensional generalization in which oscillators are represented as unit vectors on the (d-1)-sphere and interact through a matrix-weighted network (MWN), a recently introduced framework where links are endowed with a matrix weight instead of a scalar one. We derive necessary conditions for global synchronization via a Master Stability Function approach: the existence of a synchronous solution requires identical frequency matrices across nodes and, in the MWN case, a coherence condition on the network structure. Through a suitable change of variables, the stability analysis reduces the full Nd-dimensional problem to a family of d-dimensional eigenvalue problems, each one parametrized by the eigenvalue of a suitable scalar weighted Laplacian, showing that the synchronous solution is locally stable for any positive coupling strength K on any connected network. Analytical results are complemented by numerical simulations.

cond-mat.stat-mech↗

Permutation-Invariant Spectral Learning via Dyson Diffusion

Diffusion models are central to generative modeling and have been adapted to graphs by diffusing adjacency matrix representations. The challenge of having up to $n!$ such representations for graphs with $n$ nodes is only partially mitigated by using permutation-equivariant learning architectures. Despite their computational efficiency, existing graph diffusion models struggle to distinguish certain graph families and their spectra, unless graph data are augmented with ad hoc features. This shortcoming stems from enforcing the inductive bias within the learning architecture. In this work, we leverage random matrix theory to analytically extract the spectral properties of the diffusion process, allowing us to push most of the inductive bias from the architecture into the dynamics. Building on this, we introduce the Dyson Diffusion Model, which employs Dyson's Brownian motion to capture the spectral dynamics of an Ornstein-Uhlenbeck process on the adjacency matrix. Furthermore, conditioned on the spectral dynamics, we formulate a Lie group diffusion, appropriately modeling the remaining degrees of freedom. Strikingly, the resulting learning problem becomes permutation invariant at the Lie algebra level. We demonstrate that the Dyson Diffusion Model learns graph spectra accurately and outperforms existing graph diffusion models.

stat.ML↗

The nestedness of higher-order networks

In contrast to dyadic interactions, higher-order interactions may contain one another, with subgroups naturally embedded within larger groups. These containment patterns arise empirically in ecology, sociology, computer science and the science of science, and have been studied under the names nestedness, simpliciality, encapsulation, and inclusion. In this chapter, we review each of these measures and unify them through a mathematical object known as the encapsulation directed acyclic graph, formulating each measure as a function of its properties. We demonstrate that nested structure is prevalent in social systems across several domains, show that different measures capture complementary aspects of this structure, and find that the absence of nestedness can itself be a powerful indicator of the mesoscale organization of a system.

physics.soc-ph↗

Coarse-graining nonequilibrium diffusions with Markov chains

We investigate nonequilibrium steady-state dynamics in both continuous- and discrete-state stochastic processes. Our analysis focuses on planar diffusion dynamics and their coarse-grained approximations by discrete-state Markov chains. Using finite-volume approximations, we derive an approximate master equation directly from the underlying diffusion and show that this discretisation preserves key features of the nonequilibrium steady-state. In particular, we show that the entropy production rate of the approximation converges as the number of discrete states goes to the limit. These results are illustrated with analytically solvable diffusions and numerical experiments on nonlinear processes, demonstrating how this approach can be used to explore the dependence of the entropy production rate on model parameters. Finally, we address the problem of inferring discrete-state Markov models from continuous stochastic trajectories. We show that discrete-state models significantly underestimate the true entropy production rate. However, we also show that they can provide tests to determine if a stationary planar diffusion is out of equilibrium. This property is illustrated with both simulated data and empirical trajectories from schooling fish.

cond-mat.stat-mech↗

Needles in a haystack: using forensic network science to uncover insider trading

Although the automation and digitisation of anti-financial crime investigation has made significant progress in recent years, detecting insider trading remains a unique challenge, partly due to the limited availability of labelled data. To address this challenge, we propose using a data-driven networks approach that flags groups of corporate insiders who report coordinated transactions that are indicative of insider trading. Specifically, we leverage data on 2.9 million trades reported to the U.S. Securities and Exchange Commission (SEC) by company insiders (C-suite executives, board members and major shareholders) between 2014 and 2024. Our proposed algorithm constructs weighted edges between insiders based on the temporal similarity of their trades over the 10-year timeframe. Within this network we then uncover trends that indicate insider trading by focusing on central nodes and anomalous subgraphs. To highlight the validity of our approach we evaluate our findings with reference to two null models, generated by running our algorithm on synthetic empirically calibrated and shuffled datasets. The results indicate that our approach can be used to detect pairs or clusters of insiders whose behaviour suggests insider trading and/or market manipulation.

cs.SI↗

Global Synchronization in Matrix-Weighted Networks

Synchronization phenomena in complex systems are fundamental to understanding collective behavior across disciplines. While classical approaches model such systems by using scalar-weighted networks and simple diffusive couplings, many real-world interactions are inherently multidimensional and transformative. To address this limitation, Matrix-Weighted Networks (MWNs) have been introduced as a versatile framework where edges are associated with matrix weights that encode both interaction strength and directional transformation. In this work, we investigate the emergence and stability of global synchronization (GS) in MWNs by studying coupled Stuart-Landau (SL) oscillators, an archetypal model of nonlinear dynamics near a Hopf bifurcation. Besides the SL, we considered a generalization of regular oscillators to higher dimensions and also the Lorenz model as a prototype of chaotic oscillators. We derive a generalized Master Stability Function (MSF) tailored to MWNs and establish necessary and sufficient conditions for GS to occur. Central to our analysis is the concept of coherence, a structural property of MWNs ensuring path-independent transformations. Our results show that coherence is necessary to have global synchronization and provides a theoretical foundation for analyzing multidimensional dynamical processes in complex networked systems.

cond-mat.stat-mech↗