Opinion dynamics in social networks with stubborn agents: Equilibrium and convergence rate
The process by which new ideas, innovations, and behaviors spread through a large social
network can be thought of as a networked interaction game: Each agent obtains information …
network can be thought of as a networked interaction game: Each agent obtains information …
Opinion dynamics in social networks: A local interaction game with stubborn agents
The process by which new ideas, innovations, and behaviors spread through a large social
network can be thought of as a networked interaction game: Each agent obtains information …
network can be thought of as a networked interaction game: Each agent obtains information …
Minimizing convergence error in multi-agent systems via leader selection: A supermodular optimization approach
In a leader-follower multi-agent system (MAS), the leader agents act as control inputs and
influence the states of the remaining follower agents. The rate at which the follower agents …
influence the states of the remaining follower agents. The rate at which the follower agents …
[图书][B] Submodularity in dynamics and control of networked systems
This book presents a framework for the control of networked systems utilizing submodular
optimization techniques. The main focus is on selecting input nodes for the control of …
optimization techniques. The main focus is on selecting input nodes for the control of …
Opinion-based centrality in multiplex networks: A convex optimization approach
A Reiffers-Masson, V Labatut - Network science, 2017 - cambridge.org
Most people simultaneously belong to several distinct social networks, in which their
relations can be different. They have opinions about certain topics, which they share and …
relations can be different. They have opinions about certain topics, which they share and …
Manufacturing consent
We consider a variant of the gossip algorithm wherein a controller can influence the values
at a subset of nodes as well as the averaging weights. This leads to three optimization …
at a subset of nodes as well as the averaging weights. This leads to three optimization …
Optimal k-centers of a graph: a control-theoretic approach
In a network consisting of n nodes, our goal is to identify the most central k nodes with
respect to the proposed definitions of centrality. Depending on the specific application, there …
respect to the proposed definitions of centrality. Depending on the specific application, there …
Posting behavior dynamics and active filtering for content diversity in social networks
In this paper, we have two objectives: First, we model the posting behavior of publishers in
Social Networks which have externalities, and the second objective is to propose content …
Social Networks which have externalities, and the second objective is to propose content …
[HTML][HTML] An algorithm for identifying optimal spreaders in a random walk model of network communication
FY Hunt - Journal of Research of the National Institute of …, 2016 - ncbi.nlm.nih.gov
In a model of network communication based on a random walk in an undirected graph, what
subset of nodes (subject to constraints on the set size), enables the fastest spread of …
subset of nodes (subject to constraints on the set size), enables the fastest spread of …
The structure of optimal and near optimal target sets in consensus models
FY Hunt - arXiv preprint arXiv:1408.4364, 2014 - arxiv.org
We consider the problem of identifying a subset of nodes in a network that will enable the
fastest spread of information in a decentralized environment. In a model of communication …
fastest spread of information in a decentralized environment. In a model of communication …