We study a tractable opinion dynamics model that generates long-run disagreements and persistent opinion fluctuations. Our model involves a inhomogeneous stochastic gossip process of continuous opinion dynamics in a society consisting of two types of agents: regular agents, who update their beliefs according to information that they receive from their… (More)
Scaling limits are analyzed for stochastic continuous opinion dynamics systems, also known as gossip models. In such models, agents update their vector-valued opinion to a convex combination (possibly agent-and opinion-dependent) of their current value and that of another observed agent. It is shown that, in the limit of large agent population size, the… (More)
The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniques over networked systems. One important example consists in the remote state estimation under communication constraints. In this case, an anytime transmission scheme consists of an encoder… (More)
—The capacity of finite Abelian group codes over symmetric memoryless channels is determined. For certain important examples, such as m-PSK constellations over AWGN channels, with m a prime power, it is shown that this capacity coincides with the Shannon capacity; i.e. there is no loss in capacity using group codes. (This had previously been known for… (More)
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uniformly, from an arbitrary label group of automorphisms of G. Precise combinatorial results are established for the exponential growth rate of their average type-enumerating… (More)
—A lower bound bound is established on the error probability of fixed-length block-coding systems with finite memory feedback, which can be described in terms of a time dependent finite state machine. It is shown that the reliability function of such coding systems over discrete memoryless channels is upper-bounded by the sphere-packing exponent.
—A class of distributed routing policies is shown to be throughput optimal for single-commodity dynamical flow networks. The latter are modeled as systems of ordinary differential equations derived from mass conservation laws on directed weighted graphs with constant external inflow at each of the possibly multiple origin nodes, and the link weights… (More)
Strong resilience properties of dynamical networks are analyzed for distributed routing policies. The latter are characterized by the property that the way the inflow at a non-destination node gets split among its outgoing links is allowed to depend only on local information about the current particle densities on the outgoing links. The strong resilience… (More)