【24h】

Analyzing Disturbed Diffusion on Networks

机译:分析网络上的干扰扩散

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

摘要

This work provides the first detailed investigation of the disturbed diffusion scheme FOS/C introduced in as a type of diffusion distance measure within a graph partitioning framework related to Lloyd's k-means algorithm. After outlining connections to distance measures proposed in machine learning, we show that FOS/C can be related to random walks despite its disturbance. Its convergence properties regarding load distribution and edge flow characterization are examined on two different graph classes, namely torus graphs and distance-transitive graphs (including hypercubes), representatives of which are frequently used as interconnection networks.
机译:这项工作提供了对扰动扩散方案FOS / C的首次详细研究,该扰动扩散方案是在与Lloyd's k-means算法相关的图分区框架内作为一种扩散距离度量引入的。在概述了与机器学习中提出的距离度量的联系之后,我们表明FOS / C可以与随机行走相关联,尽管它会受到干扰。在两个不同的图类(即环面图和距离传递图(包括超立方体))上检查了其关于负载分布和边缘流特征的收敛特性,它们的代表经常用作互连网络。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号