Eduardo Colli | Searcharxiv

arXiv2026

Voter Model Meets Rumour Spreading: an FPRAS for Consensus Probabilities on Voter Models with Agnostic Nodes

Problems of consensus in multi-agent systems are often viewed as a series of independent, simultaneous local decisions made between a limited set of options, all aimed at reaching a global agreement. Key challenges in these protocols include estimating the likelihood of various outcomes and finding bounds for how long it may take to achieve consensus, if it occurs at all. To date, little attention has been given to the case where some agents have no initial opinion. In this paper, we introduce a variant of the consensus problem which includes what we call `agnostic' nodes and frame it as a combination of two known and well-studied processes: voter model and rumour spreading. We show (1) a martingale that describes the probability of consensus for a given colour, (2) bounds on the number of steps for the process to end using results from rumour spreading and voter models, (3) closed formulas for the probability of consensus in a few special cases, along with a polynomial-time algorithm for the case where the number of agnostic vertices is at most logarithmic and (4) that the computational complexity of estimating the probability with a Markov chain Monte Carlo process is $O(n^2 \log n)$ for general graphs and $O(n\log n)$ for Erdős-Rényi graphs, resulting in a fully polynomial-time randomized approximation scheme (FPRAS) for estimating the probabilities of consensus. Furthermore, we present experimental results suggesting that the number of runs needed for a given standard error decreases when the number of nodes increases.

cs.MA↗

arXiv2014

Noise, transient dynamics, and the generation of realistic interspike interval variation in square-wave burster neurons

First return maps of interspike intervals for biological neurons that generate repetitive bursts of impulses can display stereotyped structures (neuronal signatures). Such structures have been linked to the possibility of multicoding and multifunctionality in neural networks that produce and control rhythmical motor patterns. In some cases, isolating the neurons from their synaptic network revealsirregular, complex signatures that have been regarded as evidence of intrinsic, chaotic behavior. We show that incorporation of dynamical noise into minimal neuron models of square-wave bursting (either conductance-based or abstract) produces signatures akin to those observed in biological examples, without the need for fine-tuning of parameters or ad hoc constructions for inducing chaotic activity. The form of the stochastic term is not strongly constrained, and can approximate several possible sources of noise, e.g. random channel gating or synaptic bombardment. The cornerstone of this signature generation mechanism is the rich, transient, but deterministic dynamics inherent in the square-wave (saddle-node/homoclinic) mode of neuronal bursting. We show that noise causes the dynamics to populate a complex transient scaffolding or skeleton in state space, even for models that (without added noise) generate only periodic activity (whether in bursting or tonic spiking mode).

q-bio.NC↗