Improving network robustness by edge modification

[1]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[2]  H. Stanley,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

[3]  Howard A. Stone,et al.  2-Peak and 3-Peak Optimal Complex Networks , 2004 .

[4]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[5]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[6]  Béla Bollobás,et al.  Coupling Scale-Free and Classical Random Graphs , 2004, Internet Math..

[7]  尚哉 宮野,et al.  Highly Optimized Toleranceによるセンサ集団の最適配置構造の設計 , 2003 .

[8]  Kai-Yeung Siu,et al.  Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Hiroki Sayama,et al.  Optimization of robustness and connectivity in complex networks. , 2003, Physical review letters.

[10]  Christos Gkantsidis,et al.  The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs , 2003, ALENEX.

[11]  S. Shenker,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[12]  Sugih Jamin,et al.  Inet-3.0: Internet Topology Generator , 2002 .

[13]  SpencerJoel,et al.  The degree sequence of a scale-free random graph process , 2001 .

[14]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[15]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[16]  Mihaela Enachescu,et al.  Variations on Random Graph Models for the Web , 2001 .

[17]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[18]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  A. Barabasi,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[20]  M. Newman,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[21]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[22]  Marc Najork,et al.  On near-uniform URL sampling , 2000, Comput. Networks.

[23]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[24]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[25]  J M Carlson,et al.  Highly optimized tolerance: a mechanism for power laws in designed systems. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[26]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[27]  B. Bollobás.  The evolution of random graphs , 1984 .

[28]  Derek de Solla Price,et al.  A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..