基于商空间分层模型的复杂网络最佳路径搜索法(MOCQ)
首发时间:2007-12-24
摘要:对于复杂网络中求任意两节点的最佳路径问题,本文首先构建了无向加权网络的复杂网络商空间模型,在该模型中针对静态和动态网络提出了复杂网络商空间最佳路径分层法(MOCQ)。该方法大大提高了复杂网络中的路径搜索速度,快速得到网络中任意两节点的最佳路径。对于随机网络、小世界网络和无向无标度网络,本文分别用MOCQ、Dijkstra算法和Floyd算法来获取最佳路径,实验结果表明,复杂网络引入商空间模型使得网络分解为粒度计算的层次结构,简化网络的模型,使得问题复杂性降为O(n)。
关键词: 复杂网络 商空间分层模型 商空间理论 最佳路径 粒度分类
For information in English, please click here
The Method for the Optimal Path of Complex Network Based on Quotient Space Hierarchy Model (MOCQ)
Abstract:To seek the optimal path between two nodes in a complex network, this paper constructs the Quotient Space hierarchy model for the undirected weighted complex network. A method is put forward for the static and dynamic complex network base on this hierarchical model. The searching speed is improved greatly with this novel method. This hierarchical method, Dijkstra and Floyd algorithms are adopted to seek the optimal path for three different networks such as random networks, small-world networks and undirected scale-free networks in experiments. The results indicate that the complex network decomposed into hierarchical structure with the Quotient Space model is simplified greatly and the complexity is reduced to O(n).
Keywords: Complex Network Quotient Space Hierarchy Model Quotient Space Theory the Optimal Path Granular Classification
论文图表:
引用
No.1729717767611984****
同行评议
共计0人参与
勘误表
基于商空间分层模型的复杂网络最佳路径搜索法(MOCQ)
评论
全部评论0/1000