Topic overview

physics.soc-ph

1624 works4966 researchers0 institutions

Topic snapshot

What this area looks like now

1624works
4966authors
0experts visible
0communities

Next steps

Move from topic reading into action

The graph preview below keeps the nearby papers, people and communities visible in the same reading flow.

Topic graph

See the topic as a live network

Open full explorer

Inspect nearby papers, researchers, institutions and communities without opening a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Papers in this area

24 featured work(s)

preprint2026arXiv

Scalable inference of spatial regions and temporal signatures from time series

Regionalization aims to partition a spatial domain into contiguous regions that share similar characteristics, enabling more effective spatial analysis, policy making, and resource management. Existing approaches for spatial regionalization typically rely on static spatial snapshots rather than evolving time series. Meanwhile, most time series clustering methods ignore spatial structure or enforce spatial continuity through ad hoc regularization, constraining the number of inferred regions a priori either explicitly or implicitly. Utilizing the minimum description length principle from information theory, here we propose an efficient and fully nonparametric framework for the regionalization of spatial time series. Our method jointly infers a spatial partition along with a set of representative time series archetypes ("drivers") that best compress a spatiotemporal dataset, with a runtime log-linear in the number of time series. We demonstrate that this method can accurately recover planted regional structure and drivers in synthetic time series, and can extract meaningful structural regularities in large-scale empirical air quality and vegetation index records. Our method provides a principled and scalable framework for spatially contiguous partitioning, allowing interpretable temporal patterns and homogeneous regions to emerge directly from the data itself.

preprint2022arXiv

Comparison of different methods of spatial disaggregation of electricity

Energy system models involve various input data sets representing the generation, consumption and transport infrastructure of electricity. Especially energy system models with a focus on the transmission grid require time series of electricity feed-in and consumption in a high spatial resolution. In general, there are two approaches to obtain regionalized time series: top-down and bottom-up. In many cases, both methodologies may be combined to aggregate or disaggregate input data. Furthermore, there exist various approaches to assign regionalized feed-in of renewable energy sources and electrical load to the model's grid connection points. The variety in the regionalization process leads to significant differences on a regional scope, even if global values are the same. We develop a methodology to compare regionalization techniques of input data for photovoltaics, wind and electrical load between various models as well as data assignment techniques to the power grid nodes. We further define two invariants to evaluate the outcome of the regionalization process at the NUTS 3 level, one invariant for the annual profiles and one for the installed capacities. This methodology enabled us to compare different regionalization and assignment workflows using simple parameters, without explicit knowledge of grid topology. Our results show that the resolution of the input data and the use of a top-down or a bottom-up approach are the most determinant factors in the regionalization process.

preprint2026arXiv

Gated Multimodal Learning for Interpretable Property Energy Performance Prediction and Retrofit Scenario Analysis

Achieving resilient and sustainable cities requires scalable approaches to decarbonising residential buildings, which account for about 20% of UK greenhouse gas emissions and 25% of energy-related emissions in the European Union. Energy Performance Certificates (EPCs) support regulation and retrofit planning, but their reliance on on-site inspections limits timely city-scale assessment. This study introduces a gated multimodal model to predict Standard Assessment Procedure (SAP) energy efficiency and Environmental Impact (EI) scores by integrating EPC tabular variables, assessor-written free text, and Geographic Information System (GIS)-derived spatial features describing footprint geometry, height, area, and orientation. Sample-wise gating learns property-specific modality weights, while an auxiliary band classification head stabilises training. In a Westminster, London case study, the model predicts SAP and EI scores with MAEs of 4.03 and 4.76 points and R2 values of 0.757 and 0.748, respectively, achieving a mean MAE of 4.39. Ablation results show that full multimodal fusion outperforms unimodal and bimodal baselines for both score prediction and band-level classification. Interpretability analyses provide decision-relevant evidence: gating weights indicate strong reliance on assessor text; SHAP highlights main fuel, built form, and construction age band; text occlusion prioritises roof and wall fields; and spatial attribution is dominated by height and footprint area, with sensitivity to footprint shape. The validated framework is further applied to retrofit scenarios for wall insulation, roof insulation, and window glazing upgrades, indicating projected improvements in SAP, EI, annual energy cost, and equivalent CO2 emissions. Overall, the framework provides scalable property-level evidence for retrofit screening, intervention prioritisation, and net-zero housing transitions.

preprint2022arXiv

A new Model of City Growth and its Application to a middle sized French City

In the first part of this paper we propose a new theoretical model of city growth based on percolation. The second half oh the paper is devoted to a concrete application of the model, namely to the city of Montargis. It appears that the embedded algorithm is quite efficient in terms of computational time and allows to exploit big data type ressources such as individual land lots.

preprint2015arXiv

Single-Seed Cascades on Clustered Networks

We consider a dynamic network cascade process developed by Watts applied to a random networks with a specified amount of clustering, belonging to a class of random networks developed by Newman. We adapt existing tree-based methods to formulate an appropriate two-type branching process to describe the spread of a cascade started with a single active node, and obtain a fixed-point equation to implicitly express the extinction probability of such a cascade. In so doing, we also recover a special case of a formula of Hackett et al. giving conditions for certain extinction of the cascade.

preprint2022arXiv

Group interactions modulate critical mass dynamics in social convention

How can minorities of individuals overturn social conventions? The theory of critical mass states that when a committed minority reaches a critical size, a cascade of behavioural changes can occur, overturning apparently stable social norms. Evidence comes from theoretical and empirical studies in which minorities of very different sizes, including extremely small ones, manage to bring a system to its tipping point. Here, we explore this diversity of scenarios by introducing group interactions as a crucial element of realism into a model for social convention. We find that the critical mass necessary to trigger behaviour change can be very small if individuals have a limited propensity to change their views. Moreover, the ability of the committed minority to overturn existing norms depends in a complex way on the group size. Our findings reconcile the different sizes of critical mass found in previous investigations and unveil the critical role of groups in such a process. This further highlights the importance of the emerging field of higher-order networks, beyond pairwise interactions

preprint2021arXiv

Relative Canonical Network Ensembles -- (Mis)characterizing Small-World Networks

What do generic networks that have certain properties look like? We define Relative Canonical Network ensembles as the ensembles that realize a property R while being as indistinguishable as possible from a generic network ensemble. This allows us to study the most generic features of the networks giving rise to the property under investigation. To test the approach we apply it first to the network measure "small-world-ness", thought to characterize small-world networks. We find several phase transitions as we go to less and less generic networks in which cliques and hubs emerge. Such features are not shared by typical small-world networks, showing that high "small-world-ness" does not characterize small-world networks as they are commonly understood. On the other hand we see that for embedded networks, the average shortest path length and total Euclidean link length are better at characterizing small-world networks, with hubs that emerge as a defining feature at low genericity. We expect the overall approach to have wide applicability for understanding network properties of real world interest.

preprint2023arXiv

The strong effect of network resolution on electricity system models with high shares of wind and solar

Energy system modellers typically choose a low spatial resolution for their models based on administrative boundaries such as countries, which eases data collection and reduces computation times. However, a low spatial resolution can lead to sub-optimal investment decisions for wind and solar generation. Ignoring power grid bottlenecks within regions tends to underestimate system costs, while combining locations with different wind and solar capacity factors in the same resource class tends to overestimate costs. We investigate these two competing effects in a capacity expansion model for Europe's power system with a high share of renewables, taking advantage of newly-available high-resolution datasets as well as computational advances. We vary the number of nodes, interpolating between a 37-node model based on country and synchronous zone boundaries, and a 1024-node model based on the location of electricity substations. If we focus on the effect of renewable resource resolution and ignore network restrictions, we find that a higher resolution allows the optimal solution to concentrate wind and solar capacity at sites with better capacity factors and thus reduces system costs by up to 10% compared to a low resolution model. This results in a big swing from offshore to onshore wind investment. However, if we introduce grid bottlenecks by raising the network resolution, costs increase by up to 23% as generation has to be sourced more locally at sites with worse capacity factors. These effects are most pronounced in scenarios where grid expansion is limited, for example, by low local acceptance. We show that allowing grid expansion mitigates some of the effects of the low grid resolution, and lowers overall costs by around 16%.

preprint2026arXiv

BEHAVE: A Hybrid AI Framework for Real-Time Modeling of Collective Human Dynamics

Existing AI systems for modeling human behavior operate at the level of individuals or detect events after they occur. As a result, they systematically fail to capture the collective dynamics that determine whether a group remains stable or transitions into escalation or breakdown. We propose a different foundation: a group of interacting humans constitutes a complex dynamical system in the precise mathematical sense, exhibiting emergence, nonlinearity, feedback loops, sensitivity near critical points, and phase transitions between qualitatively distinct regimes. The state of such a system is not located within any single participant; it is distributed across mutual influence loops and observable through the micro-dynamics of the body. We introduce BEHAVE (Behavioral Engine for Human Activity Vector Estimation), a formal framework that models collective dynamics as continuous behavioral fields defined over an interaction space derived from observable physical signals. Kinematic micro-signals (position, velocity, body orientation, gestural activity) are structured into a directed interaction graph and aggregated into a basis of behavioral fields capturing distinct, non-redundant axes of collective state. The framework rests on one theorem and two structural propositions characterizing the tension field, the field basis, and the criticality index. Perception and forecasting layers are implemented using neural models, enabling data-driven learning and approximation of system dynamics. BEHAVE is formulated as a computational system for learning, representing, and forecasting collective dynamics from data. A working pipeline is demonstrated on a 7-agent negotiation snapshot. The same fields, recalibrated, apply to crowd safety, crisis-team dynamics, education, and clinical contexts.

preprint2026arXiv

Emergent Self-Attention from Astrocyte-Gated Associative Memory Dynamics

We introduce a Hopfield-type associative memory in which effective connectivity is multiplicatively modulated by astrocytic gains evolving under an entropy-regularized replicator equation. The coupled neuron-astrocyte dynamics admit a Lyapunov function, ensuring global convergence. At fixed points, astrocytic gains implement a softmax-normalized allocation over pattern similarity scores, yielding a mechanistic realization of self-attention as emergent routing on the gain simplex. In regimes of high memory load and interference, the model significantly improves retrieval accuracy relative to classical Hopfield dynamics and recent neuron-astrocyte baselines. These results establish a dynamical systems framework linking glial modulation, competitive resource allocation, and attention-like computation.

preprint2022arXiv

Efficient Stochastic Simulation of Network Topology Effects on the Peak Number of Infections in Epidemic Outbreaks

This paper investigates the effect of the structure of the contact network on the dynamics of the epidemic outbreak. In particular, we focus on the peak number of critically infected nodes (PCIN), determining the maximum workload of intensive healthcare units which should be kept low. As a model and simulation method, we develop a continuous-time Markov chain (CTMC) model and an efficient simulation-based on Gillespie's Stochastic Simulation Algorithm (SSA). This methods combine a realistic approximation of the stochastic process not relying on the assumptions of mean-field models and large asymptotically large population sizes as in differential equation models, and at the same time an efficient way to simulate networks of moderate size. The approach is analysed for different scenarios, based on data from the COVID-19 outbreak and demographic data from Ukraine. From these results we extract network topology features that need to be considered to effectively decrease the peak number of infections. The CTMC simulation is implemented in python and integrated in a dashboard that can be used for interactive exploration and it is made openly available.

preprint2021arXiv

Renewable Generation Data for European Energy System Analysis

In the process of decarbonization, the global energy mix is shifting from fossil fuels to renewables. To study decarbonization pathways, large-scale energy system models are utilized. These models require accurate data on renewable generation to develop their full potential. Using different data can lead to conflicting results and policy advice. In this work, we compare several datasets that are commonly used to study the transition towards highly renewable European power system. We find significant differences between these datasets and cost-difference of about 10% result in the different energy mix. We conclude that much more attention must be paid to the large uncertainties of the input data.

preprint2023arXiv

Emergence of Urban Heat Traps from the Intersection of Human Mobility and Heat Hazard Exposure in Cities

Understanding the relationship between spatial structures of cities and environmental hazard exposures (such as urban heat) is essential for urban health and sustainability planning. However, a critical knowledge gap exists in terms of the extent to which socio-spatial networks shaped by human mobility exacerbate or alleviate urban heat exposures of populations in cities. In this study, we utilize location-based data to construct human mobility networks in twenty metropolitan areas in the U.S. The human mobility networks are analyzed in conjunction with the urban heat characteristics of spatial areas. We identify areas with high and low urban heat exposure and evaluate visitation patterns of populations residing in high and low urban heat areas to other spatial areas with similar and dissimilar urban heat exposure. The results reveal the presence of urban heat traps in the majority of the studied metropolitan areas in which populations residing in high heat exposure areas primarily visit areas with high heat exposure. The results also show a small percentage of human mobility to produce urban heat escalate (visitations from low heat areas to high heat areas) and heat escapes (movements from high heat areas to low heat areas). The findings from this study provide a better understanding of urban heat exposure in cities based on patterns of human mobility. These finding contribute to a broader understanding of the intersection of human network dynamics and environmental hazard exposures in cities to inform more integrated urban design and planning to promote health and sustainability.

preprint2026arXiv

LLM hallucinations in the wild: Large-scale evidence from non-existent citations

Large language models (LLMs) are known to generate plausible but false information across a wide range of contexts, yet the real-world magnitude and consequences of this hallucination problem remain poorly understood. Here we leverage a uniquely verifiable object - scientific citations - to audit 111 million references across 2.5 million papers in arXiv, bioRxiv, SSRN, and PubMed Central. We find a sharp rise in non-existent references following widespread LLM adoption, with a conservative estimate of 146,932 hallucinated citations in 2025 alone. These errors are diffusely embedded across many papers but especially pronounced in fields with rapid AI uptake, in manuscripts with linguistic signatures of AI-assisted writing, and among small and early-career author teams. At the same time, hallucinated references disproportionately assign credit to already prominent and male scholars, suggesting that LLM-generated errors may reinforce existing inequities in scientific recognition. Preprint moderation and journal publication processes capture only a fraction of these errors, suggesting that the spread of hallucinated content has outpaced existing safeguards. Together, these findings demonstrate that LLM hallucinations are infiltrating knowledge production at scale, threatening both the reliability and equity of future scientific discovery as human and AI systems draw on the existing literature.

preprint2022arXiv

Predicting Stability of Community Members in Complex Networks

In this work, we analyse and predict the stability of communities in complex networks. We use a variant of closeness centrality, known as profile closeness, to measure the loyalty of a member towards its community. We show that the profile closeness is an adequate indicator of how communities evolve in a network. We investigate this in static as well as dynamic (temporal) networks and establish the relevance of profile closeness in predicting the evolution of a complex network. Keywords: Small world networks , Centrality , Community , Closeness , Clustering

preprint2021arXiv

Optimizing Graph Structure for Targeted Diffusion

The problem of diffusion control on networks has been extensively studied, with applications ranging from marketing to controlling infectious disease. However, in many applications, such as cybersecurity, an attacker may want to attack a targeted subgraph of a network, while limiting the impact on the rest of the network in order to remain undetected. We present a model POTION in which the principal aim is to optimize graph structure to achieve such targeted attacks. We propose an algorithm POTION-ALG for solving the model at scale, using a gradient-based approach that leverages Rayleigh quotients and pseudospectrum theory. In addition, we present a condition for certifying that a targeted subgraph is immune to such attacks. Finally, we demonstrate the effectiveness of our approach through experiments on real and synthetic networks.

preprint2024arXiv

Agent based network modelling of COVID-19 disease dynamics and vaccination uptake in a New South Wales Country Township

We employ an agent-based contact network model to study the relationship between vaccine uptake and disease dynamics in a hypothetical country town from New South Wales, Australia, undergoing a COVID-19 epidemic, over a period of three years. We model the contact network in this hypothetical township of N = 10000 people as a scale-free network, and simulate the spread of COVID-19 and vaccination program using disease and vaccination uptake parameters typically observed in such a NSW town. We simulate the spread of the ancestral variant of COVID-19 in this town, and study the disease dynamics while the town maintains limited but non-negligible contact with the rest of the country which is assumed to be undergoing a severe COVID-19 epidemic. We also simulate a maximum three doses of Pfizer Comirnaty vaccine being administered in this town, with limited vaccine supply at first which gradually increases, and analyse how the vaccination uptake affects the disease dynamics in this town, which is captured using an extended compartmental model with epidemic parameters typical for a COVID-19 epidemic in Australia. Our results show that, in such a township, three vaccination doses are sufficient to contain but not eradicate COVID-19, and the disease essentially becomes endemic. We also show that the average degree of infected nodes (the average number of contacts for infected people) predicts the proportion of infected people. Therefore, if the hubs (people with a relatively high number of contacts) are disproportionately infected, this indicates an oncoming peak of the infection, though the lag time thereof depends on the maximum number of vaccines administered to the populace. Overall, our analysis provides interesting insights in understanding the interplay between network topology, vaccination levels, and COVID-19 disease dynamics in a typical remote NSW country town.

preprint2026arXiv

Fusion-fission forecasts when AI will shift to undesirable behavior

The key problem facing ChatGPT-like AI's use across society is that its behavior can shift, unnoticed, from desirable to undesirable -- encouraging self-harm, extremist acts, financial losses, or costly medical and military mistakes -- and no one can yet predict when. Shifts persist in even the newest AI models despite remarkable progress in AI modeling, post-training alignment and safeguards. Here we show that a vector generalization of fusion-fission group dynamics observed in living and active-matter systems drives -- and can forecast -- future shifts in the AI's behavior. The shift condition, which is also derivable mathematically, results from group-level competition between the conversation-so-far (C) and the desirable (B) and undesirable (D) basin dynamics which can be estimated in advance for a given application. It is neither model-specific nor driven by stochastic sampling. We validate it across six independent tests, including: 90 percent correct across seven AI models spanning two orders of magnitude in parameter count (124M-12B); production-scale persistence across ten frontier chatbots; and a priori time-stamped prediction eleven months before the Stanford 'Delusional Spirals' corpus appeared, and independently confirmed by that corpus of 207,443 human-AI exchanges. Because it sits architecturally below the current safety stack, the same formula provides a real-time warning signal that current alignment does not supply, portable across current and future ChatGPT-like AI architectures and instantiable in application domains where competing response classes can be defined.

preprint2025arXiv

Reducibility of higher-order networks from dynamics

Empirical complex systems can be characterized not only by pairwise interactions, but also by higher-order (group) interactions influencing collective phenomena, from metabolic reactions to epidemics. Nevertheless, higher-order networks' apparent superior descriptive power -- compared to classical pairwise networks -- comes with a much increased model complexity and computational cost, challenging their application. Consequently, it is of paramount importance to establish a quantitative method to determine when such a modeling framework is advantageous with respect to pairwise models, and to which extent it provides a valuable description of empirical systems. Here, we propose an information-theoretic framework, accounting for how structure affect diffusion behaviors, quantifying the entropic cost and distinguishability of higher-order interactions to assess their reducibility to lower-order structures while preserving relevant functional information. Empirical analyses indicate that some systems retain essential higher-order structure, whereas in some technological and biological networks it collapses to pairwise interactions. With controlled randomization procedures, we investigate the role of nestedness and degree heterogeneity in this reducibility process. Our findings contribute to ongoing efforts to minimize the dimensionality of models for complex systems.

preprint2026arXiv

Conformity Generates Collective Misalignment in AI Agents Societies

Artificial intelligence safety research focuses on aligning individual language models with human values, yet deployed AI systems increasingly operate as interacting populations where social influence may override individual alignment. Here we show that populations of individually aligned AI agents can be driven into stable misaligned states through conformity dynamics. Simulating opinion dynamics across nine large language models and one hundred opinion pairs, we find that each agent's behavior is governed by two competing forces: a tendency to follow the majority and an intrinsic bias toward specific positions. Using tools from statistical physics, we derive a quantitative theory that predicts when populations become trapped in long-lived misaligned configurations, and identifies predictable tipping points where small numbers of adversarial agents can irreversibly shift population-level alignment even after manipulation ceases. These results demonstrate that individual-level alignment provides no guarantee of collective safety, calling for evaluation frameworks that account for emergent behavior in AI populations.

preprint2022arXiv

Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game

We investigate symmetric equilibria of mutual reinforcement learning when both players alternately learn the optimal memory-two strategies against the opponent in the repeated prisoners' dilemma game. We provide a necessary condition for memory-two deterministic strategies to form symmetric equilibria. We then provide three examples of memory-two deterministic strategies which form symmetric mutual reinforcement learning equilibria. We also prove that mutual reinforcement learning equilibria formed by memory-two strategies are also mutual reinforcement learning equilibria when both players use reinforcement learning of memory-$n$ strategies with $n>2$.

preprint2023arXiv

Generic catastrophic poverty when selfish investors exploit a degradable common resource

The productivity of a common pool of resources may degrade when overly exploited by a number of selfish investors, a situation known as the tragedy of the commons (TOC). Without regulations, agents optimize the size of their individual investments into the commons by balancing incurring costs with the returns received. The resulting Nash equilibrium involves a self-consistency loop between individual investment decisions and the state of the commons. As a consequence, several non-trivial properties emerge. For $N$ investing actors we prove rigorously that typical payoffs do not scale as $1/N$, the expected result for cooperating agents, but as $(1/N)^2$. Payoffs are hence reduced with regard to the functional dependence on $N$, a situation denoted catastrophic poverty. We show that catastrophic poverty results from a fine-tuned balance between returns and costs. Additionally, a finite number of oligarchs may be present. Oligarchs are characterized by payoffs that are finite and not decreasing when $N$ increases. Our results hold for generic classes of models, including convex and moderately concave cost functions. For strongly concave cost functions the Nash equilibrium undergoes a collective reorganization, being characterized instead by entry barriers and sudden death forced market exits.

preprint2022arXiv

Propagation of disruptions in supply networks of essential goods: A population-centered perspective of systemic risk

The Covid-19 pandemic drastically emphasized the fragility of national and international supply networks (SNs),leading to significant supply shortages of essential goods for people, such as food and medical equipment. Severe disruptions that propagate along complex SNs can expose the population of entire regions or even countries to these risks. A lack of both, data and quantitative methodology, has hitherto hindered us to empirically quantify the vulnerability of the population to disruptions. Here we develop a data-driven simulation methodology to locally quantify actual supply losses for the population that result from the cascading of supply disruptions. We demonstrate the method on a large food SN of a European country including 22,938 business premises, 44,355 supply links and 116 local administrative districts. We rank the business premises with respect to their criticality for the districts' population with the proposed systemic risk index, SRIcrit, to identify around 30 premises that -- in case of their failure -- are expected to cause critical supply shortages in sizable fractions of the population. The new methodology is immediately policy relevant as a fact-driven and generalizable crisis management tool. This work represents a starting point for quantitatively studying SN disruptions focused on the well-being of the population.

preprint2022arXiv

Local majority-with-inertia rule can explain global consensus dynamics in a network coordination game

We study how groups reach consensus by varying communication network structure and individual incentives. In 342 networks of seven individuals, single opinionated "leaders" can drive decision outcomes, but do not accelerate consensus formation, whereas conflicting opinions slow consensus. While networks with more links reach consensus faster, this advantage disappears under conflict. Unopinionated individuals make choices consistent with a local majority rule combined with "inertia" favouring their previous choice, while opinionated individuals favour their preferred option but yield under high peer or time pressure. Simulations show these individual rules can account for group patterns, and allow rapid consensus while preventing deadlocks.

People in this topic

12 visible researcher(s)