Related papers: Interacting Urns on Directed Networks with Node-De…
The adaptive voter model allows for studying the interplay between homophily, the tendency of like-minded individuals to attract each other, and social influence, the tendency for connected individuals to influence each other. However, it…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
We consider the distributed optimization problem for the sum of convex functions where the underlying communications network connecting agents at each time is drawn at random from a collection of directed graphs. Building on an earlier work…
This work studies the problem of inferring whether an agent is directly influenced by another agent over an adaptive diffusion network. Agent i influences agent j if they are connected (according to the network topology), and if agent j…
We consider a version of the classical P\'olya urn scheme which incorporates innovations. The space $S$ of colors is an arbitrary measurable set. After each sampling of a ball in the urn, one returns $C$ balls of the same color and…
We study the problem of robust influence maximization in dynamic diffusion networks. In line with recent works, we consider the scenario where the network can undergo insertion and removal of nodes and edges, in discrete time steps, and the…
We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…
In this Letter we identify the general rules that determine the synchronization properties of interconnected networks. We study analytically, numerically and experimentally how the degree of the nodes through which two networks are…
Consider a directed network where each node is either red (using the red product), blue (using the blue product), or uncolored (undecided). Then in each round, an uncolored node chooses red (resp. blue) with some probability proportional to…
In this Letter we propose a method to control a set of arbitrary nodes in a directed network such that they follow a synchronous trajectory which is, in general, not shared by the other units of the network. The problem is inspired to those…
In this paper, we consider a population of individuals who have actions and opinions, which coevolve, mutually influencing one another on a complex network structure. In particular, we formulate a control problem for this social network, in…
Competitive interactions represent one of the driving forces behind evolution and natural selection in biological and sociological systems. For example, animals in an ecosystem may vie for food or mates; in a market economy, firms may…
Recent work in modeling the coupling between disease dynamics and dynamic social network geometry has led to the examination of how human interactions force a rewiring of connections in a population. Rewiring of the network may be…
Entrainment of randomly coupled oscillator networks by periodic external forcing applied to a subset of elements is numerically and analytically investigated. For a large class of interaction functions, we find that the entrainment window…
We study asymptotic dynamical patterns that emerge among a set of nodes interacting in a dynamically evolving signed random network, where positive links carry out standard consensus and negative links induce relative-state flipping. A…
We consider the problem of influence maximization in fixed networks for contagion models in an adversarial setting. The goal is to select an optimal set of nodes to seed the influence process, such that the number of influenced nodes at the…
Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful,…
Brain networks are adaptively rewired continually, adjusting their topology to bring about functionality and efficiency in sensory, motor and cognitive tasks. In model neural network architectures, adaptive rewiring generates complex,…
An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0\leq L<U\leq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together…
This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We…