Related papers: Stochastic Minority on Graphs
It was recently shown how graphs can be used to provide descriptions of psychopathologies, where symptoms of, say, depression, affect each other and certain configurations determine whether someone could fall into a sudden depression. To…
Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
In this article, we study algorithms for dynamic networks with asynchronous start, i.e., each node may start running the algorithm in a different round. Inactive nodes transmit only heartbeats, which contain no information but can be…
In this dissertation, we study temporally stochasticity in cellular automata and the behavior of such cellular automata. The work also explores the computational ability of such cellular automaton that illustrates the computability of…
In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
Synchronization of neural networks has been used for novel public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive…
This paper considers a Markov-modulated duplication-deletion random graph where at each time instant, one node can either join or leave the network; the probabilities of joining or leaving evolve according to the realization of a finite…
Complex networks are the subject of fundamental interest from the scientific community at large. Several metrics have been introduced to characterize the structure of these networks, such as the degree distribution, degree correlation, path…
Properties of systems with majority voting rules have been exhaustingly studied. In this work we focus on the randomized case - where the system is initialized by randomized initial set of seeds. Our main aim is to give an asymptotic…
The structure and dynamic of social network are largely determined by the heterogeneous interaction activity and social capital allocation of individuals. These features interplay in a non-trivial way in the formation of network and…
We propose an adaptive control strategy for the simultaneous estimation of topology and synchronization in complex dynamical networks with unknown, time-varying topology. Our approach transforms the problem of time-varying topology…
A broad range of dynamical systems involve multi-body interactions, or group interactions, which may not be encoded in traditional graphical structures. In this work, we focus on a canonical example from opinion dynamics, the Majority Rule,…
In this paper we study the synchronization properties of random geometric graphs. We show that the onset of synchronization takes place roughly at the same value of the order parameter that a random graph with the same size and average…
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are…
In human crowds, interactions among individuals give rise to a variety of self-organized collective motions that help the group to effectively solve the problem of coordination. However, it is still not known exactly how humans adjust their…
We consider a fully stochastic excitatory neuronal network with a number of subpopulations with different firing rates. We show that as network size goes to infinity, this limits on a deterministic hybrid model whose trajectories are…