arXiv subjects

Bernard Chazelle

Publications and source records attributed to Bernard Chazelle.

17 recordsLinked to original sources

arXiv2026

The $s$-Energy and Its Applications

Many multi-agent systems evolve by repeatedly updating each state to a weighted average of its neighbors, a process known as averaging dynamics, whose behavior becomes difficult to analyze when the interaction network varies over time. In recent years, the $s$-energy has emerged as a useful tool for bounding the convergence rates of such systems, complementing the classical techniques that rely on fixed graphs. We derive new bounds on the $s$-energy under minimal connectivity assumptions. As a consequence, we obtain convergence guarantees for several models of collective dynamics and resolve a number of open questions in the areas. Our results highlight the dependence of the $s$-energy on the connectivity of the underlying networks and use it to explain the exponential gap in the convergence rates of stationary and time-varying consensus systems.

math.OC↗

arXiv2024

The Geometry of Cyclical Social Trends

We investigate the emergence of periodic behavior in opinion dynamics and its underlying geometry. For this, we use a bounded-confidence model with contrarian agents in a convolution social network. This means that agents adapt their opinions by interacting with their neighbors in a time-varying social network. Being contrarian, the agents are kept from reaching consensus. This is the key feature that allows the emergence of cyclical trends. We show that the systems either converge to nonconsensual equilibrium or are attracted to periodic or quasi-periodic orbits. We bound the dimension of the attractors and the period of cyclical trends. We exhibit instances where each orbit is dense and uniformly distributed within its attractor. We also investigate the case of randomly changing social networks.

cs.MA↗

arXiv2022

Quick Relaxation in Collective Motion

We establish sufficient conditions for the quick relaxation to kinetic equilibrium in the classic Vicsek-Cucker-Smale model of bird flocking. The convergence time is polynomial in the number of birds as long as the number of flocks remains bounded. This new result relies on two key ingredients: exploiting the convex geometry of embedded averaging systems; and deriving new bounds on the s-energy of disconnected agreement systems. We also apply our techniques to bound the relaxation time of certain pattern-formation robotic systems investigated by Sugihara and Suzuki.

cs.MA↗

arXiv2020

A guided network propagation approach to identify disease genes that combines prior and new information

A major challenge in biomedical data science is to identify the causal genes underlying complex genetic diseases. Despite the massive influx of genome sequencing data, identifying disease-relevant genes remains difficult as individuals with the same disease may share very few, if any, genetic variants. Protein-protein interaction networks provide a means to tackle this heterogeneity, as genes causing the same disease tend to be proximal within networks. Previously, network propagation approaches have spread signal across the network from either known disease genes or genes that are newly putatively implicated in the disease (e.g., found to be mutated in exome studies or linked via genome-wide association studies). Here we introduce a general framework that considers both sources of data within a network context. Specifically, we use prior knowledge of disease-associated genes to guide random walks initiated from genes that are newly identified as perhaps disease-relevant. In large-scale testing across 24 cancer types, we demonstrate that our approach for integrating both prior and new information not only better identifies cancer driver genes than using either source of information alone but also readily outperforms other state-of-the-art network-based approaches. To demonstrate the versatility of our approach, we also apply it to genome-wide association data to identify genes functionally relevant for several complex diseases. Overall, our work suggests that guided network propagation approaches that utilize both prior and new data are a powerful means to identify disease genes.

q-bio.GN↗

arXiv2019

Toward a Theory of Markov Influence Systems and their Renormalization

We introduce the concept of a Markov influence system (MIS) and analyze its dynamics. An MIS models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution. This article consists of two independent parts: in the first one, we generalize the standard classification of Markov chain states to the time-varying case by showing how to "parse" graph sequences; in the second part, we use this framework to carry out the bifurcation analysis of a few important MIS families. We show that, in general, these systems can be chaotic but that irreducible MIS are almost always asymptotically periodic. We give an example of "hyper-torpid" mixing, where a stationary distribution is reached in super-exponential time, a timescale beyond the reach of any Markov chain.

cs.MA↗

arXiv2018

A Sharp Bound on the $s$-Energy and Its Applications to Averaging Systems

The {\em $s$-energy} is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of $(3/ρs)^{n-1}$ on the $s$-energy of an $n$-agent symmetric averaging system, for any positive real $s\leq 1$, where~$ρ$ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of {\em twist systems}. We show how to use the new bound on the $s$-energy to tighten the convergence rate of systems in opinion dynamics, flocking, and synchronization.

cs.MA↗

arXiv2016

Gaussian Learning-Without-Recall in a Dynamic Social Network

We analyze the dynamics of the Learning-Without-Recall model with Gaussian priors in a dynamic social network. Agents seeking to learn the state of the world, the "truth", exchange signals about their current beliefs across a changing network and update them accordingly. The agents are assumed memoryless and rational, meaning that they Bayes-update their beliefs based on current states and signals, with no other information from the past. The other assumption is that each agent hears a noisy signal from the truth at a frequency bounded away from zero. Under these conditions, we show that the system reaches truthful consensus almost surely with a convergence rate that is polynomial in expectation. Somewhat paradoxically, high outdegree can slow down the learning process. The lower-bound assumption on the truth-hearing frequency is necessary: even infinitely frequent access to the truth offers no guarantee of truthful consensus in the limit.

math.OC↗

arXiv2016

Self-Sustaining Iterated Learning

An important result from psycholinguistics (Griffiths & Kalish, 2005) states that no language can be learned iteratively by rational agents in a self-sustaining manner. We show how to modify the learning process slightly in order to achieve self-sustainability. Our work is in two parts. First, we characterize iterated learnability in geometric terms and show how a slight, steady increase in the lengths of the training sessions ensures self-sustainability for any discrete language class. In the second part, we tackle the nondiscrete case and investigate self-sustainability for iterated linear regression. We discuss the implications of our findings to issues of non-equilibrium dynamics in natural algorithms.

