A new kind of node centrality in directed weighted networks based on the demands of network clients

To reveal the correlation between the demands of network clients and the safety and robustness of real-world networks, we propose client demand centrality (CDC) in order to quantify the contributions of nodes in the transportation processes in directed weighted networks. CDC is defined by incorporating not only the topology and dynamics of the network but also the demands of network clients. The centrality measures node potential to ensure acceptable and successful transportation for clients and does quite well in distinguishing the roles of different nodes in the network. Simulation results show that node CDC has Gaussian distributions in directed networks with different link weight distributions, and the expected value of the Gaussian distribution increases from negative to positive with a decrease of the client demand. In particular, for directed scale-free networks with the scale-free link weight distribution, the network CDC is only correlated with the degree structure of the network when the client demand is large.

[1]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[2]  R. Guimerà,et al.  The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[4]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[5]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[6]  Hong Yan,et al.  Towards a framework for network control composition , 2006, INM '06.

[7]  Aoife Ahern,et al.  Mapping the relationship between transport energy consumption and urban form characteristics for the Greater Dublin Area , 2010 .

[8]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[9]  Dannie Durand,et al.  NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees , 2000, J. Comput. Biol..

[10]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Patrick Doreian,et al.  Computational methods for social network analysis , 1990 .

[12]  Peter Rickwood,et al.  Options for reducing transport fuel consumption and greenhouse emissions for Sydney , 2007 .

[13]  Bo Hu,et al.  Efficient routing on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Hawoong Jeong,et al.  Scale-free trees: the skeletons of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Shaoting TangS. Tang,et al.  On routing strategy with finite-capacity effect on scale-free networks , 2010 .

[16]  Franco Scarselli,et al.  Inside PageRank , 2005, TOIT.

[17]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[18]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[19]  Qipeng Sun,et al.  Calculation and Analysis of Transportation Energy Consumption Level in China , 2010 .

[20]  Roberto Sabella,et al.  Tutorial: Key Elements for WDM Transport Networks , 2000, Photonic Network Communications.

[21]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality and clustering in complex hyper-networks , 2006 .

[22]  Nicholas J Gotelli,et al.  Food-Web Models Predict Species Abundances in Response to Habitat Change , 2006, PLoS biology.

[23]  Petter Holme,et al.  Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..

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

[25]  Miklos N Szilagyi.  A neural network approach to the simulation of human society , 1991 .

[26]  Heiko Rieger,et al.  Stability of shortest paths in complex networks with random edge weights. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Anne-Marie Kermarrec,et al.  Second order centrality: Distributed assessment of nodes criticity in complex networks , 2011, Comput. Commun..

[28]  H. Wilbur,et al.  EXPERIMENTAL ECOLOGY OF FOOD WEBS: COMPLEX SYSTEMS IN TEMPORARY PONDS , 1997 .

[29]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[30]  Geoffrey Canright,et al.  Roles in networks , 2004, Sci. Comput. Program..

[31]  Norman P. Hummon,et al.  Connectivity in a citation network: The development of DNA theory☆ , 1989 .

[32]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[33]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .