Search arXivSearch

arXiv · 2609.22454

Stochastic consensus dynamics for decentralized decision systems

Abstract

A fundamental mechanism underlying collective phenomena in social, technological, and economic systems is decentralized decision-making, in which the behavior of individual agents follows from local interactions in the absence of central coordination. Consensus formation is a central feature of such systems, with relevance to blockchain networks, distributed artificial intelligence, autonomous multi-agent systems, distributed control, and collective decision networks. We investigate consensus formation using a stochastic consensus model on random networks and examine how initial conditions, network connectivity, and system size shape the emergence of unanimous states. We show that the stochastic dynamics strongly amplify small initial majorities, progressively suppress the competing state, and drive the system toward a predictable collective outcome. Network connectivity primarily controls the efficiency of this process: increasing connectivity accelerates the propagation of local agreement and reduces the likelihood that fluctuations reverse the initially dominant state, although these gains gradually saturate in highly connected networks. System size produces a complementary effect. Larger networks require more individual updates to reach unanimity, but they are also increasingly reliable in selecting the state favored by the initial majority. Finite-size analysis shows that the range of initial conditions associated with uncertain outcomes becomes progressively narrower as the network grows, decreasing approximately with the inverse square root of the system size. These results reveal a collective amplification mechanism by which weak initial asymmetries become increasingly decisive in large decentralized networks, and they provide a simple framework for understanding the efficiency, predictability, and reliability of consensus formation in distributed decision systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

André L. M. Vilela, Caio B. L. Silva, Kenric P. Nelson, Emilio Cobanera, Gaogao Dong. 2026-09-18. Stochastic consensus dynamics for decentralized decision systems. https://arxiv.org/abs/2609.22454

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bi-Hamiltonian in Semiflexible Polymers built upon Overdamping Process

Quantifying the interaction between a system of interest and its ambient conditions, the memory effect links the states of two distinct Hamiltonians: one for the target system and one for the environment. In this paper, we propose the diffusion process derived from the Smoluchowski equation that can derive the evolution process described by the memory effect integration in a non Markovian regime. The Smoluchowski picture, within the framework of stochastic thermodynamics, justifies a diffusion process incorporated into the equations of motion, and the result of the derivation enables a coarse-grained molecular dynamics simulation with the modified equation of motion to reproduce attenuation from collisions between single walled carbon nanotubes (SWCNTs) under far from equilibrium conditions. The results of the numerical experiments on the collision confirm that heat diffusion compensates for the correlated momentum arising from the memory effect between the two Hamiltonians in both equilibrium and far from equilibrium states.

physics.comp-ph

Translation of transient acoustic fields

A method is presented for the translation of acoustic field data from a source to a target region. Field data are represented as spherical harmonic expansions on spheres surrounding the source and target regions respectively and expansions are translated using a ``point and shoot'' method using the Kirchhoff--Helmholtz integral to carry out an axial translation from one sphere to the other. The principal motivation for the method is its use in a time-domain Fast Multipole Method, and test cases reflective of this application are presented. The method converges to six digits for appropriate values of parameters and for the values of $N$ considered here computational effort scales approximately as $N^{2}$ where $N$ is the order of spherical harmonic expansion for the field data. The method is causal and thus avoids artifacts generated in methods which are not based on intrinsically causal formulations.

physics.comp-ph

Learning continuous reaction paths for transition-state prediction

Transition states are defined by reaction pathways, yet most machine-learning methods predict them as isolated geometries. We introduce MARC-TS, a two-stage framework that learns a continuous, endpoint-conditioned path, queries it at any resolution and uses local path context to refine a transition-state candidate. We construct T1x-IRC-8K, a dataset of 8,209 reactions and 1,088,725 path-resolved geometries. On held-out reactions, the path model reduced complete-path error by 48.4% relative to endpoint interpolation, and the localizer achieved a mean aligned structural error of 0.127 Å. Quantum-chemical optimization and vibrational analysis yielded 405 frequency-confirmed first-order saddle-point candidates from 410 predictions. In a 100-reaction nudged elastic band comparison, learned-path initialization reached a joint geometry-and-force target for 66% of reactions, compared with 12% for geometric interpolation after 100 optimizer steps. By treating the path as a reusable representation rather than an auxiliary output, MARC-TS connects transition-state prediction, mechanistic interpretation and quantum-chemical refinement.

physics.comp-ph