Related papers: The Sznajd dynamics on a directed clustered networ…
Classical distributed estimation scenarios typically assume timely and reliable exchanges of information over the sensor network. This paper, in contrast, considers single time-scale distributed estimation via a sensor network subject to…
The three-state majority-vote model with noise on Erdos-Renyi's random graphs has been studied. Using Monte Carlo simulations we obtain the phase diagram, along with the critical exponents. Exact results for limiting cases are presented,…
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…
This paper studies a distributed algorithm for constrained consensus optimization that is obtained by fusing the Arrow-Hurwicz-Uzawa primal-dual gradient method for centralized constrained optimization and the Wang-Elia method for…
In the high dimensional Stochastic Blockmodel for a random network, the number of clusters (or blocks) K grows with the number of nodes N. Two previous studies have examined the statistical estimation performance of spectral clustering and…
The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on…
We use a method of Luczak (arXiv:1212.3231) to investigate the equilibrium distribution of a dynamic routing model on a network. In this model, there are $n$ nodes, each pair joined by a link of capacity $C$. For each pair of nodes, calls…
The adaptive voter model has been widely studied as a conceptual model for opinion formation processes on time-evolving social networks. Past studies on the effect of zealots, i.e. nodes aiming to spread their fixed opinion throughout the…
Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed - in the sense that there is directionality on…
The Planck collaboration has extensively used the six Planck HFI frequency maps to detect the Sunyaev-Zel'dovich (SZ) effect with dedicated methods, e.g., by applying (i) component separation to construct a full sky map of the y parameter…
Online social networks are a dominant medium in everyday life to stay in contact with friends and to share information. In Twitter, users can connect with other users by following them, who in turn can follow back. In recent years,…
Many biological, ecological and economic systems are best described by weighted networks, as the nodes interact with each other with varying strength. However, most network models studied so far are binary, the link strength being either 0…
We examine the ability of the Sunyaev-Zel'dovich effect (SZE) statistics proposed by Lee (2002) using numerical simulations. The statistics describe the distribution of the peak heights in the noise-contaminated SZE sky maps, and provide an…
The study of dynamical systems on complex networks is of paramount importance in engineering, given that many natural and artificial systems find a natural embedding on discrete topologies. For instance, power grids, chemical reactors and…
Methods for efficiently controlling dynamics propagated on networks are usually based on identifying the most influential nodes. Knowledge of these nodes can be used for the targeted control of dynamics such as epidemics, or for modifying…
In this work we tackle a kinetic-like model of opinions dynamics in a networked population endued with a quenched plurality and polarization. Additionally, we consider pairwise interactions that are restrictive, which is modeled with a…
The redshift dependence of the observed cluster abundance due to the Sunyaev-Zeldovich Effect (SZE) is studied in various cosmological models including flat and open homogeneous (CDM) models and an inhomogeneous model with a large-scale…
The paper considers a distributed robust estimation problem over a network with Markovian randomly varying topology. The objective is to deal with network variations locally, by switching observer gains at affected nodes only. We propose…
We study dynamic networks under an undirected consensus communication protocol and with one state-dependent weighted edge. We assume that the aforementioned dynamic edge can take values over the whole real numbers, and that its behaviour…
We present an analytical approach to determining the expected cascade size in a broad range of dynamical models on the class of random networks with arbitrary degree distribution and nonzero clustering introduced in [M.E.J. Newman, Phys.…