Order preservation in a generalized version of Krause's opinion dynamics model

Krause's model of opinion dynamics has recently been the object of several studies, partly because it is one of the simplest multi-agent systems involving position-dependent changing topologies. In this model, agents have an opinion represented by a real number and they update it by averaging those agent opinions distant from their opinion by less than a certain interaction radius. Some results obtained on this model rely on the fact that the opinion orders remain unchanged under iteration, a property that is consistent with the intuition in models with simultaneous updating on a fully connected communication topology. Several variations of this model have been proposed. We show that some natural variations are not order preserving and therefore cause potential problems with the theoretical analysis and the consistence with the intuition. We consider a generic version of Krause's model parameterized by an influence function that encapsulates most of the variations proposed in the literature. We then derive a necessary and sufficient condition on this function for the opinion order to be preserved.Comment: 10 pages, 6 figures, 13 eps file

Push sum with transmission failures

The push-sum algorithm allows distributed computing of the average on a directed graph, and is particularly relevant when one is restricted to one-way and/or asynchronous communications. We investigate its behavior in the presence of unreliable communication channels where messages can be lost. We show that exponential convergence still holds and deduce fundamental properties that implicitly describe the distribution of the final value obtained. We analyze the error of the final common value we get for the essential case of two nodes, both theoretically and numerically. We provide performance comparison with a standard consensus algorithm

On symmetric continuum opinion dynamics

This paper investigates the asymptotic behavior of some common opinion dynamic models in a continuum of agents. We show that as long as the interactions among the agents are symmetric, the distribution of the agents' opinion converges. We also investigate whether convergence occurs in a stronger sense than merely in distribution, namely, whether the opinion of almost every agent converges. We show that while this is not the case in general, it becomes true under plausible assumptions on inter-agent interactions, namely that agents with similar opinions exert a non-negligible pull on each other, or that the interactions are entirely determined by their opinions via a smooth function.Comment: 28 pages, 2 figures, 3 file

Continuous-Time Consensus under Non-Instantaneous Reciprocity

We consider continuous-time consensus systems whose interactions satisfy a form or reciprocity that is not instantaneous, but happens over time. We show that these systems have certain desirable properties: They always converge independently of the specific interactions taking place and there exist simple conditions on the interactions for two agents to converge to the same value. This was until now only known for systems with instantaneous reciprocity. These result are of particular relevance when analyzing systems where interactions are a priori unknown, being for example endogenously determined or random. We apply our results to an instance of such systems.Comment: 12 pages, 4 figure

Lunar accretion from a Roche-interior fluid disk

We use a hybrid numerical approach to simulate the formation of the Moon from an impact-generated disk, consisting of a fluid model for the disk inside the Roche limit and an N-body code to describe accretion outside the Roche limit. As the inner disk spreads due to a thermally regulated viscosity, material is delivered across the Roche limit and accretes into moonlets that are added to the N-body simulation. Contrary to an accretion timescale of a few months obtained with prior pure N-body codes, here the final stage of the Moon's growth is controlled by the slow spreading of the inner disk, resulting in a total lunar accretion timescale of ~10^2 years. It has been proposed that the inner disk may compositionally equilibrate with the Earth through diffusive mixing, which offers a potential explanation for the identical oxygen isotope compositions of the Earth and Moon. However, the mass fraction of the final Moon that is derived from the inner disk is limited by resonant torques between the disk and exterior growing moons. For initial disks containing < 2.5 lunar masses (ML), we find that a final Moon with mass > 0.8ML contains < 60% material derived from the inner disk, with this material preferentially delivered to the Moon at the end of its accretion.Comment: 42 pages, 10 figures, 5 tables. Accepted for publication in The Astrophysical Journa

On the mean square error of randomized averaging algorithms

This paper regards randomized discrete-time consensus systems that preserve the average "on average". As a main result, we provide an upper bound on the mean square deviation of the consensus value from the initial average. Then, we apply our result to systems where few or weakly correlated interactions take place: these assumptions cover several algorithms proposed in the literature. For such systems we show that, when the network size grows, the deviation tends to zero, and the speed of this decay is not slower than the inverse of the size. Our results are based on a new approach, which is unrelated to the convergence properties of the system.Comment: 11 pages. to appear as a journal publicatio