Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Cruciani, Emilio"'
In this paper we give the first efficient algorithms for the $k$-center problem on dynamic graphs undergoing edge updates. In this problem, the goal is to partition the input into $k$ sets by choosing $k$ centers such that the maximum distance from a
Externí odkaz:
http://arxiv.org/abs/2307.15557
Publikováno v:
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023). Pages 38-45
Opinion diffusion is a crucial phenomenon in social networks, often underlying the way in which a collective of agents develops a consensus on relevant decisions. The voter model is a well-known theoretical model to study opinion spreading in social
Externí odkaz:
http://arxiv.org/abs/2305.07377
Complex networked systems in fields such as physics, biology, and social sciences often involve interactions that extend beyond simple pairwise ones. Hypergraphs serve as powerful modeling tools for describing and analyzing the intricate behaviors of
Externí odkaz:
http://arxiv.org/abs/2304.07203
We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Starting with all agents sharing an initial opinion representing the statu
Externí odkaz:
http://arxiv.org/abs/2008.13589
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 uniformly at
Externí odkaz:
http://arxiv.org/abs/2007.15306
Spectral techniques have proved amongst the most effective approaches to graph clustering. However, in general they require explicit computation of the main eigenvectors of a suitable matrix (usually the Laplacian matrix of the graph). Recent work (e
Externí odkaz:
http://arxiv.org/abs/1907.07149
The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change their opin
Externí odkaz:
http://arxiv.org/abs/1905.04694
Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social influence is
Externí odkaz:
http://arxiv.org/abs/1902.07454
We investigate the behavior of a simple majority dynamics on networks of agents whose interaction topology exhibits a community structure. By leveraging recent advancements in the analysis of dynamics, we prove that, when the states of the nodes are
Externí odkaz:
http://arxiv.org/abs/1805.01406
Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. This process is known as the
Externí odkaz:
http://arxiv.org/abs/1804.07223