We study how to spread k tokens of information to every node on an n-node dynamic
network, the edges of which are changing at each round. This basic gossip problem can be …

We study the problem of exploration by a mobile entity (agent) of a class of dynamic
networks, namely constantly connected dynamic graphs. This problem has already been …

We study lower bounds on information dissemination in adversarial dynamic networks.
Initially, k pieces of information (henceforth called tokens) are distributed among n nodes …

In this paper, we study the T-interval-connected dynamic graphs from the point of view of the
time necessary and sufficient for their exploration by a mobile entity (agent). A dynamic …

The paper investigates efficient distributed computation in dynamic networks in which the
network topology changes (arbitrarily) from round to round. Random walks are a …

Modern social media networks have become an important platform for information
competition among countries, regions, companies, and other parties. This article utilizes the …

Today's wireless networks tend to be centralized: they are organized around a fixed central
backbone such as a network of cellular towers or wireless access points. However, as …

基于新浪新闻数据, 对热点新闻的连续发表事件时间间隔序列进行了统计分析,
以探究新闻内容的选择机制. 实证发现该时间间隔分布在个类与总体层面上都遵循带指数截断的 …

We study how to spread $ k $ tokens of information to every node on an $ n $-node dynamic
network, the edges of which are changing at each round. This basic {\em gossip problem} …

Dans cet article, nous étudions les graphes dynamiques T-intervalle-connexes du point de
vue du temps nécessaire à leur exploration par une entité mobile (agent). Un graphe …