Search arXiv⌕ Search

arXiv · 2610.04415

Collective Sensing as Emergent Bayesian Inference

Abstract

Collective behavior in animal groups is routinely described in cognitive language: fish schools sense gradients, swarms compute, colonies decide. These formulations often leave open what the collective is inferring, what computational object is represented, or how that representation arises from microscopic interactions. Here we develop that description quantitatively in a simulation based on the canonical model of collective sensing in fish schools (Berdahl et al., 2013), in which collective gradient sensing emerges from individuals that do not estimate gradients themselves: agents only modulate their speed in response to local light intensity and respond to simple social forces from neighbors. We show that these local rules admit a mesoscopic Bayesian reinterpretation at the level of the school, and hypothesize that the collective dynamics realize approximate inference on a generative model of how darkness gradients drive inter-individual speed differences. The resulting school-level inference process yields a posterior distribution over the local darkness gradient, whose statistics vary with environmental structure and relate systematically to collective motion and sensing performance. The school can therefore be described, in a Bayesian-mechanical sense, as a distributed inferential system without requiring individual agents to perform probabilistic belief updates themselves. This yields a quantitative, falsifiable account of collective sensing as emergent inference, and a concrete bridge from collective behavior to Bayesian mechanics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Conor Heins. 2026-10-03. Collective Sensing as Emergent Bayesian Inference. https://arxiv.org/abs/2610.04415

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

KEEP EXPLORING

Related papers

Bend-Twist Coupling and its Design from Geometrical Constraints in Double Stranded DNA

The versatility of helical structures in nature, such as DNA strands, tendrils, actin filaments, and more, across various life forms and molecular systems, indicates their readiness to manifest useful functionality that can conserve, spread, and assemble. However, it remains unclear precisely why these geometric forms benefit their functions. The structural features of the B-DNA strand, particularly the major and minor grooves and their relation to bend-twist coupling and associated dynamics, serve as a compelling example. Uncovering the direct connection between molecular geometry and its induced dynamics is fundamental to bridging the related energetics and functionality, while unlocking the design principles of various helical nanoscale applications. In this paper, we use geometrical constraints from helicity to derive an ansatz for bend-twist coupling within the Darboux frame and the Frenet-Serret formula. This approch models the conditional deformation of a curved strand wrapping around a simplified core, a structural motif quintessential to DNA packaging. Constraints from differential geometry for B-DNA strands specify the bend-twist ratio required to form an open-ended superhelix, while the related ansatz explains how the major and minor grooves shape these structural characteristics, imparting robust stability to the curved strand. Coarse-grained molecular dynamics simulations validate the results from the ansatz and their sequence-dependent preferences during the wrapping process.

nlin.AO↗

Hidden Higher-Order Vulnerabilities in Simplicial Complexes Revealed by Branch-Consistent Functional Robustness

Robustness of higher-order networks is often quantified by the instantaneous smallest positive eigenvalue of the Hodge $1$-Laplacian under simplex deletion. We show that this observable is generically ill-defined: along a deletion trajectory, eigenvalue branches can switch, so the quantity being monitored may correspond to different nonharmonic modes at different steps. The primary issue is therefore definitional rather than algorithmic. We resolve it by fixing the first nonharmonic branch of the intact complex and following that same branch throughout the damage process, which defines a branch-consistent functional robustness. Triangle sensitivities then follow directly from first-order perturbation theory, making the resulting mode-sensitive deletion protocol a consequence of the observable itself rather than an independent heuristic. Across synthetic and empirical clique complexes, removing only a small fraction of triangles is sufficient to drive the tracked mode to collapse, while graph-level observables remain unchanged because the $1$-skeleton is exactly preserved. The same framework also reveals bridge-like localization of functionally critical simplices and provides a compact predictor of dynamical timescales.

nlin.AO↗

Emergent Topology of Optimal Networks for Synchrony

Designing high-performing networks requires optimizing for functionality while respecting physical, spatial, or budget constraints. Yet, mathematical and computational tools to design such systems remain limited, particularly for collective dynamics arising from heterogeneous dynamical units. Here, we develop a gradient-based optimization framework to identify synchrony-optimal weighted networks under a constrained coupling budget. The resulting networks exhibit counterintuitive properties: they are sparse, bipartite, elongated, and extremely monophilic (i.e., the neighbors of any node are similar to one another while differing from the node itself). These structural patterns persist across dynamical models ranging from the power-grid swing equations to chaotic Rössler systems, suggesting broad applicability to coupled oscillator technologies. To gain insight, we develop a ``constructive'' theory for coupled Kuramoto oscillators: a nonlinear differential equation identifies which pairs of nodes are coupled, while a variational principle prescribes the budget allocated to each node. Dynamics unfolding over optimal networks provably lack a synchronization threshold; instead, as the budget exceeds a calculable critical value, the system globally phase-locks, exhibiting critical scaling at the transition. Together, our findings offer design principles for synchrony-dependent technologies with potential applications ranging from microgrids to laser arrays and quantum oscillators.

nlin.AO↗