Related papers: Information cascade on networks and phase transiti…
In many applications, it becomes necessary for a set of distributed network nodes to agree on a common value or opinion as quickly as possible and with minimal communication overhead. The classical 2-choices rule is a well-known distributed…
A spatial network is constructed on a two dimensional space where the nodes are geometrical points located at randomly distributed positions which are labeled sequentially in increasing order of one of their co-ordinates. Starting with $N$…
We present a model for growing information networks where the ageing of a node depends on the time at which it entered the network and on the last time it was cited. The model is shown to undergo a transition from a small-world to…
Despite its importance for practical applications, not much is known about the optimal shape of a network that connects in an efficient way a set of points. This problem can be formulated in terms of a multiplex network with a fast layer…
We introduce a model to study the delicate relation between the spreading of information and the formation of opinions in social systems. For this purpose, we propose a two-layer multiplex network model in which consensus dynamics takes…
We present a mathematical description of the voter model dynamics on heterogeneous networks. When the average degree of the graph is $\mu \leq 2$ the system reaches complete order exponentially fast. For $\mu >2$, a finite system falls,…
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described…
Consider a graph where each of the $n$ nodes is either in state $\mathcal{R}$ or $\mathcal{B}$. Herein, we analyze the \emph{synchronous $k$-Majority dynamics}, where in each discrete-time round nodes simultaneously sample $k$ neighbors…
Neutral models aspire to explain biodiversity patterns in ecosystems where species difference can be neglected, as it might occur at a specific trophic level, and perfect symmetry is assumed between species. Voter-like models capture the…
We examine the global organization of growing networks in which a new vertex is attached to already existing ones with a probability depending on their age. We find that the network is infinite- or finite-dimensional depending on whether…
We generalize previous studies on critical phenomena in communication networks by adding computational capabilities to the nodes to better describe real-world situations such as cloud computing. A set of tasks with random origin and…
We consider the problem of estimating the latent structure of a social network based on the observed information diffusion events, or cascades, where the observations for a given cascade consist of only the timestamps of infection for…
We study ground-state quantum entanglement in the one-dimensional Bose-Hubbard model in the presence of a harmonic trap. We focus on two transitions that occur upon increasing the characteristic particle density: the formation of a…
We describe a simple model of heterogeneous, interacting agents making decisions between $n\ge 2$ discrete choices. For a special class of interactions, our model is the mean field description of random-field Potts-like models, and is…
We introduce and analyze a voter-type model on a two-layer multiplex network, where the presence of a state on one layer acts as a catalyst or inhibitor to the propagation of that state on the other layer. Despite the model's simplicity,…
The phage $\lambda$ infection of an \textit{E. coli} cell has become a paradigm for understanding the molecular processes involved in gene expression and cell signaling. This system provides an example of a genetic switch, as cells with…
Spreading (diffusion) of innovations is a stochastic process on social networks. When the key driving mechanism is peer effects (word of mouth), the rate at which the aggregate adoption level increases with time depends strongly on the…
Although static networks have been extensively studied in machine learning, data mining, and AI communities for many decades, the study of dynamic networks has recently taken center stage due to the prominence of social media and its…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…
Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and latency…