Related papers: Copy-Spread-Annihilate Dynamics in Degree-Assortat…
This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…
This paper considers a network of stochastic evidence accumulators, each represented by a drift-diffusion model accruing evidence towards a decision in continuous time by observing a noisy signal and by exchanging information with other…
Partitioning large networks into stable clusters of synchronized nodes is a challenging task. Recent approaches based on spectral analysis can provide exact results on specific dynamics but remain unfeasible for very large networks.…
Spreading processes are often modelled as a stochastic dynamics occurring on top of a given network with edge weights corresponding to the transmission probabilities. Knowledge of veracious transmission probabilities is essential for…
In this paper, we focus on the problem of data sharing over a wireless computer network (i.e., a wireless grid). Given a set of available data, we present a distributed algorithm which operates over a dynamically changing network, and…
The co-evolution of structure and dynamics, known as adaptivity, is a fundamental property in various systems and drives diverse emergent behaviors. However, the adaptivity in previous works is primarily stemmed from pairwise situations,…
Self-organization of robust and efficient networks is important for a future design of communication or transportation systems, because both characteristics are not coexisting in many real networks. As one of the candidates for the…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
We consider large networks of theta neurons and use the Ott/Antonsen ansatz to derive degree-based mean field equations governing the expected dynamics of the networks. Assuming random connectivity we investigate the effects of varying the…
Co-evolution exhibited by a network system, involving the intricate interplay between the dynamics of the network itself and the subsystems connected by it, is a key concept for understanding the self-organized, flexible nature of…
We study binary coordination games over graphs under log-linear learning when neighbor actions are conveyed through explicit noisy communication links. Each edge is modeled as either a binary symmetric channel (BSC) or a binary erasure…
This paper considers distributed resource allocation and sum-preserving constrained optimization over lossy networks, where the links are unreliable and subject to packet drops. We define the conditions to ensure convergence under packet…
We introduce a minimalistic model based on dynamic node deletion and node duplication with heterodimerisation. The model is intended to capture the essential features of the evolution of protein interaction networks. We derive an exact…
In many complex systems, the dynamic processes that take place on a network and the changes in the network topology are intertwined. Here, we propose a model of coevolutionary dynamics of information spreading which is accompanied with link…
The brain must robustly store a large number of memories, corresponding to the many events encountered over a lifetime. However, the number of memory states in existing neural network models either grows weakly with network size or recall…
In this paper, downlink transmission scheduling of popular files is optimized with the assistance of wireless cache nodes. Specifically, the requests of each file, which is further divided into a number of segments, are modeled as a Poisson…
A simple feedback control algorithm is presented for distributed beamforming in a wireless network. A network of wireless sensors that seek to cooperatively transmit a common message signal to a Base Station (BS) is considered. In this…
We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich--club connectivity are preserved. We consider three real networks, the AS--Internet, the protein interaction and the…
We show that the entropy of the distribution of avalanche lifetimes in the Kinouchi-Copelli model always achieves a maximum jointly with the dynamic range. This is noteworthy and nontrivial because while the dynamic range is an equilibrium…
Distributed consensus has been widely studied for sensor network applications. Whereas the asymptotic convergence rate has been extensively explored in prior work, other important and practical issues, including energy efficiency and link…