物流保障网络级联失效抗毁性研究
|
摘要
现代战争的演化,尤其是上世纪90年代以后的几场局部战争的形态变化,使得物流保障网络的地位越来越重要,保障的能力、质量己经成为决定战争胜负的关键因素。同时,物流保障网络也是敌对双方在战争中攻防的焦点。因此,物流保障网络的抗毁性研究具有非常重要的理论和实际意义。
物流保障网络的抗毁性不仅由网络的结构决定,而且还与网络中的负载有关。当网络中某个节点发生故障时,它上面的流量将转向其他正常节点,而这些接受多余负载的节点又可能由于负载总和大于其容量而发生新的故障。我们将这种相关失效行为称为“级联失效”,考虑网络中“级联失效”的抗毁性称为“级联失效抗毁性”。本文以复杂网络理论为指导,综合运用图论、统计物理、运筹学、概率论、计算机仿真等学科领域知识,系统深入地研究了物流保障网络级联失效抗毁性的建模、分析及其应用。主要研究工作包括:
1.建立了物流保障网络级联失效抗毁性模型
级联失效的本质是一种基于负载的相关失效,影响级联失效的因素包括:网络结构、负载和级联失效过程。本文通过分析物流保障网络的特点,分别建立了物流保障网络的网络模型、负载模型和级联失效抗毁性模型。从物流保障网络的结构和功能层次上,将其划分为战术保障网络和战略保障网络。用均匀随机网络表示战术保障网络的网络模型,用空间网络表示战略保障网络的网络模型,用逻辑网络表示负载模型。在分析物流保障网络级联失效过程以后,确定了路由机制、节点故障以后负载的重分配原则、网络的失效形式和级联失效抗毁性的度量参数,最后基于这些因素建立了物流保障网络的级联失效抗毁性模型。
2.解析分析了典型容量分布下的战术保障网络的级联失效抗毁性
容量分布是决定战术保障网络级联失效抗毁性最关键的因素,本文应用概率母函数方法和分支过程方法解析分析了三种典型容量分布下的级联失效抗毁性:相同容量、随机容量以及容量与属性相关。研究结果表明,三种典型容量分布下都存在容量参数的临界值,当容量参数小于临界值时,网络出现大规模的级联故障;当容量参数大于临界值时,网络运行良好。最后,计算机仿真实验验证了上述解析结果的正确性。
3.仿真分析了任务约束条件下的战略保障网络的级联失效抗毁性
战略保障网络中,既有民用运输负载,又有军事保障负载。并且,同一时刻不同空间位置上的节点负载不同,不同时刻同一节点的负载也是动态变化的。据此,本文将战略保障网络的任务约束条件划分为任务空间约束和任务时间约束,分别分析了任务空间约束和任务时间约束下的战略保障网络级联失效抗毁性。研究结果表明,不同任务约束参数条件下,战略保障网络级联失效抗毁性差异很大。本文还深入分析了产生这种差异的原因。
4.实现了用于物流保障网络级联失效抗毁性分析的应用软件系统
本文实现了物流保障网络级联失效抗毁性分析软件,该软件作为物流保障网络级联失效抗毁性的平台,可以输入保障网络、编辑保障任务、设置节点的负载和容量。通过该软件,可以运用本文的算法模型来分析各种保障网络实例的级联失效抗毁性。
Due to the evolution of modern battle styles, especially the local warfare after 90’s of last century, logistic support networks become more and more important, and the ability and quality of logistic support become key factors that decide the success of modern battles. At the same time, the logistic support networks are the focus of attack and defense. Consequently, study on invulnerability of logistic support networks is of great theoretical and practical significance.
The invulnerability of logistic support networks is decided by not only network topology, but also network load. When one vertex fails, its loads will be directed to other normal vertices, which will then fail and cause further load redistributions if the new loads exceed their capacities. This dependent failure behavior is called“cascading failure”and the invulnerability considering cascading failure is called“cascading invulnerability”. Guided by complex network theory, this dissertation studies thoroughly and systematically the modeling, analysis, optimization and application of cascading invulnerability of logistic support networks using methods of graph theory, statistical physics, operations research, probability theory and computer simulation. The main results and contributions of this dissertation are as follows.
1) A cascading invulnerability model for logistic support networks is proposed.
The essence of cascading failure is a dependent failure based on load. The factors that effect cascading failure include: topology, load and cascading process. By analyzing the characteristics of logistic support networks, a network model, a load model and a cascading invulnerability model for logistic support networks are proposed respectively. Based on structure and function, logistic support networks are divided into the strategic logistic support networks and the tactical logistic support networks. The strategic logistic support networks are modeled as spatial networks, the tactical logistic support networks modeled as uniform random networks, and the loads are modeled as logistic networks. After analyzing the cascading failure process on logistic support networks, the route strategy, load redistribution rule, failure form and measurement of cascading invulnerability are presented. Finally, a cascading invulnerability model for logistic support networks is proposed.
2) The cascading invulnerability of tactical logistic support networks with typical distributions of capacity is studied analytically.
The distribution of capacity is the most key factor that affects the cascading invulnerability of tactical logistic support networks. The cascading invulnerability with three typical distributions of capacity is studied analytically using the generating function and branching process methods, i.e., uniform capacity, random capacity and property-related capacity. The results show that there is a critical capacity for all three typical distributions of capacity. Above the critical capacity, large scale cascading failures occur; under the critical capacity, large scale cascading failures do not occur. The numerical simulations verify the validity of our analytical results.
3) The cascading invulnerability of strategic logistic support networks with task constraints is studied using the numerical simulation methods.
There are both civil transport loads and military support loads on strategic logistic support networks. Moreover, the vertex loads at different spatial locations are different at the same time, and the load of same vertex at different time is dynamic. Hereby, the task constraints are divided into the task space constraints and the task time constraints. The cascading invulnerability of strategic logistic support networks with the task space constraints and the task time constraints are studied respectively. The results show that the cascading invulnerability of strategic logistic support networks has remarkable difference under different task constraints. The reasons for the difference are revealed thoroughly.
4) A software system for analysis of cascading invulnerability of logistic support networks is implemented.
A software system for analysis of cascading invulnerability of logistic support networks is implemented as a platform, on which the logistic support tasks can be imported and edited; the loads and capacities of vertices can be set. Using the software system, the cascading invulnerability of logistic support networks can be analyzed with our models and methods.
物流保障网络的抗毁性不仅由网络的结构决定,而且还与网络中的负载有关。当网络中某个节点发生故障时,它上面的流量将转向其他正常节点,而这些接受多余负载的节点又可能由于负载总和大于其容量而发生新的故障。我们将这种相关失效行为称为“级联失效”,考虑网络中“级联失效”的抗毁性称为“级联失效抗毁性”。本文以复杂网络理论为指导,综合运用图论、统计物理、运筹学、概率论、计算机仿真等学科领域知识,系统深入地研究了物流保障网络级联失效抗毁性的建模、分析及其应用。主要研究工作包括:
1.建立了物流保障网络级联失效抗毁性模型
级联失效的本质是一种基于负载的相关失效,影响级联失效的因素包括:网络结构、负载和级联失效过程。本文通过分析物流保障网络的特点,分别建立了物流保障网络的网络模型、负载模型和级联失效抗毁性模型。从物流保障网络的结构和功能层次上,将其划分为战术保障网络和战略保障网络。用均匀随机网络表示战术保障网络的网络模型,用空间网络表示战略保障网络的网络模型,用逻辑网络表示负载模型。在分析物流保障网络级联失效过程以后,确定了路由机制、节点故障以后负载的重分配原则、网络的失效形式和级联失效抗毁性的度量参数,最后基于这些因素建立了物流保障网络的级联失效抗毁性模型。
2.解析分析了典型容量分布下的战术保障网络的级联失效抗毁性
容量分布是决定战术保障网络级联失效抗毁性最关键的因素,本文应用概率母函数方法和分支过程方法解析分析了三种典型容量分布下的级联失效抗毁性:相同容量、随机容量以及容量与属性相关。研究结果表明,三种典型容量分布下都存在容量参数的临界值,当容量参数小于临界值时,网络出现大规模的级联故障;当容量参数大于临界值时,网络运行良好。最后,计算机仿真实验验证了上述解析结果的正确性。
3.仿真分析了任务约束条件下的战略保障网络的级联失效抗毁性
战略保障网络中,既有民用运输负载,又有军事保障负载。并且,同一时刻不同空间位置上的节点负载不同,不同时刻同一节点的负载也是动态变化的。据此,本文将战略保障网络的任务约束条件划分为任务空间约束和任务时间约束,分别分析了任务空间约束和任务时间约束下的战略保障网络级联失效抗毁性。研究结果表明,不同任务约束参数条件下,战略保障网络级联失效抗毁性差异很大。本文还深入分析了产生这种差异的原因。
4.实现了用于物流保障网络级联失效抗毁性分析的应用软件系统
本文实现了物流保障网络级联失效抗毁性分析软件,该软件作为物流保障网络级联失效抗毁性的平台,可以输入保障网络、编辑保障任务、设置节点的负载和容量。通过该软件,可以运用本文的算法模型来分析各种保障网络实例的级联失效抗毁性。
Due to the evolution of modern battle styles, especially the local warfare after 90’s of last century, logistic support networks become more and more important, and the ability and quality of logistic support become key factors that decide the success of modern battles. At the same time, the logistic support networks are the focus of attack and defense. Consequently, study on invulnerability of logistic support networks is of great theoretical and practical significance.
The invulnerability of logistic support networks is decided by not only network topology, but also network load. When one vertex fails, its loads will be directed to other normal vertices, which will then fail and cause further load redistributions if the new loads exceed their capacities. This dependent failure behavior is called“cascading failure”and the invulnerability considering cascading failure is called“cascading invulnerability”. Guided by complex network theory, this dissertation studies thoroughly and systematically the modeling, analysis, optimization and application of cascading invulnerability of logistic support networks using methods of graph theory, statistical physics, operations research, probability theory and computer simulation. The main results and contributions of this dissertation are as follows.
1) A cascading invulnerability model for logistic support networks is proposed.
The essence of cascading failure is a dependent failure based on load. The factors that effect cascading failure include: topology, load and cascading process. By analyzing the characteristics of logistic support networks, a network model, a load model and a cascading invulnerability model for logistic support networks are proposed respectively. Based on structure and function, logistic support networks are divided into the strategic logistic support networks and the tactical logistic support networks. The strategic logistic support networks are modeled as spatial networks, the tactical logistic support networks modeled as uniform random networks, and the loads are modeled as logistic networks. After analyzing the cascading failure process on logistic support networks, the route strategy, load redistribution rule, failure form and measurement of cascading invulnerability are presented. Finally, a cascading invulnerability model for logistic support networks is proposed.
2) The cascading invulnerability of tactical logistic support networks with typical distributions of capacity is studied analytically.
The distribution of capacity is the most key factor that affects the cascading invulnerability of tactical logistic support networks. The cascading invulnerability with three typical distributions of capacity is studied analytically using the generating function and branching process methods, i.e., uniform capacity, random capacity and property-related capacity. The results show that there is a critical capacity for all three typical distributions of capacity. Above the critical capacity, large scale cascading failures occur; under the critical capacity, large scale cascading failures do not occur. The numerical simulations verify the validity of our analytical results.
3) The cascading invulnerability of strategic logistic support networks with task constraints is studied using the numerical simulation methods.
There are both civil transport loads and military support loads on strategic logistic support networks. Moreover, the vertex loads at different spatial locations are different at the same time, and the load of same vertex at different time is dynamic. Hereby, the task constraints are divided into the task space constraints and the task time constraints. The cascading invulnerability of strategic logistic support networks with the task space constraints and the task time constraints are studied respectively. The results show that the cascading invulnerability of strategic logistic support networks has remarkable difference under different task constraints. The reasons for the difference are revealed thoroughly.
4) A software system for analysis of cascading invulnerability of logistic support networks is implemented.
A software system for analysis of cascading invulnerability of logistic support networks is implemented as a platform, on which the logistic support tasks can be imported and edited; the loads and capacities of vertices can be set. Using the software system, the cascading invulnerability of logistic support networks can be analyzed with our models and methods.
引文
[1]王平均.战术后勤学[M].北京:解放军出版社, 2000
[2]姚海法,孙军强.美军后勤运输[M].北京:中国人民解放军总后勤部军事交通运输部, 1998
[3]石垒.高技术局部战争装备保障[M].北京:国防大学出版社, 2001
[4]郭梅初.高技术局部战争[M].北京:军事科学出版社, 2003
[5]王学义,孙德宝.部队装备保障能力评价研究[J].军械工程学院学报, 2002, 14 (1): 42-46
[6]杜莽.试析网络化后勤保障[J].军事经济研究, 2000, (1): 55-58
[7]周晓宇,彭希文,安卫平.联合作战新论[M].北京:国防大学出版社, 2000
[8]徐宗昌.保障性工程[M].北京:兵器工业出版社, 2002
[9]曹海军,叶红兵,徐宗昌.军用装备维修中的可视化信息保障系统[J].系统仿真学报, 2001, 13 (S1): 371-373
[10]汤德品,罗嵩龄.公共交通运输网络模型研究[J].系统工程理论与实践, 1997, 17 (9): 124-127
[11]杨为民.可靠性.维修性.保障性总论[M].北京:国防工业出版社, 1995
[12] Baker S F, Morton D P, Rosenthal R E, et al. Optimizing strategic airlift [R]. Monterey: Naval Postgraduate School 1999
[13] Lee D K. Optimal Routing of Military Convoys through a Road Network [D]. Monterey: NAVAL POSTGRADUATE SCHOOL, 1991
[14] Sanso B, Soumis F. Communication and transportation network reliability using routingmodels [J]. Reliability, IEEE Transactions on, 1991, 40 (1): 29-38
[15] Erkut E, Ingolfsson A. Catastrophe Avoidance Models for Hazardous Materials Route Planning [J]. Transportation Science, 2000, 34 (2): 165-179
[16]汤德品,罗嵩龄.国防交通网络节点与链路的可靠性分析[J].交通与计算机, 1998, 16 (5): 38-40
[17]王宗喜.论军地物流联合发展[J].物流科技, 2001, 24 (3): 3-7
[18]方爱华.新时期国防交通保障方案编制方法刍议[J].南京经济学院学报, 1997, (3): 70-71
[19]刘建尧,韩京才,李向东.多参数带约束限制的风险运输网络优化研究[J].军械工程学院学报, 2002, 14 (1): 55-58
[20]马卫民,徐青川.局内军车调度的时间优化及其竞争策略[J].系统工程学报, 2002, 17 (5): 395-400
[21]徐军,罗嵩龄.公路网连通性研究[J].中国公路学报, 2000, 13 (1): 95-97
[22]万绪军,互安洲.用边标号法解决交通网络连通性问题[J].中国公路学报, 1999, 12 (4): 73-77
[23] Corley H W, Sha D Y. Most vital links and nodes in weighted networks [J]. Oper. Res. Lett., 1982, 1 (4): 157-160
[24] Malik K, Mittal A K, KGupta S. The k most vital arcs in the shortest path problem [J]. Oper. Res. Lett., 1989, 8 (8): 223-227
[25] Nardelli E, Proietti G, Widmayer P. Finding the detour-critical edge of a shortest path between two nodes [J]. Info. Proc. Letters, 1998, 67 (1): 51-54
[26]陈光亭.无向网络中最短路的最关键边问题[J].杭州电子工业学院学报, 2002, 22 (1): 48-50
[27] Goh K I, Lee D S, Kahng B, et al. Sandpile on Scale-Free Networks [J]. Physical Review Letters, 2003, 91 (14): 8701-8704
[28] Lubore S H, Ratliff H D, Sicillia G T. Determing the most vital link in a flow network [J]. Naval research logistics quarterly, 1971, 18 (4): 711-713
[29] Ratliff H D, Lubore S H, Sicillia G T. Finding the n most vital links in a flow network [J]. Management Science, 1975, 21 (5): 531-539
[30] Hsu L H, Jan R H, Lee Y C. Finding the most vital edge with respect to minimum spanning tree in weighted graphs [J]. Info. Proc. Letters, 1991, 39 (5): 277-281
[31] Shen H. Finding the k most vital edges with respect to minimum spanning tree [J]. Acta information, 1999, 36 (5): 405-424
[32] Lin K C, Chern M S. The most vital edges in the minimum spanning tree problem [J]. Information proceeding letters, 1993, 45(2):25-31
[33] Liang W F. Finding the k most vital edges with respect to minimum spanning trees for fixed k. [J]. Diecrete applied mathematics, 2001, 113 (2): 319-327
[34]卢开澄.图论及其应用[M].北京:清华大学出版社, 1981
[35]谢政,李建平.网络算法与复杂性理论[M].长沙:国防科技大学, 1995
[36] Bollobás B, Riordan O, Spencer J, et al. The degree sequence of a scale-free random graph process [J]. Random Structures and Algorithms, 2001, 18 (3): 279-290
[37]张风林.物流保障网络可用性技术研究[D].国防科技大学, 2003
[38]李会山,郑炳良,王亮,等.车辆器材保障能力的综合评价[J].天津工业大学学报, 2001, 20 (1): 31-33
[39]武昌,赵海波.空军通信导航装备维修保障系统效能评估初探[J].全军武器装备维修保障技术研讨会论文集, 2002, 10 299-304
[40]黄永平,奚丽波,关宏英.物资保障能力指标体系设计[J].军事运筹与系统工程, 2005, 19 (1): 67-70
[41]奚丽波,黄永平,孟凡芹,等.基于指标体系的军队物资保障能力评价[J].物流技术, 2004, 1 (11): 129-131
[42]王炜,邓卫,杨琪.公路网络规划建设与管理方法[M].北京:科学出版社, 2001
[43] Moitra S D, Oki E, Yamanaka N. Some new survivability measures for network analysis and design [J]. IEICE Transactions on Communications, 1997, E80-B (4): 625-631
[44] Ludema M. Domain knowledge navigating; course ware for a Masters in Transport & Infrastructure. Proceedings of World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education [C]. Chesapeake: AACE, 2005
[45]王海超,解国仁.城市公路网络震害预测方法探讨[J].东北重型机械学院学报, 1997, 21 (002): 167-171
[46]王海超,解国仁,党淑华.城市公路网络的连通可靠性分析[J].河北建筑科技学院学报, 1997, 14 (3): 17-21
[47]方志耕,龚正,黄西林.公路军事交通运输勤务综合演习项目GERT网络模型研究与分析[J].系统工程理论与实践, 2000, 20 (4): 133-136
[48]陈建林,陈蓓.战区军事交通运输网络保障能力评价研究[J].铁道运输与经济, 2005, 27 (5): 79-80
[49]海军,程万里.战时(突发事件)条件下铁路通过能力研究[J].铁道学报, 2003, 25 (4): 10-13
[50]海军.战时铁路网络生存性定量评价研究[J].铁道学报, 2005, 27 (4): 110-113
[51]海军,陈斌.战场公路网道路重要度定量评价初探[J].国防交通工程与技术, 2007, 5 (2): 40-42
[52] Albert R, Jeong H, Barabási A L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406 (6794): 378-382
[53] Broder A, Kumar R, Maghoul F, et al. Graph structure in the Web [J]. Comput. Netw., 2000, 33 (1): 309-320
[54] Jeong H, Mason S, Barabási A L, et al. Lethality and centrality in protein networks [J]. Nature, 2001, 411 (6833): 41-42
[55] Dunne J A, Williams R J, Martinez N D. Network structure and biodiversity loss in food webs:Robustness increases with connectance [J]. Ecology Letters, 2002, 5 (4): 558-567
[56] Newman M E J, Forrest S, Balthrop J. Email networks and the spread ofcomputer viruses [J]. Phys. Rev. E, 2002, 66 (3): 035101
[57] Magoni D. Tearing down the Internet [J]. IEEE J. Sel. Areas Commun., 2003, 21 (6): 949-960
[58] Samant K, Bhattacharyya S. Topology, search, and fault tolerance in unstructured P2P networks. Proceedings of the Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Press, 2004
[59] Holme P, Kim B J, Yoon C N, et al. Attack vulnerability of complex networks [J]. Physical Review E, 2002, 65 (5):
[60] Freeman L C. A set of measures of centrality based upon betweenness [J]. Sociometry, 1977, 40 (1): 35-41
[61] Cohen R, Erez K, ben-Avraham D, et al. Resilience of the Internet to random breakdowns [J]. Phys. Rev. Lett., 2000, 85 (21): 4626-4628
[62] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Phys. Rev. E, 2001, 64 (2): 26118
[63] Broadbent S R, Hammersley J M. Percolation processes: I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society [C]. Cambridge: CAMBRIDGE UNIV. PRESS 1957
[64] Hammersley J M. Percolation processes: II. The connective constant [J]. Proc. Cambridge Philos. Soc., 1957, 53 642-645
[65] Callaway D S, Newman M E J, Strogatz S H, et al. Network Robustness and Fragility: Percolation on Random Graphs [J]. Physical Review Letters, 2000, 85 (25): 5468-5471
[66] Gallos L K, Cohen R, Argyrakis P, et al. Stability and Topology of Scale-Free Networks under Attack and Defense Strategies [J]. Physical Review Letters, 2005, 94 (18): 188701
[67] Albert R, Barabási A-L. Statistical mechanics of complex networks [J]. Rev. Mod. Phys., 2002, 74 (1): 47-51
[68] Dobson I, Carreras B A, Newman D E. A Probabilistic Loading-dependent Model of Cascading Failure [J]. Probability in the Engineering and Informational Sciences, 2005, 19 (1): 15-32
[69] Dobson I, Carreras B A, Newman D E. A probabilistic loading-dependent model of cascading failure and possible implications for blackouts. Proceedings of the 36th Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Computer Society, 2003
[70] Dobson I, Carreras B A, Newman D E. Branching process models for the exponentially increasing portions of cascading failure blackouts. Thirty-eighth Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Computer Society, 2005
[71] Dobson I, Carreras B A, Enewman D. A branching process approximation tocascading load-dependent system failure. Proceedings of the 37th Annual Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Computer Society, 2004
[72] Carreras B A, Lynch V E, Dobson I, et al. Critical points and transitions in an electric power transmission model for cascading failure blackouts [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2002, 12 (4): 985
[73] Carreras B A, Lynch V E, Dobson I, et al. Complex dynamics of blackouts in power transmission systems [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2004, 14 (3): 643
[74] Asavathiratham C. The Influence Model: A Tractable Representation for the Dynamics of Networked Markov Chains [D]. Massachusetts Institute of Technology, 2000
[75] Watts D J. A simple model of global cascades on random networks [J]. Proc. Natl. Acad. Sci. U.S.A, 2002, 99 (9): 5766-5771
[76] Bak P, Tang C, Wiesenfeld K. Self-organized criticality: An explanation of the 1/f noise [J]. Physical Review Letters, 1987, 59 (4): 381-384
[77] Bak P, Tang C, Wiesenfeld K. Self-organized criticality [J]. Physical Review A, 1988, 38 (1): 364-374
[78] Bak P, Bak P. How nature works: the science of self-organized criticality [M]. Copernicus, 1996
[79] Bonabeau E. Sandpile Dynamics on Random Graphs [J]. JOURNAL-PHYSICAL SOCIETY OF JAPAN, 1995, 64 (1): 327-327
[80] Lise S, Paczuski M. Nonconservative Earthquake Model of Self-Organized Criticality on a Random Graph [J]. Physical Review Letters, 2002, 88 (22): 228301
[81] Goh K I, Lee D S, Kahng B, et al. Cascading toppling dynamics on scale-free networks [J]. Physica A, 2005, 346 (1-2): 93-103
[82] Lee D S, Goh K I, Kahng B, et al. Sandpile avalanche dynamics on scale-free networks [J]. Physica A: Statistical Mechanics and its Applications, 2004, 338 (1-2): 84-91
[83] Kaneko K. Overview of coupled map lattices [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 1992, 2 (3): 279
[84] Gade P M, Hu C K. Synchronous chaos in coupled map lattices with small-world interactions [J]. PHYSICAL REVIEW E, 2000, 62 (5): 6409-6413
[85] Wang X F, Xu J. Cascading failures in coupled map lattices [J]. Phys. Rev. E, 2004, 70 (5): 056113
[86] Xu J, Wang X F. Cascading failures in scale-free coupled map lattices [J]. Physica A: Statistical Mechanics and its Applications, 2005, 349 (3-4): 685-692
[87] Goh K I, Kahng B, Kim D. Universal Behavior of Load Distribution inScale-Free Networks [J]. Physical Review Letters, 2001, 87 (27): 278701
[88] Moreno Y, Gómez J B, Pacheco A F. Instability of scale-free networks under node-breaking avalanches [J]. Europhys. Lett., 2002, 58 (4): 630-636
[89] Moreno Y, Gómez J B, Pacheco A F. Fracture and Second-Order Phase Transitions [J]. Physical Review Letters, 2000, 85 (14): 2865-2868
[90] Moreno Y, Pastor-Satorras R, Vázquez A, et al. Critical load and congestion instabilities in scale-free networks [J]. Europhys. Lett., 2003, 62 (2): 292-298
[91] Motter A E, Lai Y C. Cascade-based attacks on complex networks [J]. Phys. Rev. E, 2002, 66 (6): 065102
[92] Barthélemy M. Comment on“Universal Behavior of Load Distribution in Scale-Free Networks”[J]. Physical Review Letters, 2003, 91 (18): 189803
[93] Motter A E. Cascade Control and Defense in Complex Networks [J]. Phys. Rev. Lett., 2004, 93 (9): 098701
[94] Crucitti P, Latora V, Marchiori M. Model for cascading failures in complex networks [J]. Phys. Rev. E, 2004, 69 (4): 045104
[95] Kinney R, Crucitti P, Albert R, et al. Modeling cascading failures in the North American power grid [J]. Eur. Phys. J. B, 2005, 46 (1): 101-107
[96] Holme P, Kim B J. Vertex overload breakdown in evolving networks [J]. Phys. Rev. E, 2002, 65 (6): 066109
[97] Holme P. Edge overload breakdown in evolving networks [J]. Phys. Rev. E., 2002, 66 (3): 036119
[98] Mantegna R N, Stanley H E. An introduction to econophysics: correlations and complexity in finance [M]. Cambridge University Press New York, NY, USA, 1999
[99] Moreno Y, Vazquez A. The Bak-Sneppen model on scale-free networks [J]. Europhysics Letters, 2002, 57 (5): 765-771
[100] Erd?s P, Rényi A. On the evolution of random graphs [J]. Publ. Math. Inst. Hung. Acad. Sci., 1960, 5 17-60
[101] Erd?s P, Rényi A. On random graphs [J]. Publ. Math., 1959, 6 290-297
[102] Bollobas B. Degree Sequences of Random Graphs [J]. Discrete Mathematics, 1981, 33 (1): 1-19
[103] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Physical Review E, 2001, 64 (2):
[104] Chung F, Lu L Y, Vu V. Spectra of random graphs with given expected degrees [J]. Proceedings of the National Academy of Sciences of the United States of America, 2003, 100 (11): 6313-6318
[105] Chung F, Lu L Y. The average distances in random graphs with given expected degrees [J]. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99 (25): 15879-15882
[106] Chung F, Lu L. Connected components in random graphs with given degree sequences [J]. Annals of Combinatorics, 2002, 6(2):125-145
[107] Watts D J. Small Worlds: The Dynamics of Networks between Order and Randomness [M]. New Jersey: Princeton University Press, 1999
[108] Watts D J, Strogatz S H. Collective dynamics of 'small-world' networks [J]. Nature, 1998, 393 (6684): 440-442
[109] Newman M E J, Moore C, Watts D J. Mean-field solution of the small-world network model [J]. Physical Review Letters, 2000, 84 (14): 3201-3204
[110] Newman M E J. Models of the small world [J]. Journal of Statistical Physics, 2000, 101 (3-4): 819-841
[111] Newman M E J, Watts D J. Scaling and percolation in the small-world network model [J]. Phys. Rev. E, 1999, 60 (6): 7332-7342
[112] Kasturirangan R. Multiple Scales in Small-World Graphs [J]. cond-mat/9904055, 1999,
[113] Dorogovtsev S N, Mendes J F F, Samukhin A N. Structure of growing networks with preferential linking [J]. Phys. Rev. Lett., 2000, 85 (21): 4633-4636
[114] Kleinberg J M. Navigation in a small world [J]. Nature, 2000, 406 845
[115] Barabási A L, Albert R. Emergence of scaling in random networks [J]. Science, 1999, 286 (5439): 509-512
[116] Krapivsky P L, Redner S, Leyvraz F. Connectivity of growing random networks [J]. Phys. Rev. Lett., 2000, 85 (21): 4629-4632
[117] Dorogovtsev S N, Mendes J F F. Effect of the accelerating growth of communications networks on their structure [J]. Phys. Rev. E, 2001, 63(2): 025101
[118] Bianconi G, Barabási A-L. Competition and multiscaling in evolving networks [J]. Europhys. Lett., 2001, 54 (4): 436-442
[119] Liu Z H, Lai Y-C, Ye N. Statistical properties and attack tolerance of growing networks with algebraic preferential attachment [J]. Phys. Rev. E, 2002, 66 (3): 036112
[120] Kleinberg J M, Kumar S R, Raghavan P, et al. The Web as a graph: measurements, models and methods. Proceedings of the International Conference on Combinatorics and Computing [C]. Berlin: Springer, 1999
[121] Chung F, Lu L Y, Dewey T G, et al. Duplication models for biological networks [J]. Journal of Computational Biology, 2003, 10 (5): 677-687
[122] Krapivsky P L, Redner S. Organization of growing random networks [J]. Phys. Rev. E, 2001, 63 (6): 066123
[123] Zhang H, Liu Z, Tang M, et al. An adaptive routing strategy for packet delivery in complex networks [J]. Physics Letters A, 2007, 364 (3-4): 177-182
[124] Xuan Q, Li Y J, Wu T J. A local-world network model based on inter-nodecorrelation degree [J]. Physica A, 2007, 378 (2): 561-572
[125] Chowdhury A, Frieder O, Wan P-J. On the design, development, deployment, and network survivability analysis of the dynamic routing system protocol [J]. Journal of Supercomputing, 2002, 21 (3): 239-256
[126] Gallos L K, Argyrakis P, Bunde A, et al. Tolerance of scale-free networks: from friendly to intentional attack strategies [J]. Physica A, 2004, 344(3):504-509
[127] Li X, Chen G R. A local-world evolving network model [J]. Physica a-Statistical Mechanics and Its Applications, 2003, 328 (1-2): 274-286
[128] Zhang Z Z, Rong L L, Comellas F. High-dimensional random Apollonian networks [J]. Physica a-Statistical Mechanics and Its Applications, 2006, 364 610-618
[129] Zhang Z Z, Rong L L, Guo C H. A deterministic small-world network created by edge iterations [J]. Physica A, 2006, 363 (2): 567-572
[130] Zhang Z Z, Rong L L, Comellas F. Evolving small-world networks with geographical attachment preference [J]. Journal of Physics A, 2006, 39 (13): 3253-3261
[131] Zhang Z Z, Comellas F, Fertin G, et al. High-dimensional Apollonian networks [J]. Journal of Physics A, 2006, 39 (8): 1811-1818
[132] Qunjiao Zhang, Junan Lu, Jinhu Lü. Adaptive Feedback Synchronization of a General Complex Dynamical Network With Delayed Nodes [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—II: EXPRESS BRIEFS, 2008, 55 (2): 183-187
[133] Zhang Z Z, Rong L L, Zhou S G. Evolving Apollonian networks with small-world scale-free topologies [J]. Physical Review E, 2006, 74 (4): 046105
[134] Li M H, Wang D H, Fan Y, et al. Modelling weighted networks using connection count [J]. New Journal of Physics, 2006, 8 (5): 72
[135] Li M H, Wu J S, Wang D H, et al. Evolving model of weighted networks inspired by scientific collaboration networks [J]. Physica A, 2007, 375 (1): 355-364
[136] Wang W X, Wang B H, Hu B, et al. General dynamics of topology and traffic on weighted technological networks [J]. Physical Review Letters, 2005, 94 (18): 188702
[137]方锦清,汪小帆,刘曾荣.略论复杂性问题和非线性复杂网络系统的研究[J].科技导报, 2004, (2): 9-12,64
[138] Boccaletti S, Latora V, Moreno Y, et al. Complex networks: Structure and dynamics [J]. Physics Reports, 2006, 424 (4-5): 175-308
[139] Bornholdt S, Schuster H G. Handbook of Graphs and Networks: From the Genome to the Internet [M]. Berlin: Wiley-VCH Weinheim, 2003
[140] De Montis A, Barthelemy M, Chessa A, et al. The structure of Inter-Urban traffic: A weighted network analysis [J]. Environment and Planning B: Planning and Design, 2005, 34 (5): 905-924
[141] Jiang B, Claramunt C. Topological analysis of urban street networks [J]. Environment and Planning B: Planning and Design, 2004, 31 (1): 151-162
[142] Kurant M, Thiran P. Extraction and analysis of traffic and topologies of transportation networks [J]. PHYSICAL REVIEW E, 2006, 74 (3): 36114
[143] Sienkiewicz J. Statistical analysis of 22 public transport networks in Poland [J]. PHYSICAL REVIEW E, 2005, 72 (4): 46127
[144] Watts D J. Small Worlds:The Dynamics of Networks between Order and Randomness [M]. princeton: princeton university press, 1999
[145] Csanyi G, Szendroi B. Fractal-small-world dichotomy in real-world networks [J]. PHYSICAL REVIEW E, 2004, 70 (1): 016122
[146] Ravasz E, Barabasi A L. Hierarchical organization in complex networks [J]. PHYSICAL REVIEW E, 2003, 67 (2): 26112
[147] Sch?fer M, Scholz J, Greiner M. Proactive Robustness Control of Heterogeneously Loaded Networks [J]. Phys. Rev. Lett., 2006, 96 (10): 108701
[148] Latora V, Marchiori M. Is the Boston subway a small-world network? [J]. Physica A, 2002, 314 (1-4): 109-113
[149] Sen P, Dasgupta S, Chatterjee A, et al. Small-world properties of the Indian railway network [J]. PHYSICAL REVIEW E Phys Rev E, 2003, 67 (3): 036106
[150] Li K, Gao Z, Mao B. A WEIGHTED NETWORK MODEL FOR RAILWAY TRAFFIC [J]. International Journal of Modern Physics C, 2006, 17 (09): 1339-1347
[151] Li W, Cai X. Empirical analysis of a scale-free railway network in China [J]. Physica A: Statistical Mechanics and its Applications, 2007, 382 (2): 693-703
[152] Barthelemy M. Betweenness centrality in large complex networks [J]. Euro. Phys. J. B, 2004, 38 (2): 163-168
[153]郭波,武小悦.系统可靠性分析[M].长沙:国防科技大学出版社, 2003
[154]李翠玲,谢里阳.相关失效分析方法评述与探讨[J].机械设计与制造, 2003, (3): 1-3
[155]熊蔚明,刘有恒.关于通信网可靠性的研究进展[J].通信学报, 1990, 11 (4): 43-49
[156]陈勇,胡爱群,胡骏,等.通信网中最重要节点的确定方法[J].高技术通讯, 2004, 14 (1): 21-24
[157] Jung W S, Wang F, Stanley H E. Gravity model in the Korean highway [J]. EPL-Europhysics Letters, 2008, 81 (4): 48005
[158] Bagler G. Analysis of the Airport Network of India as a complex weightednetwork [J]. Physica A: Statistical Mechanics and its Applications, 2008, 387 (12): 2972-2980
[159] Albert R, Jeong H, Barabási A-L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406 (6794): 378-382
[160] Lee W H, Michels K M, Bondy C A. Localization of Insulin-Like Growth-Factor Binding Protein-2 Messenger-Rna During Postnatal Brain-Development - Correlation with Insulin-Like Growth Factor-I and Factor-Ii [J]. Neuroscience, 1993, 53 (1): 251-265
[161] Brouwer A E. Toughness and Spectrum of a Graph [J]. Linear Algebra and Its Applications, 1995, 226(1):267-271
[162] Choudum S A, Priya N. Tough-maximum graphs [J]. Ars Combinatoria, 2001, 61(1):167-172
[163]毛俊超,冯立华,沈秀专.图的坚韧度与图的Laplaeian特征值的关系[J].吉首大学学报:自然科学版, 2007, 28 (2): 28-29
[164]许进.论图的坚韧度(Ⅰ)——基本理论[J].电子学报, 1996, 24 (001): 23-27
[165] Barefoot C A, Entringer R, Swart H. Vulnerability in graphs - a comparative survey [J]. J. Combin. Math. Combin. Comput., 1987, 30(1):13-22
[166] Cozzen M, Moazzami D, Stueckle S. The tenacity of a graph. Seventh International Conference on the Theory and Applications of Graphs [C]. New York: Wiley, 1995
[167]欧阳克智,欧阳克毅,于文池.图的相对断裂度[J].兰州大学学报, 1993, 29 (3): 43-49
[168] Bassalygo L A, Pinsker M S. The complexity of an optimal non-blocking commutation scheme without reorganization [J]. Problemy Peredaci Informacii, 1973, 9 (1): 84-87
[169] Fiedler M. Algebraic Connectivity of Graphs [J]. Czechoslovak Mathematical Journal, 1973, 23 (2): 298-305
[170] Albert R, Jeong H, Barabási A-L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406 378-382
[171] Molloy M, Reed B. The size of the giant component of a random graph with a given degree sequence [J]. Combinatorics Probab. Comput., 1998, 7(03): 295-305
[172] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Phys. Rev. E, 2001, 64 (2): 026118
[173] Karlin S, M.Taylor H.随机过程教程(第二版) [M].北京:人民邮电出版社, 2007
[174] Dobson I, Carreras B A, Newman D E. Probabilistic load-dependent cascadingfailure with limited component interactions. Proceedings of IEEE International Symposium on Circuits and Systems [C]. Vancouver, BC, Canada: IEEE 2004
[175] Dobson I, Carreras B A, Lynch V E, et al. Complex systems analysis of series of blackouts: Cascading failure, critical points, and self-organization [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2007, 17 (2): 026103
[176] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. PHYSICAL REVIEW E, 2001, 64 (2): 26118
[2]姚海法,孙军强.美军后勤运输[M].北京:中国人民解放军总后勤部军事交通运输部, 1998
[3]石垒.高技术局部战争装备保障[M].北京:国防大学出版社, 2001
[4]郭梅初.高技术局部战争[M].北京:军事科学出版社, 2003
[5]王学义,孙德宝.部队装备保障能力评价研究[J].军械工程学院学报, 2002, 14 (1): 42-46
[6]杜莽.试析网络化后勤保障[J].军事经济研究, 2000, (1): 55-58
[7]周晓宇,彭希文,安卫平.联合作战新论[M].北京:国防大学出版社, 2000
[8]徐宗昌.保障性工程[M].北京:兵器工业出版社, 2002
[9]曹海军,叶红兵,徐宗昌.军用装备维修中的可视化信息保障系统[J].系统仿真学报, 2001, 13 (S1): 371-373
[10]汤德品,罗嵩龄.公共交通运输网络模型研究[J].系统工程理论与实践, 1997, 17 (9): 124-127
[11]杨为民.可靠性.维修性.保障性总论[M].北京:国防工业出版社, 1995
[12] Baker S F, Morton D P, Rosenthal R E, et al. Optimizing strategic airlift [R]. Monterey: Naval Postgraduate School 1999
[13] Lee D K. Optimal Routing of Military Convoys through a Road Network [D]. Monterey: NAVAL POSTGRADUATE SCHOOL, 1991
[14] Sanso B, Soumis F. Communication and transportation network reliability using routingmodels [J]. Reliability, IEEE Transactions on, 1991, 40 (1): 29-38
[15] Erkut E, Ingolfsson A. Catastrophe Avoidance Models for Hazardous Materials Route Planning [J]. Transportation Science, 2000, 34 (2): 165-179
[16]汤德品,罗嵩龄.国防交通网络节点与链路的可靠性分析[J].交通与计算机, 1998, 16 (5): 38-40
[17]王宗喜.论军地物流联合发展[J].物流科技, 2001, 24 (3): 3-7
[18]方爱华.新时期国防交通保障方案编制方法刍议[J].南京经济学院学报, 1997, (3): 70-71
[19]刘建尧,韩京才,李向东.多参数带约束限制的风险运输网络优化研究[J].军械工程学院学报, 2002, 14 (1): 55-58
[20]马卫民,徐青川.局内军车调度的时间优化及其竞争策略[J].系统工程学报, 2002, 17 (5): 395-400
[21]徐军,罗嵩龄.公路网连通性研究[J].中国公路学报, 2000, 13 (1): 95-97
[22]万绪军,互安洲.用边标号法解决交通网络连通性问题[J].中国公路学报, 1999, 12 (4): 73-77
[23] Corley H W, Sha D Y. Most vital links and nodes in weighted networks [J]. Oper. Res. Lett., 1982, 1 (4): 157-160
[24] Malik K, Mittal A K, KGupta S. The k most vital arcs in the shortest path problem [J]. Oper. Res. Lett., 1989, 8 (8): 223-227
[25] Nardelli E, Proietti G, Widmayer P. Finding the detour-critical edge of a shortest path between two nodes [J]. Info. Proc. Letters, 1998, 67 (1): 51-54
[26]陈光亭.无向网络中最短路的最关键边问题[J].杭州电子工业学院学报, 2002, 22 (1): 48-50
[27] Goh K I, Lee D S, Kahng B, et al. Sandpile on Scale-Free Networks [J]. Physical Review Letters, 2003, 91 (14): 8701-8704
[28] Lubore S H, Ratliff H D, Sicillia G T. Determing the most vital link in a flow network [J]. Naval research logistics quarterly, 1971, 18 (4): 711-713
[29] Ratliff H D, Lubore S H, Sicillia G T. Finding the n most vital links in a flow network [J]. Management Science, 1975, 21 (5): 531-539
[30] Hsu L H, Jan R H, Lee Y C. Finding the most vital edge with respect to minimum spanning tree in weighted graphs [J]. Info. Proc. Letters, 1991, 39 (5): 277-281
[31] Shen H. Finding the k most vital edges with respect to minimum spanning tree [J]. Acta information, 1999, 36 (5): 405-424
[32] Lin K C, Chern M S. The most vital edges in the minimum spanning tree problem [J]. Information proceeding letters, 1993, 45(2):25-31
[33] Liang W F. Finding the k most vital edges with respect to minimum spanning trees for fixed k. [J]. Diecrete applied mathematics, 2001, 113 (2): 319-327
[34]卢开澄.图论及其应用[M].北京:清华大学出版社, 1981
[35]谢政,李建平.网络算法与复杂性理论[M].长沙:国防科技大学, 1995
[36] Bollobás B, Riordan O, Spencer J, et al. The degree sequence of a scale-free random graph process [J]. Random Structures and Algorithms, 2001, 18 (3): 279-290
[37]张风林.物流保障网络可用性技术研究[D].国防科技大学, 2003
[38]李会山,郑炳良,王亮,等.车辆器材保障能力的综合评价[J].天津工业大学学报, 2001, 20 (1): 31-33
[39]武昌,赵海波.空军通信导航装备维修保障系统效能评估初探[J].全军武器装备维修保障技术研讨会论文集, 2002, 10 299-304
[40]黄永平,奚丽波,关宏英.物资保障能力指标体系设计[J].军事运筹与系统工程, 2005, 19 (1): 67-70
[41]奚丽波,黄永平,孟凡芹,等.基于指标体系的军队物资保障能力评价[J].物流技术, 2004, 1 (11): 129-131
[42]王炜,邓卫,杨琪.公路网络规划建设与管理方法[M].北京:科学出版社, 2001
[43] Moitra S D, Oki E, Yamanaka N. Some new survivability measures for network analysis and design [J]. IEICE Transactions on Communications, 1997, E80-B (4): 625-631
[44] Ludema M. Domain knowledge navigating; course ware for a Masters in Transport & Infrastructure. Proceedings of World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education [C]. Chesapeake: AACE, 2005
[45]王海超,解国仁.城市公路网络震害预测方法探讨[J].东北重型机械学院学报, 1997, 21 (002): 167-171
[46]王海超,解国仁,党淑华.城市公路网络的连通可靠性分析[J].河北建筑科技学院学报, 1997, 14 (3): 17-21
[47]方志耕,龚正,黄西林.公路军事交通运输勤务综合演习项目GERT网络模型研究与分析[J].系统工程理论与实践, 2000, 20 (4): 133-136
[48]陈建林,陈蓓.战区军事交通运输网络保障能力评价研究[J].铁道运输与经济, 2005, 27 (5): 79-80
[49]海军,程万里.战时(突发事件)条件下铁路通过能力研究[J].铁道学报, 2003, 25 (4): 10-13
[50]海军.战时铁路网络生存性定量评价研究[J].铁道学报, 2005, 27 (4): 110-113
[51]海军,陈斌.战场公路网道路重要度定量评价初探[J].国防交通工程与技术, 2007, 5 (2): 40-42
[52] Albert R, Jeong H, Barabási A L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406 (6794): 378-382
[53] Broder A, Kumar R, Maghoul F, et al. Graph structure in the Web [J]. Comput. Netw., 2000, 33 (1): 309-320
[54] Jeong H, Mason S, Barabási A L, et al. Lethality and centrality in protein networks [J]. Nature, 2001, 411 (6833): 41-42
[55] Dunne J A, Williams R J, Martinez N D. Network structure and biodiversity loss in food webs:Robustness increases with connectance [J]. Ecology Letters, 2002, 5 (4): 558-567
[56] Newman M E J, Forrest S, Balthrop J. Email networks and the spread ofcomputer viruses [J]. Phys. Rev. E, 2002, 66 (3): 035101
[57] Magoni D. Tearing down the Internet [J]. IEEE J. Sel. Areas Commun., 2003, 21 (6): 949-960
[58] Samant K, Bhattacharyya S. Topology, search, and fault tolerance in unstructured P2P networks. Proceedings of the Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Press, 2004
[59] Holme P, Kim B J, Yoon C N, et al. Attack vulnerability of complex networks [J]. Physical Review E, 2002, 65 (5):
[60] Freeman L C. A set of measures of centrality based upon betweenness [J]. Sociometry, 1977, 40 (1): 35-41
[61] Cohen R, Erez K, ben-Avraham D, et al. Resilience of the Internet to random breakdowns [J]. Phys. Rev. Lett., 2000, 85 (21): 4626-4628
[62] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Phys. Rev. E, 2001, 64 (2): 26118
[63] Broadbent S R, Hammersley J M. Percolation processes: I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society [C]. Cambridge: CAMBRIDGE UNIV. PRESS 1957
[64] Hammersley J M. Percolation processes: II. The connective constant [J]. Proc. Cambridge Philos. Soc., 1957, 53 642-645
[65] Callaway D S, Newman M E J, Strogatz S H, et al. Network Robustness and Fragility: Percolation on Random Graphs [J]. Physical Review Letters, 2000, 85 (25): 5468-5471
[66] Gallos L K, Cohen R, Argyrakis P, et al. Stability and Topology of Scale-Free Networks under Attack and Defense Strategies [J]. Physical Review Letters, 2005, 94 (18): 188701
[67] Albert R, Barabási A-L. Statistical mechanics of complex networks [J]. Rev. Mod. Phys., 2002, 74 (1): 47-51
[68] Dobson I, Carreras B A, Newman D E. A Probabilistic Loading-dependent Model of Cascading Failure [J]. Probability in the Engineering and Informational Sciences, 2005, 19 (1): 15-32
[69] Dobson I, Carreras B A, Newman D E. A probabilistic loading-dependent model of cascading failure and possible implications for blackouts. Proceedings of the 36th Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Computer Society, 2003
[70] Dobson I, Carreras B A, Newman D E. Branching process models for the exponentially increasing portions of cascading failure blackouts. Thirty-eighth Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Computer Society, 2005
[71] Dobson I, Carreras B A, Enewman D. A branching process approximation tocascading load-dependent system failure. Proceedings of the 37th Annual Hawaii International Conference on System Sciences [C]. Hawaii: IEEE Computer Society, 2004
[72] Carreras B A, Lynch V E, Dobson I, et al. Critical points and transitions in an electric power transmission model for cascading failure blackouts [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2002, 12 (4): 985
[73] Carreras B A, Lynch V E, Dobson I, et al. Complex dynamics of blackouts in power transmission systems [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2004, 14 (3): 643
[74] Asavathiratham C. The Influence Model: A Tractable Representation for the Dynamics of Networked Markov Chains [D]. Massachusetts Institute of Technology, 2000
[75] Watts D J. A simple model of global cascades on random networks [J]. Proc. Natl. Acad. Sci. U.S.A, 2002, 99 (9): 5766-5771
[76] Bak P, Tang C, Wiesenfeld K. Self-organized criticality: An explanation of the 1/f noise [J]. Physical Review Letters, 1987, 59 (4): 381-384
[77] Bak P, Tang C, Wiesenfeld K. Self-organized criticality [J]. Physical Review A, 1988, 38 (1): 364-374
[78] Bak P, Bak P. How nature works: the science of self-organized criticality [M]. Copernicus, 1996
[79] Bonabeau E. Sandpile Dynamics on Random Graphs [J]. JOURNAL-PHYSICAL SOCIETY OF JAPAN, 1995, 64 (1): 327-327
[80] Lise S, Paczuski M. Nonconservative Earthquake Model of Self-Organized Criticality on a Random Graph [J]. Physical Review Letters, 2002, 88 (22): 228301
[81] Goh K I, Lee D S, Kahng B, et al. Cascading toppling dynamics on scale-free networks [J]. Physica A, 2005, 346 (1-2): 93-103
[82] Lee D S, Goh K I, Kahng B, et al. Sandpile avalanche dynamics on scale-free networks [J]. Physica A: Statistical Mechanics and its Applications, 2004, 338 (1-2): 84-91
[83] Kaneko K. Overview of coupled map lattices [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 1992, 2 (3): 279
[84] Gade P M, Hu C K. Synchronous chaos in coupled map lattices with small-world interactions [J]. PHYSICAL REVIEW E, 2000, 62 (5): 6409-6413
[85] Wang X F, Xu J. Cascading failures in coupled map lattices [J]. Phys. Rev. E, 2004, 70 (5): 056113
[86] Xu J, Wang X F. Cascading failures in scale-free coupled map lattices [J]. Physica A: Statistical Mechanics and its Applications, 2005, 349 (3-4): 685-692
[87] Goh K I, Kahng B, Kim D. Universal Behavior of Load Distribution inScale-Free Networks [J]. Physical Review Letters, 2001, 87 (27): 278701
[88] Moreno Y, Gómez J B, Pacheco A F. Instability of scale-free networks under node-breaking avalanches [J]. Europhys. Lett., 2002, 58 (4): 630-636
[89] Moreno Y, Gómez J B, Pacheco A F. Fracture and Second-Order Phase Transitions [J]. Physical Review Letters, 2000, 85 (14): 2865-2868
[90] Moreno Y, Pastor-Satorras R, Vázquez A, et al. Critical load and congestion instabilities in scale-free networks [J]. Europhys. Lett., 2003, 62 (2): 292-298
[91] Motter A E, Lai Y C. Cascade-based attacks on complex networks [J]. Phys. Rev. E, 2002, 66 (6): 065102
[92] Barthélemy M. Comment on“Universal Behavior of Load Distribution in Scale-Free Networks”[J]. Physical Review Letters, 2003, 91 (18): 189803
[93] Motter A E. Cascade Control and Defense in Complex Networks [J]. Phys. Rev. Lett., 2004, 93 (9): 098701
[94] Crucitti P, Latora V, Marchiori M. Model for cascading failures in complex networks [J]. Phys. Rev. E, 2004, 69 (4): 045104
[95] Kinney R, Crucitti P, Albert R, et al. Modeling cascading failures in the North American power grid [J]. Eur. Phys. J. B, 2005, 46 (1): 101-107
[96] Holme P, Kim B J. Vertex overload breakdown in evolving networks [J]. Phys. Rev. E, 2002, 65 (6): 066109
[97] Holme P. Edge overload breakdown in evolving networks [J]. Phys. Rev. E., 2002, 66 (3): 036119
[98] Mantegna R N, Stanley H E. An introduction to econophysics: correlations and complexity in finance [M]. Cambridge University Press New York, NY, USA, 1999
[99] Moreno Y, Vazquez A. The Bak-Sneppen model on scale-free networks [J]. Europhysics Letters, 2002, 57 (5): 765-771
[100] Erd?s P, Rényi A. On the evolution of random graphs [J]. Publ. Math. Inst. Hung. Acad. Sci., 1960, 5 17-60
[101] Erd?s P, Rényi A. On random graphs [J]. Publ. Math., 1959, 6 290-297
[102] Bollobas B. Degree Sequences of Random Graphs [J]. Discrete Mathematics, 1981, 33 (1): 1-19
[103] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Physical Review E, 2001, 64 (2):
[104] Chung F, Lu L Y, Vu V. Spectra of random graphs with given expected degrees [J]. Proceedings of the National Academy of Sciences of the United States of America, 2003, 100 (11): 6313-6318
[105] Chung F, Lu L Y. The average distances in random graphs with given expected degrees [J]. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99 (25): 15879-15882
[106] Chung F, Lu L. Connected components in random graphs with given degree sequences [J]. Annals of Combinatorics, 2002, 6(2):125-145
[107] Watts D J. Small Worlds: The Dynamics of Networks between Order and Randomness [M]. New Jersey: Princeton University Press, 1999
[108] Watts D J, Strogatz S H. Collective dynamics of 'small-world' networks [J]. Nature, 1998, 393 (6684): 440-442
[109] Newman M E J, Moore C, Watts D J. Mean-field solution of the small-world network model [J]. Physical Review Letters, 2000, 84 (14): 3201-3204
[110] Newman M E J. Models of the small world [J]. Journal of Statistical Physics, 2000, 101 (3-4): 819-841
[111] Newman M E J, Watts D J. Scaling and percolation in the small-world network model [J]. Phys. Rev. E, 1999, 60 (6): 7332-7342
[112] Kasturirangan R. Multiple Scales in Small-World Graphs [J]. cond-mat/9904055, 1999,
[113] Dorogovtsev S N, Mendes J F F, Samukhin A N. Structure of growing networks with preferential linking [J]. Phys. Rev. Lett., 2000, 85 (21): 4633-4636
[114] Kleinberg J M. Navigation in a small world [J]. Nature, 2000, 406 845
[115] Barabási A L, Albert R. Emergence of scaling in random networks [J]. Science, 1999, 286 (5439): 509-512
[116] Krapivsky P L, Redner S, Leyvraz F. Connectivity of growing random networks [J]. Phys. Rev. Lett., 2000, 85 (21): 4629-4632
[117] Dorogovtsev S N, Mendes J F F. Effect of the accelerating growth of communications networks on their structure [J]. Phys. Rev. E, 2001, 63(2): 025101
[118] Bianconi G, Barabási A-L. Competition and multiscaling in evolving networks [J]. Europhys. Lett., 2001, 54 (4): 436-442
[119] Liu Z H, Lai Y-C, Ye N. Statistical properties and attack tolerance of growing networks with algebraic preferential attachment [J]. Phys. Rev. E, 2002, 66 (3): 036112
[120] Kleinberg J M, Kumar S R, Raghavan P, et al. The Web as a graph: measurements, models and methods. Proceedings of the International Conference on Combinatorics and Computing [C]. Berlin: Springer, 1999
[121] Chung F, Lu L Y, Dewey T G, et al. Duplication models for biological networks [J]. Journal of Computational Biology, 2003, 10 (5): 677-687
[122] Krapivsky P L, Redner S. Organization of growing random networks [J]. Phys. Rev. E, 2001, 63 (6): 066123
[123] Zhang H, Liu Z, Tang M, et al. An adaptive routing strategy for packet delivery in complex networks [J]. Physics Letters A, 2007, 364 (3-4): 177-182
[124] Xuan Q, Li Y J, Wu T J. A local-world network model based on inter-nodecorrelation degree [J]. Physica A, 2007, 378 (2): 561-572
[125] Chowdhury A, Frieder O, Wan P-J. On the design, development, deployment, and network survivability analysis of the dynamic routing system protocol [J]. Journal of Supercomputing, 2002, 21 (3): 239-256
[126] Gallos L K, Argyrakis P, Bunde A, et al. Tolerance of scale-free networks: from friendly to intentional attack strategies [J]. Physica A, 2004, 344(3):504-509
[127] Li X, Chen G R. A local-world evolving network model [J]. Physica a-Statistical Mechanics and Its Applications, 2003, 328 (1-2): 274-286
[128] Zhang Z Z, Rong L L, Comellas F. High-dimensional random Apollonian networks [J]. Physica a-Statistical Mechanics and Its Applications, 2006, 364 610-618
[129] Zhang Z Z, Rong L L, Guo C H. A deterministic small-world network created by edge iterations [J]. Physica A, 2006, 363 (2): 567-572
[130] Zhang Z Z, Rong L L, Comellas F. Evolving small-world networks with geographical attachment preference [J]. Journal of Physics A, 2006, 39 (13): 3253-3261
[131] Zhang Z Z, Comellas F, Fertin G, et al. High-dimensional Apollonian networks [J]. Journal of Physics A, 2006, 39 (8): 1811-1818
[132] Qunjiao Zhang, Junan Lu, Jinhu Lü. Adaptive Feedback Synchronization of a General Complex Dynamical Network With Delayed Nodes [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—II: EXPRESS BRIEFS, 2008, 55 (2): 183-187
[133] Zhang Z Z, Rong L L, Zhou S G. Evolving Apollonian networks with small-world scale-free topologies [J]. Physical Review E, 2006, 74 (4): 046105
[134] Li M H, Wang D H, Fan Y, et al. Modelling weighted networks using connection count [J]. New Journal of Physics, 2006, 8 (5): 72
[135] Li M H, Wu J S, Wang D H, et al. Evolving model of weighted networks inspired by scientific collaboration networks [J]. Physica A, 2007, 375 (1): 355-364
[136] Wang W X, Wang B H, Hu B, et al. General dynamics of topology and traffic on weighted technological networks [J]. Physical Review Letters, 2005, 94 (18): 188702
[137]方锦清,汪小帆,刘曾荣.略论复杂性问题和非线性复杂网络系统的研究[J].科技导报, 2004, (2): 9-12,64
[138] Boccaletti S, Latora V, Moreno Y, et al. Complex networks: Structure and dynamics [J]. Physics Reports, 2006, 424 (4-5): 175-308
[139] Bornholdt S, Schuster H G. Handbook of Graphs and Networks: From the Genome to the Internet [M]. Berlin: Wiley-VCH Weinheim, 2003
[140] De Montis A, Barthelemy M, Chessa A, et al. The structure of Inter-Urban traffic: A weighted network analysis [J]. Environment and Planning B: Planning and Design, 2005, 34 (5): 905-924
[141] Jiang B, Claramunt C. Topological analysis of urban street networks [J]. Environment and Planning B: Planning and Design, 2004, 31 (1): 151-162
[142] Kurant M, Thiran P. Extraction and analysis of traffic and topologies of transportation networks [J]. PHYSICAL REVIEW E, 2006, 74 (3): 36114
[143] Sienkiewicz J. Statistical analysis of 22 public transport networks in Poland [J]. PHYSICAL REVIEW E, 2005, 72 (4): 46127
[144] Watts D J. Small Worlds:The Dynamics of Networks between Order and Randomness [M]. princeton: princeton university press, 1999
[145] Csanyi G, Szendroi B. Fractal-small-world dichotomy in real-world networks [J]. PHYSICAL REVIEW E, 2004, 70 (1): 016122
[146] Ravasz E, Barabasi A L. Hierarchical organization in complex networks [J]. PHYSICAL REVIEW E, 2003, 67 (2): 26112
[147] Sch?fer M, Scholz J, Greiner M. Proactive Robustness Control of Heterogeneously Loaded Networks [J]. Phys. Rev. Lett., 2006, 96 (10): 108701
[148] Latora V, Marchiori M. Is the Boston subway a small-world network? [J]. Physica A, 2002, 314 (1-4): 109-113
[149] Sen P, Dasgupta S, Chatterjee A, et al. Small-world properties of the Indian railway network [J]. PHYSICAL REVIEW E Phys Rev E, 2003, 67 (3): 036106
[150] Li K, Gao Z, Mao B. A WEIGHTED NETWORK MODEL FOR RAILWAY TRAFFIC [J]. International Journal of Modern Physics C, 2006, 17 (09): 1339-1347
[151] Li W, Cai X. Empirical analysis of a scale-free railway network in China [J]. Physica A: Statistical Mechanics and its Applications, 2007, 382 (2): 693-703
[152] Barthelemy M. Betweenness centrality in large complex networks [J]. Euro. Phys. J. B, 2004, 38 (2): 163-168
[153]郭波,武小悦.系统可靠性分析[M].长沙:国防科技大学出版社, 2003
[154]李翠玲,谢里阳.相关失效分析方法评述与探讨[J].机械设计与制造, 2003, (3): 1-3
[155]熊蔚明,刘有恒.关于通信网可靠性的研究进展[J].通信学报, 1990, 11 (4): 43-49
[156]陈勇,胡爱群,胡骏,等.通信网中最重要节点的确定方法[J].高技术通讯, 2004, 14 (1): 21-24
[157] Jung W S, Wang F, Stanley H E. Gravity model in the Korean highway [J]. EPL-Europhysics Letters, 2008, 81 (4): 48005
[158] Bagler G. Analysis of the Airport Network of India as a complex weightednetwork [J]. Physica A: Statistical Mechanics and its Applications, 2008, 387 (12): 2972-2980
[159] Albert R, Jeong H, Barabási A-L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406 (6794): 378-382
[160] Lee W H, Michels K M, Bondy C A. Localization of Insulin-Like Growth-Factor Binding Protein-2 Messenger-Rna During Postnatal Brain-Development - Correlation with Insulin-Like Growth Factor-I and Factor-Ii [J]. Neuroscience, 1993, 53 (1): 251-265
[161] Brouwer A E. Toughness and Spectrum of a Graph [J]. Linear Algebra and Its Applications, 1995, 226(1):267-271
[162] Choudum S A, Priya N. Tough-maximum graphs [J]. Ars Combinatoria, 2001, 61(1):167-172
[163]毛俊超,冯立华,沈秀专.图的坚韧度与图的Laplaeian特征值的关系[J].吉首大学学报:自然科学版, 2007, 28 (2): 28-29
[164]许进.论图的坚韧度(Ⅰ)——基本理论[J].电子学报, 1996, 24 (001): 23-27
[165] Barefoot C A, Entringer R, Swart H. Vulnerability in graphs - a comparative survey [J]. J. Combin. Math. Combin. Comput., 1987, 30(1):13-22
[166] Cozzen M, Moazzami D, Stueckle S. The tenacity of a graph. Seventh International Conference on the Theory and Applications of Graphs [C]. New York: Wiley, 1995
[167]欧阳克智,欧阳克毅,于文池.图的相对断裂度[J].兰州大学学报, 1993, 29 (3): 43-49
[168] Bassalygo L A, Pinsker M S. The complexity of an optimal non-blocking commutation scheme without reorganization [J]. Problemy Peredaci Informacii, 1973, 9 (1): 84-87
[169] Fiedler M. Algebraic Connectivity of Graphs [J]. Czechoslovak Mathematical Journal, 1973, 23 (2): 298-305
[170] Albert R, Jeong H, Barabási A-L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406 378-382
[171] Molloy M, Reed B. The size of the giant component of a random graph with a given degree sequence [J]. Combinatorics Probab. Comput., 1998, 7(03): 295-305
[172] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Phys. Rev. E, 2001, 64 (2): 026118
[173] Karlin S, M.Taylor H.随机过程教程(第二版) [M].北京:人民邮电出版社, 2007
[174] Dobson I, Carreras B A, Newman D E. Probabilistic load-dependent cascadingfailure with limited component interactions. Proceedings of IEEE International Symposium on Circuits and Systems [C]. Vancouver, BC, Canada: IEEE 2004
[175] Dobson I, Carreras B A, Lynch V E, et al. Complex systems analysis of series of blackouts: Cascading failure, critical points, and self-organization [J]. Chaos: An Interdisciplinary Journal of Nonlinear Science, 2007, 17 (2): 026103
[176] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. PHYSICAL REVIEW E, 2001, 64 (2): 26118
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |