跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 00:32 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 01:05 — 2026-11-15 01:05(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 00:32最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 44 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 00:30(北京时间)
新论文 · v1arXiv:2611.17148

资源景观中网红博弈的学习动力学

Learning Dynamics of the Influencer's Game in Resource Landscapes

Mark Lovett Feng Fu

AI 速读 基于摘要

提出“网红博弈”空间博弈框架,分析玩家在性状空间中争夺资源份额时对称均衡的存在性与稳定性,并探讨分岔与多智能体强化学习下的表现。

cs.GT · econ.TH · physics.soc-ph

查看原文摘要

Across domains as varied as ecology, economics, and online platforms, individuals are incentivized to position themselves within resource-rich strategy spaces. In this work we introduce a new spatial game framework called the influencer's game. Within this new framework players' strategies are represented as positions within a trait space. Players then receive a share of a portion of a resource based on their relative influence at that resource's points traits. For the influencer's game, we show that there is a unique symmetric Nash equilibrium that exists under strict log-concavity of the influence kernel. Using the unique equilibrium we show that the stability of the system depends on the influence kernel's parameters, number of players, and the resource distribution shape. For any dimension we demonstrate a stability threshold that depends on both the scatter and curvature of the players. When this threshold is crossed, the symmetric equilibrium destabilizes and gives way to a variety of bifurcation types; including, specialist clusters, limit cycles, and sub-games that reproduce the larger game's structure. We ground these results using real-world data for resources as a demonstration of the game's application. Finally we extend the game dynamics to use multi-agent reinforcement learning and further show that the predicted bifurcation structure persists under partial observability and discretized strategy spaces. In all, the influencer's game provides a novel framework for predicting when competitive pressure drives convergence versus fragmentation with possible applications across domains.

新论文 · v1arXiv:2611.16284

Decisions at the end of the world

Casper van Elteren

原文摘要

International treaties are often described as tigers without teeth, failing to secure compliance or change outcomes. Cooperation also depends on how states maintain the rules they have already made -- especially where no sovereign stands above the states. Here we map more than six decades of decision-making under the Antarctic Treaty, linking submitted proposals to recorded responses and tracing how instruments act on earlier ones. Shared references tie decisions together across the agenda. Recurring revision concentrates in specialised histories, above all the management of protected areas, beyond what activity, popularity and reference age predict. Periodic administrative reviews retire outdated instruments in bulk, joining otherwise separate histories without coordinating policy across subjects. Binding Measures build overwhelmingly on earlier Measures, with little direct succession from non-binding Resolutions. Distinguishing these layers shows how a shared rule system is sustained by consensus, and provides a basis for comparing cooperation across global commons.

physics.soc-ph · cs.SI

版本更新 · v2arXiv:2512.03766

Inaccessibility in public transit networks: A study of the London and New York City subway networks

Katherine Betz

原文摘要

The study of networks derived from infrastructure systems has received considerable attention, yet the accessibility of such systems, remains comparatively underexplored. This study examines infrastructure-based accessibility in two major legacy transit systems, the London Underground and the New York City Subway. We construct accessibility-restricted subnetworks in which nodes represent accessible stations and edges represent connections between them, and compare them with the corresponding full transit networks. We analyze the cyclomatic number, betweenness, and closeness centrality to identify key accessible hubs and differences in network organization. London has a larger share of accessible stations, and its accessible network retains more of the alternative routes of its full network, whereas New York City has a more compact accessible core concentrated around central Manhattan and major interchanges. Comparing the observed accessible stations with random sets of the same size, we find that in London they have higher betweenness centrality than random allocations, but more of their stations are beyond two stops of an accessible station, consistent with accessibility concentration at major interchanges and along fully step-free lines. In New York City, their higher betweenness centrality is fully explained by their concentration at interchanges, and their coverage is similar to that of random allocations. We also examine income and daytime activity around accessible stations. In both systems, several of the most central accessible stations are in high-activity locations, whereas accessible stations show no consistent relationship with median income. Our findings highlight substantial differences in accessibility between and within the two systems and demonstrate the utility of network-theoretic methods for understanding and improving transit infrastructure.

cs.SI · physics.soc-ph

版本更新 · v3arXiv:2502.21037

The amplifier effect of artificial agents in social contagion

Mingmin Feng, Eric Hitz, Luca Lazzaro, Radu Tanase, René Algesheimer, Manuel S. Mariani

原文摘要

Individuals and organizations increasingly consider delegating decision-making to AI agents, which may significantly alter social contagion dynamics. We ask whether artificial agents exhibit different adoption thresholds from those of human subjects when making decisions and, if so, how such differences may affect the spread of social contagions. To answer these questions, we conduct two choice experiments - recently administered to human participants - with artificial agents powered by large language models (LLMs). Across two domains and five LLMs, artificial agents exhibit systematically lower adoption thresholds than human subjects. Simulations of diffusion calibrated with the experimental findings show that, holding network structure fixed, even a modest share of artificial agents leads to higher total adoption. Our findings suggest that the presence of artificial agents in social networks can alter diffusion.

cs.SI · econ.GN · physics.soc-ph

版本更新 · v2arXiv:2601.13867

Block-Fitness Modeling of the Global Air Mobility Network

Giulia Fischetti, Anna Mancini, Giulio Cimini, Jessica T. Davis, Abby Leung, Alessandro Vespignani, Guido Caldarelli

原文摘要

Accurate representations of the World Air Transportation Network (WAN) are fundamental inputs to models of global mobility, epidemic risk, and infrastructure planning. However, high-resolution, real-time data on the WAN are largely commercial and proprietary, therefore often inaccessible to the research community. Here we introduce a generative model of the WAN that treats air travel as a stochastic process within a maximum-entropy framework. The model uses airport-level passenger flows to probabilistically generate connections while preserving traffic volumes across geographic regions. The resulting reconstructed networks reproduce key structural properties of the WAN and enable simulations of dynamic spreading that closely match those obtained using the real network. Our approach provides a scalable, interpretable, and computationally efficient framework for forecasting and policy design in global mobility systems.

physics.soc-ph · cs.SI

新论文 · v1arXiv:2611.15313

Influence of Assortativity on the SICP Spreading Process in Hypergraphs

Jelmer Stolwijk, Renze Dijkhuizen, H. A., Peters, Huijuan Wang

原文摘要

Many real-world systems involve group interactions that cannot be captured by pairwise graphs. They can be better represented by hypergraphs where each hyperedge could connect an arbitrary number of nodes. The Susceptible-Infected Contact Process (SICP) has been proposed to model the spreading of information and epidemics on hypergraphs. However, how higher-order topological properties of a hypergraph influence the SICP spreading process remains understudied. In this paper, we examine the impact of hypergraph assortativity based on the Neighborhood Coefficient (NC)-the average size of hyperedges incident to a node-on the SICP spreading process. By introducing a low-complexity measure of hypergraph assortativity grounded in analysis of variance, we apply hyperdegree-preserving rewirings to real-world networks and synthetic hypergraph models to tune their assortativity. We find and explain why lower NC assortativity yields higher average epidemic prevalence and lower prevalence variance across different seed selections. This phenomenon is evident when hyperdegree-preserving rewirings are applied to real-world networks with heterogeneous topological structures, but it is largely absent when comparing synthetic random hypergraphs to their rewired counterparts.

cs.SI · physics.soc-ph

新论文 · v1arXiv:2611.14499

尼泰罗伊交通选择的空间格局

Spatial patterns of transportation choice in Niterói

Sandro Martinelli Reia, Taylor Anderson, Dieter Pfoser

AI 速读 基于摘要

作者提出一个利用宏观聚合静态城市数据构建微观动态出行模拟的计算框架,并在巴西尼泰罗伊约47.5万合成居民上复现邻里尺度交通方式选择的空间差异。

physics.soc-ph · cs.MA · stat.OT

查看原文摘要

Characterizing how people move through a city requires spatially and temporally fine-grained data that are often costly and difficult to obtain. Here, we introduce a computational framework that uses macroscopic, aggregated, and static urban data to construct a microscopic, dynamic, and spatially detailed representation of urban mobility. Building on an existing activity simulator, the framework combines a synthetic population, the built environment, and transport networks to generate daily trips and assign walking, car, or public transit. Applied to approximately 475,000 synthetic residents of Niterói, Brazil, simulated neighborhood-level transit patterns show a strong association with an empirical activity proxy (Pearson r=0.885). Walking is more prevalent in compact central areas, car use increases toward the periphery, and public-transit use remains comparatively high along bus corridors. Reducing walking times to and from bus stops by 30% increases the modeled public-transit-to-car ratio by 11.3%, with larger transit-share gains in several peripheral areas. These results reveal spatial differences in transportation choice and identify where improved transit access may have the greatest modeled effect.

新论文 · v1arXiv:2611.14039

Thermodynamics of words

Klaus M. Frahm, Dima L. Shepelyansky

原文摘要

We introduce the word thermalization hypothesis according to which in a literary work there are effective interactions between words that drive them to thermalization where their word frequency distribution is the same as for the phenomenon of Rayleigh-Jeans (RJ) thermalization and condensation. In this concept, the different words play a role of classical oscillators (particles) and their word frequencies, or related tokens, are analogous to certain filling factors over energy state levels. The thermalization process is characterized by the conservation of total system energy, or total number of words/tokens, and total probability norm, or total number of different words. We apply this approach to analyze 16 literary works, including Bible, complete works of Shakespeare, and data from American National Corpus. We show that for these cases the effective system energy is very low and thus there is the RJ condensation phenomenon with a big fraction of total probability concentrated at the lowest energy states corresponding to a big fraction of rare words appearing only once or twice in the whole text. Such a RJ condensation is observed for light propagation in multimode optical fibers and other physical systems. We relate the thermalization of words to the recently proposed wealth thermalization for households in world countries. The economy concepts of Lorenz and Pareto curves, and also Zipf curves, are applied to the word frequency distributions of the selected 16 cases and it is shown that the thermalization theory gives a strikingly good description of real data.

cond-mat.stat-mech · cs.CL · physics.soc-ph

新论文 · v1arXiv:2611.13146

Everything in its right place: attention is a radio head

Lluís Arola-Fernández, Aissam Khadraoui, Alex Arenas

原文摘要

Attention, the core of language models, is a digital calculation over tokens: an exponential selects them, a division normalizes and a positional code sets the order. We show that attention can instead emerge from the synchronization of a receiver with its context tokens. Each past token is an oscillator whose state carries its content and whose frequency drifts with its age. The present token selects them by content, aligning an antenna with its query, and by position, setting the frequency of a receiver with its dial. Solving Kuramoto's problem for this receiver yields an attention layer in closed form with two phases: above a critical coupling set by the context, the receiver locks and its weights normalize; below it, it stays silent and its weights sum to less than one. Trained networks use both phases to select, abstain and count, fail where the theory predicts and keep reading far beyond the training length. Each part of attention finds its place in one device, a radio head: it tunes in to what to hear and when, and stays silent when nothing relevant is on air.

physics.soc-ph · cond-mat.dis-nn · cs.AI · cs.LG · nlin.AO

新论文 · v1arXiv:2611.12545

Teamknitt: Configuring, Observing and Intervening in LLM-Agent Teams through the Lens of Dynamical-Systems and Human-Team Theory

Goran Mitevski

原文摘要

Most frameworks for teams of large language model (LLM) agents fix the team's shape inside the software: who talks to whom, how much is passed along, and what a human can do once a run has started. Human-team research has long asked those questions: where team phenomena live (in members or in their interaction), how team-level properties arise, and what separates what a team does from how a team is. I propose using that theory as the organizing lens for configuring, observing and intervening in LLM-agent teams, without assuming its findings transfer. I introduce teamknitt, a framework and open reference implementation in which a user configures a team of 1-16 AI agents for task completion, solution generation, achieving a goal or a research mission; selects one of fourteen deterministic routing topologies or a custom directed graph; chooses a sharing profile that limits what may travel along permitted routes; and binds sources, representations, work dependencies, handoffs and an expertise directory. The recorded process can be observed through non-system views (member reports and behavior) and system views (distributed problem-solving, differentiated transactive memory, interactive coordination, team dynamics). Interventions are explicit and human-led: reviewed reconfiguration between runs, planned disturbances, and private feedback, pause, resume or stop applied at dependency-wave boundaries, with "queued", "applied", "assembled", "understood" and "improved" kept as separate claims. Emergent states such as trust and shared understanding are declared unmeasured. This is an idea and system-description paper with falsifiable hypotheses on topology, information flow and intervention timing, including whether the fractal scaling of communication output between members, and between members on different models, relates to task and team performance. No comparative result is reported.

physics.soc-ph · cs.MA

新论文 · v1arXiv:2611.12313

Hidden Distances: How Likert-Scale Spacing Shapes Algorithmic Voting Advice

Thomas Broholt Knudsen, Christian Høst-Madsen, Vedran Sekara, Jonas L. Juul

原文摘要

Voting Advice Applications (VAAs) are algorithmic recommenders that match voters with political candidates on policy preferences. They are widely adopted across many multi-party democracies; in Denmark, 62\% of eligible voters used a VAA ahead of the 2022 general election, and 45\% of VAA users reported following its advice. VAAs typically ask voters and candidates to respond to policy statements on a Likert scale, from ``strongly disagree'' to ``strongly agree'', and recommend candidates whose responses are closest to the voter's. Computing these distances requires assigning numbers to response options, a design choice without an empirical basis, since it is unknown how people perceive the distances between options. Here we show that this seemingly technical choice substantially changes whom voters are matched with. We parameterize the distance between ``(dis)agree'' and ``strongly (dis)agree'' relative to the distance between ``neutral'' and ``(dis)agree'' as $α$, and quantify how it changes recommendations for a popular Danish VAA. We find that moving from equidistant options to doubling this distance can change $37.7\%$ of top candidate matches and $21.9\%$ of top party matches, although no answers change. Low $α$-values favor candidates with strong positions, with some parties receiving up to $ 19.6\%$ more recommendations, while high $α$-values favor moderates. Similarly, female candidates receive fewer recommendations at low $α$ and more at high $α$-values. Our findings demonstrate that undisclosed quantification choices in algorithmic recommenders can carry considerable electoral consequences, and they call for transparency and sensitivity analysis in VAA design. As Likert-based matching also underpins dating platforms and roommate allocation systems, these implications extend well beyond elections.

cs.CY · cs.IR · physics.soc-ph

新论文 · v1arXiv:2611.12270

Modelling socio-economic effects of the pandemic in a metropolitan area

Jan E. Snellman, Rafael A. Barrio, Cecilia I. Ventura, Tzipe Govezensky, Kimmo K. Kaski, Maarit J. Korpi-Lagg

原文摘要

One of the most notorious measures taken by authorities in every country trying to prevent the uncontrollable spread of the Covid 19 pandemic was to impose severe measures to diminish the mobility of people. In recent publications we proposed a mathematical model to address the consequences of these measures and to predict the infections under different scenarios, for various different countries. In this paper we extend the model, called the BTH--SEIRS-model, to deal with the reduction of mobility in an urban area. The chosen region was the densely-populated metropolitan area around Helsinki, the capital of Finland. This choice obeyed to the fact that there are precise data related to mobility from a mobile telephone company, and that this region was completely isolated from the rest of the country for a short period during the pandemic. We also used public transport data from railways and the accommodation occupation rates in the area of interest. We show that the BTH--SEIRS model is capable of simulating the real infection data as well as the mobility-related economic activity, exhibiting the main trends present in the three indicators used for comparison. Our calculations allow us to highlight the difference of the behaviour of the pandemic in a totally different spatial scale, and to discover the hidden factors that govern the behaviour of people who are forced to commute every day from home to work.

physics.soc-ph · cs.MA

版本更新 · v2arXiv:2609.00009

The Minimal Persona: Rarer and Shared Labels Both Skew Allocation Among AI Agents

Messi H. J. Lee

原文摘要

Artificial intelligence (AI) agents built on large language models increasingly work in teams, where one agent divides tasks or resources among others that the software marks with a team, a role or a similar label. A model that simply up-weights any recipient sharing a string with its own context would favor same-label peers, so a shared-label tilt alone says little about groups. Borrowing the minimal-group paradigm of social psychology, we had six language models divide 100 points among 19 peers that differed only in carrying one of two invented words, in groups of unequal size (32,400 decisions). Varying group size separates two effects. In five of the six models, at the most unequal split, a recipient with the rarer label received 1.3 to 3.3 times the points of one with the common label even when the decider was not told its own label: a rarity effect that involves no match to the decider. In four of them it accounts for 35% to 55% of the extra favoritism that agents in the smaller group show their own group, and for more in the fifth. Telling the decider its label adds an own-group effect, positive in every model and in five of the six indistinguishable from label matching. With the labels hidden, neither appears. Because the labels mean nothing, bias tests built on lists of named social groups are not designed to detect either effect.

physics.soc-ph · cs.CY

新论文 · v1arXiv:2611.11867

Competing Influence in LLM Populations: Budget Timing and Baseline Drift

Mehwish Nasim, Nicolas Fay

原文摘要

When competing campaigns target a population of large language model (LLM) agents, observed opinion changes may reflect both campaign influence and changes that would occur without intervention. We study how the timing of campaign expenditure and the population's own evolution shape outcomes in a network of persona-conditioned LLM agents that exchange and revise opinions in natural language. A proponent and a challenger are tasked with generating opposing messages under equal delivery budgets, while a separate stance probe measures opinions without influencing the simulation. Across eight claims, we compare single-campaign and competitive conditions against matched no-campaign runs, and evaluate all nine combinations of early, sustained, and late spending on a reference topic. Baseline stance drift varies substantially across claims and, on some, accounts for a sizeable fraction of apparent campaign effects. After accounting for this drift, the direction of observed campaign-associated changes aligns more closely with the claim's epistemic standing than with the campaigner's assigned role. Uninfluenced populations also consistently lose stance diversity, demonstrating that directional opinion change and convergence are distinct phenomena. In networks with two opinion-segregated communities, campaigns primarily reduce differences between communities rather than diversity within them. LLM campaign agents do not always argue for their assigned positions, particularly when these conflict with established evidence. Finally, campaign outcomes depend on the opponent's expenditure schedule: unlike a matched numerical bounded-confidence population receiving interventions at the same times and locations, the LLM population exhibits a payoff structure with no pure-strategy equilibrium.

physics.soc-ph · cs.CL · cs.MA

新论文 · v1arXiv:2611.11663

The AI research space shapes country academic performance

Siyi Zhou, Tianxing Pan, Qing Ke

原文摘要

Recent advances in Artificial Intelligence (AI) have demonstrated great potential across diverse domains, prompting increasing attention to understanding the AI ecosystem. As knowledge production is often perceived as a process of connecting existing pieces of knowledge, mapping the interconnections of AI knowledge is crucial for unraveling the dynamics of scientific production in AI. However, maps created so far have fallen short of capturing knowledge relatedness, focusing instead on citation relationships between subfields. Here, we build an AI research space by connecting pairs of AI research topics based on their proximity measured through author-topic coupling. Projections of country level performances onto the space reveal that countries exhibit distinct baskets of specializations. We further examine the role of the structure of the AI research space in the scientific development of nations. We find that countries are more likely to gain specialization in topics that have high proximity to already specialized neighbor topics, and that publications whose topics align more with the developed topics in the country are more likely to become high impact. Our results highlight the AI development gaps across nations and the path-dependence in the development induced by the AI research space.

cs.SI · physics.soc-ph

新论文 · v1arXiv:2611.11436

Retrospective Analysis of Team-Following Trading Profitability in Pumpfun Meme Coins Using Funding Networks

Fail Gafarov

原文摘要

If the right token-creation teams had been known, how much could following them have returned, and what is left when only information available before each launch is used? We study ten separately recorded Pumpfun windows (April 2024 to September 2026), each reconstructed independently from real-SOL reserve states and finite-capital accounts that start with one SOL. Teams are directed funding groups ranked in hindsight. When every team exits at its own best reserve threshold, chosen in hindsight, the main account ends above one SOL in all 8 windows that have a qualifying team (1.10 to 11.32 SOL), but free cash exceeds one SOL in only 5, and marks of positions that never reached their threshold make up 17--94% of equity. If teams are recognised online, from tokens whose first hour has completed, 9 of 19 teams become identifiable only after their last launch; the remaining 10 end above one SOL in 10 cases, with free cash above one SOL in 7; funding links in this step still come from the full window, so even these results are not a fully realisable signal. A large model balance, a result above random cohorts that repeat the threshold search, and a statistical rejection in the selection-matched nulls (3 of 40 tests after Holm adjustment) are three different statements, and these nulls condition on the discovered funding graph, so they do not calibrate the whole selection procedure. Midpoint tests describe a further source of apparent opportunity. A detailed analysis of the best and the worst window, with every analysis parameter varied, shows that the worst result, which is close to break-even, rises several-fold with a stop rule or another funding-graph construction. The results are conditional retrospective model accounts, not executable profits, and not evidence of a causal effect of the SOL price.

physics.soc-ph · cs.SI · q-fin.TR

新论文 · v1arXiv:2611.11029

Evolutionary games on networks with negative edge-based environmental feedback

Katherine Betz, Feng Fu, Naoki Masuda

原文摘要

Environmental feedback can fundamentally alter the game payoff structure underlying the evolution of cooperation. How feedback-evolving games interact with population structure under non-weak selection remains incompletely understood. We study an evolutionary game on networks in which each edge has a binary environmental state that determines the payoff matrix used by the two connected individuals. By assumption, cooperation tends to improve the local environment, which in turn favors defection, thereby creating negative feedback between strategies coupled with the environmental condition. We analyze the model under strong selection using a mean-field approximation, a pair approximation that tracks both strategy pairs and edge environments, and agent-based simulations. In well-mixed populations, the feedback can generate bistability between full cooperation and full defection, as well as sustained oscillations arising through a Hopf bifurcation. Sparse networks (i.e., with low nodes' degrees) can eliminate bistability, suppress oscillations, and produce stable intermediate levels of cooperation. The pair approximation captures these effects and generally agrees more closely with simulations on sparse networks than the mean-field approximation. Our results show that edge-based environmental feedback and network structure, such as density of edges, interact to determine whether the fraction of cooperators stabilizes or oscillates over time.

physics.soc-ph · cs.SI · q-bio.PE

新论文 · v1arXiv:2611.10641

Same Contacts, Different Rooms:Meeting Format Shapes LLM Group Influence Beyond Pairwise Contact Counts

Zhexi Gu, Shusheng Cao, Runping Zhu

原文摘要

Simulations of LLM agent collectives usually summarise interaction as a pairwise contact network. We test that summary with a contact-matched intervention: the members, their initial stances and every pairwise contact count stay fixed while the meetings are reorganised, and each member gives a one-step support readout after reading the arguments of everyone present. Across six open-weight LLMs and 14 debate topics, merging triads into five-person meetings (resize) moves group support more than reshuffling who meets in triads (regroup), although both move the same 60 dyadic exposures. The root-mean-square change is 4.36 versus 2.59 percentage points (pp), larger for resize in all six models and in 81 of 84 model-topic cells. Resizing also has a consistent direction: it amplifies the initial majority of the merged members by 1.72 pp, in every model, whereas regrouping has no direction (<= 0.03 pp). A contact network cannot represent regrouping at all, yet pairwise rules applied meeting by meeting explain up to 76% of its effect, and with identical weights they raise resize R^2 by 0.51-0.58 for two models. We show that the gap between the two placements is an exact Jensen gap of the sigmoid readout, bounded by how much a member's predicted logits vary across meetings; this dispersion tracks the gap with log-log r=0.97 and tells a modeller when contact counts are a safe summary. Meeting format is a first-class variable for LLM social simulation.

physics.soc-ph · cs.CL

新论文 · v1arXiv:2611.09445

Incentive Pathologies in a Live LLM Agent Arena: An Empirical Study of Concentration, Reward-Rule Implementation Discrepancy, and Network Dilution

Lei Zhenbing, Lei Chang

原文摘要

We audit one live LLM agent arena (AITRAP; 22 autonomous agent seats, ~96,000 reasoning nodes) over nine days (Oct 16-25, 2026), during which the platform deployed two bundled incentive changes: a progressive tax reform (V2.9.3, Oct 19) and a seed-inversion with explorer-side action update (V3.0, Oct 21). These serve as before-and-after markers, not cleanly isolated interventions. Four exploratory predictions are tested against ten data frames (F1-F10) using the Gini coefficient, Top-K concentration share, code-level reconstruction of the continuation-bonus mechanism, and the Mann-Kendall trend test. The Gini analysis is inconclusive at 95% confidence (bootstrap intervals straddle 0.7). The Top-4 node-activity-score share falls from 97.2% (Oct 19, pre-V2.9.3) to 49.4% (Oct 25, post-V3.0; 56.7% under a merge-seat assumption). The continuation bonus, announced as depth-based x10, resolves at code level to a four-condition anti-abuse gate paying x2.85 in the typical case and permanently blocking the self-continuation it superficially rewards; the gate was active ~40 hours before the V3.0 announcement. The events-per-node ratio declines significantly (Mann-Kendall S=-45, z=-3.94, p=8.3e-5) from 7.36 to 7.069. We discuss implications for incentive designers, the announcement-implementation gap, and public peer review as an event record.

cs.MA · physics.soc-ph

新论文 · v1arXiv:2611.08812

Dynamic signatures of collective knowledge through navigation in a network with semantic structure

Abby Bertics, Elizabeth R. Chrastil, Jean M. Carlson

原文摘要

What distinguishes how humans navigate an information network like Wikipedia from what the underlying graph structure and language statistics alone predict? To study human collective navigation, we analyze 70,770 human trajectories through Wikispeedia, an online game where players navigate between articles to reach a target. To compare groups of trajectories rather than individual ones, we merge all trajectories leaving or entering a given article into a Flow Tree. Flow Trees compress collections of trajectories into hierarchies of group splits. We build forward and reverse Flow Trees for 815 of the most commonly traversed articles, representing divergence and convergence, respectively. We compare humans against four random-walker null models, either unweighted or weighted by graph structure, word frequency, or semantic similarity to target. Human Flow Trees are deeper with longer trunks and later splits, indicating players stay together longer than random walkers, whose Flow Trees tend to fan out immediately. An article's degree predicts 51.3-70.9% of the variation in Flow Tree branching factor for random walkers, but only 24.1-36.2% for humans. Taking what graph structure fails to predict as a two-dimensional coordinate system, we define four article types (beacons, funnels, forks, and corridors), distinguished by how humans enter and exit them. These human-defined types are not explained by out-degree or title-word frequency are, and are not recovered by any random walker. A fifth null model, built from first-order human click preferences, partially reproduces human Flow Tree shape but differs significantly in how much of that shape degree explains. We consider collective knowledge to be the structure shared by players who never communicate, beyond what graph structure imposes. It comprises first-order click preferences and a significant component that extends across clicks.

cs.SI · physics.soc-ph

新论文 · v1arXiv:2611.07808

A Sequential Framework for Urban Drone Delivery: Network Design, Vehicle Sizing, and Energy and Cost Assessment

Hong-Su Nam, Seokhwan Lee, Jungwoo Cho, Hak-Tae Lee

原文摘要

A sequential engineering framework is presented for urban drone delivery, linking hub location, route planning, mission-specific vehicle sizing, and energy and operating cost assessment. Aggregate origin-destination demand is assumed known a priori. For each hub configuration, the maximum required link distance is minimized, and feasible routes that return to their departure hubs are generated. Route frequencies are determined using mixed-integer linear programming to satisfy delivery demand. The resulting range requirement guides motor-propeller selection and battery sizing to minimize vehicle takeoff mass. Flight distances and frequencies, cruise performance, and vehicle dimensions are combined to estimate monthly energy consumption, fleet size, hub area, staffing, and operating cost. The framework is applied to district-level Seoul delivery data. Increasing the number of hubs from one to four reduces the required range from 30.6 to 21.9 km and vehicle takeoff mass from 8.12 to 6.12 kg. Despite a 21.5% increase in total flight distance, monthly flight energy consumption decreases by 13.1%, from 15.2 to 13.2 MWh. Battery replacement is the largest vehicle-related operating expense, while operating cost per delivery increases from USD 1.18 to USD 2.20 because of higher rent and labor costs at the hubs. Among the designs evaluated, range-matched vehicles achieve the lowest operating cost in the two- and four-hub networks; a longer-range vehicle is least costly in the three-hub network. Sensitivity analyses further examine the effects of delivery demand and operating assumptions. The results demonstrate that reductions in vehicle mass and energy consumption do not necessarily lead to lower system operating cost.

cs.RO · physics.soc-ph

版本更新 · v2arXiv:2601.00878

Heraclitean Dialectical Concept Space

Volkan Yildiz

原文摘要

We introduce Heraclitean Dialectical Concept Spaces (HDCS), a topological framework for modelling stagewise structural change in systems of concepts. A stage consists of a nonempty concept set, a feasible family generating an external topology, and a neighbourhood assignment carrying additional relational structure. Neighbourhood overlap induces adjacency and channel ideals. Candidate emergence is represented by the CCER construction: an interaction profile, finite admissible cores, and anchored witnesses determine nonempty open candidate regions in uncovered remainder structure. Selected candidates may be reified as new atomic concepts at a later stage, while partial injective carry maps separately track persistence of existing identities. The resulting history space is obtained as a quotient of the disjoint union of stage spaces with the corresponding final topology. Product concept spaces extend the construction to cross-domain interaction. We derive support characterizations, mediated-interaction components, canonical CCER envelopes, monotonicity and impossibility criteria, product-space factorization, and invariance under concept-space isomorphism. Applications to monetary transformation, zero and representation, mammalian middle-ear evolution, and AI-related labour change illustrate the framework. HDCS is intended as a structural formalism rather than a causal or predictive theory of historical change.

physics.soc-ph · cs.LO · math.GN

新论文 · v1arXiv:2611.06584

Informing research priorities for distributed acoustic sensing: insights from a citizens' panel

Hannah Dalgleish, Rafael Mestre, Heidi Wheatley, Angela YT Chan, Mariya Yanishevskaya, Duncan Grimes, Sophie Hart, Sergey Astakhov 等 15 位作者

原文摘要

This report presents findings from a Citizens' Panel convened by the SOUNDSCALE project (www.soundscale.ac.uk) to inform research priorities for distributed acoustic sensing (DAS). Across three online and in-person workshops, 48 residents from Hampshire and London explored the technology's potential uses, risks, governance, and societal implications. The report summarises their deliberations and priorities, and reflects on the challenges of involving citizens in early-stage research on an unfamiliar technology.

physics.soc-ph · cs.ET

新论文 · v1arXiv:2611.06393

A Cracked Mirror: How People Perceive Gender Performance by Large Language Models

Faezeh Fadaei, Jenny Carla Moran, Taha Yasseri

原文摘要

How do large language models (LLMs) perform gender under zero-shot prompting, and how do people interpret those performances in conversation? Drawing on gender performativity, we examine how gendered meanings emerge through generated language, conversational context and human interpretation. In a preregistered randomised online experiment, 1,060 participants each had five short conversations with an LLM. We used minimal prompts to elicit performances from "very masculine" to "very feminine" and asked participants to rate their partner's perceived gender after each conversation. Mean ratings shifted in the direction of the prompts, but ratings at the extremes were closer to the midpoint than the prompt labels implied. When prompted to perform as "neither masculine nor feminine", the models were perceived as slightly masculine on average. Ratings varied across models and conversation topics. Women and men gave similar ratings at the extremes, but women rated the models as more masculine across the intermediate prompt levels. Participants' explanations illustrate how they drew on writing style, emotional expression and conversational interests, sometimes questioning the stereotypes behind their judgements. These findings suggest that conversational AI acts as a cracked mirror of gender norms. Models reproduce recognisable cues, and people interpret and sometimes challenge the meanings those cues carry.

physics.soc-ph · cs.HC

新论文 · v1arXiv:2611.06051

Impact of Negative Weights on Performance in Reservoir Computing

Yeonsu Jeong, Seonho Nam, Dahan Choi, Mi Jin Lee, Seung-Woo Son

原文摘要

Reservoir computing provides an efficient framework for time-series prediction because only the readout layer is trained while the recurrent reservoir remains fixed. In this study, we examine how the negative sign ratio of a signed Erdos-Renyi reservoir affects the internal dynamics and forecasting performance of an echo state network on the Mackey-Glass benchmark. To characterize the reservoir responses, we use two Shannon-entropy-based observables, namely node-state entropy and node-frequency entropy, as empirical proxies for the diversity of reservoir states and temporal activation patterns. We find that intermediate negative sign ratios are associated with richer internal dynamics and substantially lower prediction error than the sign-homogeneous extremes for the task considered here. These results suggest that link-sign composition can be a useful structural parameter in reservoir design for chaotic forecasting. The present findings should be interpreted within the scope of the current benchmark and reservoir setting, and broader validation will be required to establish their generality across other tasks, topologies, and controlled spectral conditions.

physics.soc-ph · cs.LG

版本更新 · v4arXiv:2610.24865

A self-organizing mechanism for collective foraging: recruitment cascades couple Levy search to a clustered maximum-entropy resource field

Galen J. Wilkerson

原文摘要

Foraging recruitment is modeled as a contagion: an agent that finds a resource triggers a linear-threshold cascade on the group's communication network. Because activation is degree-normalized, crowding shuts the cascade off, so the swarm aggregates on a resource and then disperses to explore again. Acting on the cascade moves agents in space, and that motion rewires the network, so recruitment and exploration are one coupled process; removing this coupling alone abolishes the self-limitation. Recruitment spreads only within a connectivity window, bounded below by percolation onset and above by degree-blocking. The swarm self-organizes to the near-critical edge of this window -- self-organized quasi-criticality: recruitment sits near but below the critical point without settling onto a clean, size-invariant critical state, and the activity spectrum has a finite correlation time (Lorentzian-like, not 1/f), consistent with local rather than global criticality. Recruitment raises harvest up to 2.7x over solitary search on sparse, clustered resource fields and loses (down to 0.37x) on abundant or uniform ones; because resources generically aggregate, the favourable regime is the common one. The empirically motivated Levy search and the resource field it exploits are both least-committal: the search a maximum-caliber walk, and the field a maximum-entropy point process whose generic, aggregation-set sign is clustered (attractive). The search exponent that maximizes harvest tracks the field's fractal dimension (a heavier-tailed, more ballistic search for more strongly clustered fields). These are one coupled mechanism: heavy-tailed Levy exploration crosses the field's sparse voids while recruitment cascades exploit its clusters, so one maximum-entropy geometry binds exploration and recruitment into a single self-organizing cycle.

physics.soc-ph · cs.DC · cs.SI · math-ph · physics.bio-ph

新论文 · v1arXiv:2611.04886

Modelling lock-in of AI adoption through skill erosion

Renaud Lambiotte

原文摘要

Generative AI can improve immediate performance but may erode the human skills required for future work. We study a model in which individuals tend to imitate successful peers, while their independent skills grow with practice and erode with reliance on AI. Because each agent's skill reflects their history, non-users and AI users develop different skill distributions, which we derive exactly. Skill erosion can produce bistability and hysteresis between a low-adoption, high-skill state and a high-adoption, low-skill state. When agents rarely change behaviour at random, the two transitions are asymmetric. A single AI user spreads through a population of experts only if AI-assisted work earns more than expert work, whatever the timescale of skill adaptation. A single non-user, by contrast, can lead an AI-dependent population back to independent work only if they regain enough skill before returning to AI, which becomes easier the more persistent behaviours are. As AI improves, adoption can jump abruptly, and a sufficiently long increase in its benefit, such as a period of low prices, can leave a population relying on AI after the benefit has returned to its initial value. Skill erosion thus creates a history-dependent switching cost that can make widespread AI adoption difficult to reverse.

cs.AI · physics.soc-ph

版本更新 · v2arXiv:2610.26730

EpiLens: Lightweight RAG for Epidemiological Knowledge Acquisition

Vincenzo Perri, Ciro Cattuto, Daniela Paolotti

原文摘要

To prepare for future outbreaks, researchers need to know what studies have been done and what data they use. Mapping a large literature by hand is slow, while large language models alone can misstate or conflate sources. We present EpiLens, a lightweight, open-source retrieval-augmented generation package that applies a fixed retrieval template and output schema to every paper in a corpus and links outputs to source passages. We build a corpus of 2,297 papers from the sources of a multi-pathogen parameter study and evaluate EpiLens's paper-classification workflow against 214 manually labelled papers. Run locally with an open-weight model, so that licensed full texts never leave our hardware, the classifier is comparable to supervised baselines trained on the manual labels, and ahead of them on geography, despite the lack of task-specific training data. The study's early extraction sheets cite published sources for 327 estimates. We link each estimate to a cited document or to corpus studies included by a review. Then, we use the classifier's labels to compare the papers associated with different parameters and pathogens. EpiLens labels more papers linked to reproduction numbers than fatality risks as model-based (53% versus 15%, compared with 62% versus 24% in the manual labels). The gap is consistent with the frequent use of transmission models to estimate reproduction numbers and largely persists within pathogens.

cs.CL · cs.DL · physics.soc-ph

版本更新 · v2arXiv:2609.38037

Emergence in Network Systems is Bounded by Boundary-Crossing Paths

Johnny Jingze Li, Gabriel A. Silva

原文摘要

Emergence, features of a whole that no part shows alone, is central to complex systems but rarely measured so as to locate its source. Viewing a system structurally, as a network of interacting parts, we evaluate emergence as what observing the coupled whole reveals beyond, or erases from, the combined observations of the parts. For observations that build what they see route by route, we show that every emergent feature is produced by its own route across the interface between parts, a route that traces it to the components and interactions responsible. We show the number of all such boundary-crossing paths bounds the total emergence discrepancy, and equals the emergence of measures that count routes. The bound is computed locally around the interface, validated through network examples, and in a nervous system the routes show that interneurons relay most of the emergence. Our work associates emergence with path structure in the network system that can be anticipated, attributed, and engineered.

physics.soc-ph · cs.SI · nlin.AO

新论文 · v1arXiv:2611.03980

Measuring Model-Specific Alignment Drift in LLM-Based Opinion Dynamics

Nataša Djurdjevac Conrad, Sebastian Pokutta, Christof Schütte

原文摘要

Large language model (LLM) agents are increasingly used as synthetic participants in opinion-dynamics experiments, often assuming that an agent's behaviour is fully determined by its prompt. We test this assumption with a framework in which LLM agents discuss a contested policy issue over repeated rounds while their stance is quantified by a fixed psychometric instrument independent of any dynamics model. Across six LLMs, committed personas are intrinsically stable: in each of the five models tested without peer input, every agent keeps its assigned side for 20 rounds. The observed loss of alignment under discussion is therefore interaction-induced, we call it alignment drift, and model-specific: gpt-4.1 keeps opinion clusters apart, claude-sonnet-5 holds them partially, and gpt-5.6-sol and claude-opus-5 abandon them. Under selective attention, one LLM maintains separated opinion clusters under stance-homophilous attention. Qualitative profiles persist at doubled population and horizon and on a second issue. Such heterogeneity makes the LLM choice a first-class validity variable for social simulation.

cs.AI · physics.soc-ph