math.OC↗

arXiv2016

Inertial Hegselmann-Krause Systems

We derive an energy bound for inertial Hegselmann-Krause (HK) systems, which we define as a variant of the classic HK model in which the agents can change their weights arbitrarily at each step. We use the bound to prove the convergence of HK systems with closed-minded agents, which settles a conjecture of long standing. This paper also introduces anchored HK systems and show their equivalence to the symmetric heterogeneous model.

eess.SY↗

arXiv2015

Noisy Hegselmann-Krause Systems: Phase Transition and the 2R-Conjecture

The classic Hegselmann-Krause (HK) model for opinion dynam- ics consists of a set of agents on the real line, each one instructed to move, at every time step, to the mass center of all the agents within a fixed distance R. In this work, we investigate the effects of noise in the continuous-time version of the model as described by its mean-field limiting Fokker-Planck equation. In the presence of a finite number of agents, the system exhibits a phase transition from order to disorder as the noise increases. The ordered phase features clusters whose width depends only on the noise level. We introduce an order parameter to track the phase transition and resolve the corresponding phase dia- gram. The system undergoes a phase transition for small R but none for larger R. Based on the stability analysis of the mean-field equation, we derive the existence of a forbidden zone for the disordered phase to emerge. We also provide a theoretical explanation for the well-known 2R conjecture, which states that, for a random initial distribution in a fixed interval, the final configuration consists of clusters separated by a distance of roughly 2R. Our theoretical analysis also confirms previous simulations and predicts properties of the noisy HK model in higher dimension.

math.OC↗

arXiv2015

Well-Posedness of the Limiting Equation of a Noisy Consensus Model in Opinion Dynamics

This paper establishes the global well-posedness of the nonlinear Fokker-Planck equation for a noisy version of the Hegselmann-Krause model. The equation captures the mean-field behavior of a classic multiagent system for opinion dynamics. We prove the global existence, uniqueness, nonnegativity and regularity of the weak solution. We also exhibit a global stability condition, which delineates a forbidden region for consensus formation. This is the first nonlinear stability result derived for the Hegselmann-Krause model.

math.AP↗

arXiv2013

Data Structures on Event Graphs

We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type insert, delete and query. The algorithm responds to the requests as it encounters them during a (random or adversarial) walk in G. We study the limit behavior of such a walk and give an efficient algorithm for recognizing which structures can be generated. We also give a near-optimal algorithm for successor searching if the event graph is a cycle and the walk is adversarial. For a random walk, the algorithm becomes optimal.

cs.DS↗

arXiv2012

On the Convergence of the Hegselmann-Krause System

We study convergence of the following discrete-time non-linear dynamical system: n agents are located in R^d and at every time step, each moves synchronously to the average location of all agents within a unit distance of it. This popularly studied system was introduced by Krause to model the dynamics of opinion formation and is often referred to as the Hegselmann-Krause model. We prove the first polynomial time bound for the convergence of this system in arbitrary dimensions. This improves on the bound of n^{O(n)} resulting from a more general theorem of Chazelle. Also, we show a quadratic lower bound and improve the upper bound for one-dimensional systems to O(n^3).

cs.DS↗

arXiv2012

The Dynamics of Influence Systems

Influence systems form a large class of multiagent systems designed to model how influence, broadly defined, spreads across a dynamic network. We build a general analytical framework which we then use to prove that, while sometimes chaotic, influence dynamics of the diffusive kind is almost always asymptotically periodic. Besides resolving the dynamics of a popular family of multiagent systems, the other contribution of this work is to introduce a new type of renormalization-based bifurcation analysis for multiagent systems.

nlin.AO↗

arXiv2010

The Total s-Energy of a Multiagent System

We introduce the "total s-energy" of a multiagent system with time-dependent links. This provides a new analytical lens on bidirectional agreement dynamics, which we use to bound the convergence rates of dynamical systems for synchronization, flocking, opinion dynamics, and social epistemology.

nlin.AO↗

arXiv2010

Self-Improving Algorithms

We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an unknown input distribution D. We assume here that D is of product type. More precisely, suppose that we need to process a sequence I_1, I_2, ... of inputs I = (x_1, x_2, ..., x_n) of some fixed length n, where each x_i is drawn independently from some arbitrary, unknown distribution D_i. The goal is to design an algorithm for these inputs so that eventually the expected running time will be optimal for the input distribution D = D_1 * D_2 * ... * D_n. We give such self-improving algorithms for two problems: (i) sorting a sequence of numbers and (ii) computing the Delaunay triangulation of a planar point set. Both algorithms achieve optimal expected limiting complexity. The algorithms begin with a training phase during which they collect information about the input distribution, followed by a stationary regime in which the algorithms settle to their optimized incarnations.

cs.DS↗

arXiv2009

The Convergence of Bird Flocking

We bound the time it takes for a group of birds to reach steady state in a standard flocking model. We prove that (i) within single exponential time fragmentation ceases and each bird settles on a fixed flying direction; (ii) the flocking network converges only after a number of steps that is an iterated exponential of height logarithmic in the number of birds. We also prove the highly surprising result that this bound is optimal. The model directs the birds to adjust their velocities repeatedly by averaging them with their neighbors within a fixed radius. The model is deterministic, but we show that it can tolerate a reasonable amount of stochastic or even adversarial noise. Our methods are highly general and we speculate that the results extend to a wider class of models based on undirected flocking networks, whether defined metrically or topologically. This work introduces new techniques of broader interest, including the "flight net," the "iterated spectral shift," and a certain "residue-clearing" argument in circuit complexity.

cs.CG↗