...
【24h】

A dynamical systems view of network centrality

机译:网络中心性的动态系统视图

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

To gain insights about dynamic networks, the dominant paradigm is to study discrete snapshots, or timeslices, as the interactions evolve. Here, we develop and test a new mathematical framework where network evolution is handled over continuous time, giving an elegant dynamical systems representation for the important concept of node centrality. The resulting system allows us to track the relative influence of each individual. This new setting is natural in many digital applications, offering both conceptual and computational advantages. The novel differential equations approach is convenient for modelling and analysis of network evolution and gives rise to an interesting application of the matrix logarithm function. From a computational perspective, it avoids the awkward up-front compromises between accuracy, efficiency and redundancy required in the prevalent discrete-time setting. Instead, we can rely on state-of-the-art ODE software, where discretization takes place adaptively in response to the prevailing system dynamics. The new centrality system generalizes the widely used Katz measure, and allows us to identify and track, at any resolution, the most influential nodes in terms of broadcasting and receiving information through time-dependent links. In addition to the classical static network notion of attenuation across edges, the new ODE also allows for attenuation over time, as information becomes stale. This allows 'running measures' to be computed, so that networks can be monitored in real time over arbitrarily long intervals. With regard to computational efficiency, we explain why it is cheaper to track good receivers of information than good broadcasters. An important consequence is that the overall broadcast activity in the network can also be monitored efficiently. We use two synthetic examples to validate the relevance of the new measures. We then illustrate the ideas on a large-scale voice call network, where key features are discovered that are not evident from snapshots or aggregates.
机译:为了获得有关动态网络的见解,主要的范例是研究随着交互的发展而离散的快照或时间片。在这里,我们开发并测试了一个新的数学框架,该网络可以在连续时间内处理网络演化,从而为节点中心性的重要概念提供了优雅的动态系统表示形式。由此产生的系统使我们能够追踪每个人的相对影响。这种新设置在许多数字应用程序中都是很自然的,同时提供了概念上和计算上的优势。新颖的微分方程方法方便了网络演化的建模和分析,并引起了矩阵对数函数的有趣应用。从计算的角度来看,它避免了在普遍的离散时间设置中所需的准确性,效率和冗余之间的尴尬的前期折衷。取而代之的是,我们可以依靠最先进的ODE软件,在该软件中,离散化将根据当前的系统动态自适应地进行。新的中心性系统概括了广泛使用的Katz度量,并允许我们以任何分辨率识别和跟踪在与时间相关的链接上广播和接收信息方面最有影响力的节点。除了经典的静态网络跨边缘衰减的概念外,随着信息变得陈旧,新的ODE还允许随时间衰减。这样可以计算“运行措施”,以便可以在任意长的时间间隔内实时监视网络。关于计算效率,我们解释了为什么跟踪好的信息接收者比好的广播者便宜。一个重要的结果是,网络中的总体广播活动也可以得到有效监控。我们使用两个综合示例来验证新措施的相关性。然后,我们在大型语音呼叫网络上说明这些想法,在该网络中发现了从快照或聚合中看不到的关键功能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号