中文
相关论文

相关论文: Tight Bounds on Information Dissemination in Spars…

200 篇论文

With the rise of social media, misinformation has become increasingly prevalent, fueled largely by the spread of rumors. This study explores the use of Large Language Model (LLM) agents within a novel framework to simulate and analyze the…

社会与信息网络 · 计算机科学 2025-02-04 Tianrui Hu , Dimitrios Liakopoulos , Xiwen Wei , Radu Marculescu , Neeraja J. Yadwadkar

The problem of near-optimal distributed path planning to locally sensed targets is investigated in the context of large swarms. The proposed algorithm uses only information that can be locally queried, and rigorous theoretical results on…

机器人学 · 计算机科学 2015-03-19 Ishanu Chattopadhyay

Propagation of chaos is a well-studied phenomenon and shows that weakly interacting diffusions may become independent as the system size converges to infinity. Most of the literature focuses on the case of exchangeable systems where all…

概率论 · 数学 2021-03-09 Martin Hutzenthaler , Daniel Pieper

Localizing moving targets in unknown harsh environments has always been a severe challenge. This letter investigates a novel localization system based on multi-agent networks, where multiple agents serve as mobile anchors broadcasting their…

信号处理 · 电气工程与系统科学 2021-09-27 Qin Shi , Xiaowei Cui , Sihao Zhao , Mingquan Lu

In this paper, a distributed velocity-constrained consensus problem is studied for discrete-time multi-agent systems, where each agent's velocity is constrained to lie in a nonconvex set. A distributed constrained control algorithm is…

最优化与控制 · 数学 2020-03-05 Peng Lin , Wei Ren , Huijun Gao

In this paper, our recently proposed mobile-conductance based analytical framework is extended to the sparse settings, thus offering a unified tool for analyzing information spreading in mobile networks. A penalty factor is identified for…

网络与互联网体系结构 · 计算机科学 2014-04-01 Huazi Zhang , Yufan Huang , Zhaoyang Zhang , Huaiyu Dai

In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate $k$ distinct messages to all $n$ nodes in a network. For arbitrary networks we provide a new upper bound for…

信息论 · 计算机科学 2011-01-25 Chen Avin , Michael Borokhovich , Keren Censor-Hillel , Zvi Lotker

A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along…

数据结构与算法 · 计算机科学 2019-09-02 Sébastien Bouchard , Yoann Dieudonné , Andrzej Pelc

We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the…

数据结构与算法 · 计算机科学 2013-11-13 Zeyu Guo , He Sun

Mobility causes network structures to change. In PSNs where underlying network structure is changing rapidly, we are interested in studying how information dissemination can be enhanced in a sparse disconnected network where nodes lack the…

网络与互联网体系结构 · 计算机科学 2012-10-22 Rachit Agarwal , Vincent Gauthier , Monique Becker

This paper focuses on modeling and analysis of the temporal performance variations experienced by a mobile user in a wireless network and its impact on system level design. We consider a simple stochastic geometry model: the infrastructure…

信息论 · 计算机科学 2016-09-29 Pranav Madadi , François Baccelli , Gustavo de Veciana

In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless…

网络与互联网体系结构 · 计算机科学 2009-07-13 Chen Avin , Yuval Lando , Zvi Lotker

In this paper, we study a distributed parameter estimation problem with an asynchronous communication protocol over multi-agent systems. Different from traditional time-driven communication schemes, in this work, data can be transmitted…

系统与控制 · 计算机科学 2019-03-04 Xingkang He , Qian Liu , Junfeng Wu , Karl Henrik Johansson

We report on a data-driven investigation aimed at understanding the dynamics of message spreading in a real-world dynamical network of human proximity. We use data collected by means of a proximity-sensing network of wearable sensors that…

网络与互联网体系结构 · 计算机科学 2012-08-09 André Panisson , Alain Barrat , Ciro Cattuto , Wouter Van den Broeck , Giancarlo Ruffo , Rossano Schifanella

In this paper, we study estimation of potentially unstable linear dynamical systems when the observations are distributed over a network. We are interested in scenarios when the information exchange among the agents is restricted. In…

信息论 · 计算机科学 2011-11-22 Usman A. Khan , Ali Jadbabaie

The burst in the use of online social networks over the last decade has provided evidence that current rumor spreading models miss some fundamental ingredients in order to reproduce how information is disseminated. In particular, recent…

物理与社会 · 物理学 2013-04-02 Javier Borge-Holthoefer , Sandro Meloni , Bruno Gonçalves , Yamir Moreno

Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumor spreading are among the most…

The rapid diffusion of information and the adoption of social behaviors are of critical importance in situations as diverse as collective actions, pandemic prevention, or advertising and marketing. Although the dynamics of large cascades…

物理与社会 · 物理学 2020-12-30 Hao Peng , Azadeh Nematzadeh , Daniel M. Romero , Emilio Ferrara

In practice, wireless networks are deployed over finite domains, the level of mobility is different at different locations, and user mobility is correlated over time. All these features have an impact on the temporal properties of…

网络与互联网体系结构 · 计算机科学 2020-09-01 Konstantinos Koufos , Carl P. Dettmann

We study the information spreading yielded by the \emph{(Parsimonious) $1$-Flooding Protocol} in geometric Mobile Ad-Hoc Networks. We consider $n$ agents on a convex plane region of diameter $D$ performing independent random walks with move…

社会与信息网络 · 计算机科学 2011-01-28 Andrea Clementi , Riccardo Silvestri