Node Degree Sequence Preserving and Controlling S-metric

We study edge switching on node degree preserving and their effects on s-metric. In particular, we proposed Smax and Smin algorithms in a network. The concept of edge switching pairs is defined and used in the design of node degree preserving, constant, increasing (decreasing) s-metric link transformations. And the s(G) can be turned between sminand smax by the edge switching algorithm.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

[4]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[5]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  D. Fell,et al.  The small world inside large metabolic networks , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[7]  C. Peterson,et al.  Topological properties of citation and metabolic networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Derek Raine,et al.  Network Structure of Metabolic Pathways , 2001 .

[9]  Ying-Cheng Lai,et al.  Signatures of small-world and scale-free properties in large computer programs , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[11]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[12]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..