Dominating scale-free networks with variable scaling exponent: Heterogeneous networks are not difficult to control

New Journal of Physics

Volumn 14, Issue , 2012, Pages

  Nacher, Jose C ^a,b   Akutsu, Tatsuya ^c  

^a TOHO UNIVERSITY   (Japan)

^b FUTURE UNIVERSITY HAKODATE   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DEGREE EXPONENT; INTERCONNECTIVITY; MINIMUM DOMINATING SET; MULTIPLE TARGETS; NETWORK DEGREE DISTRIBUTIONS; POWER-LAW; REAL-WORLD NETWORKS; SCALE FREE NETWORKS; SCALING EXPONENT; THEORETICAL CALCULATIONS;

HETEROGENEOUS NETWORKS;

COMPUTER SIMULATION;

EID: 84864367967     PISSN: 13672630     EISSN: None     Source Type: Journal    
DOI: 10.1088/1367-2630/14/7/073005     Document Type: Article

References (38)

1. Vespignani A 2009 Predicting the behavior of techno-social systems Science 325 425-8
2. Schweitzer F, Fagiolo G, Sornette D, Vega-Redondo F, Vespignani A and White D R 2009 Economic networks: the new challenges Science 325 422-5
3. Barabási A-L, Gulbahce N and Loscalzo J 2011 Network medicine: a network-based approach to human disease Nature Rev. Genet. 12 56-68
4. Albert R and Barabási A-L 2002 Statistical mechanics of complex networks Rev. Mod. Phys. 74 47-97
5. Dorogovtsev S N and Mendes J F F 2003 Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford: Oxford University Press)
6. Kim J S, Goh K-I, Kahng B and Kim D 2007 Fractality and self-similarity in scale-free networks New J. Phys. 9 177
7. Newman M E J 2010 Networks: An Introduction (New York: Oxford University Press)
8. Oh E, Lee D-S, Kahng B and Kim D 2007 Synchronization transition of heterogeneously coupled oscillators on scale-free networks Phys. Rev. E 75 011104
9. Liu Y-Y, Slotine J-J and Barabási A-L 2011 Controllability of complex networks Nature 473 167-73
10. Müller F-J and Schuppert A 2011 Few inputs can reprogram biological networks Nature 478 E4
11. Meyn S 2008 Control Techniques for Complex Networks (New York: Cambridge University Press)
12. Akutsu T, Hayashida M, Ching W-K and Ng M K 2007 Control of Boolean networks: hardness results and algorithms for tree structured networks J. Theor. Biol. 244 670-9 (Pubitemid 46148979)
13. Lombardi A and Hornquist M 2007 Controllability analysis of networks Phys. Rev. E 75 56110
14. Liu B, Chu T, Wang L and Xie G 2008 Controllability of a leader-follower dynamic network with switching topology IEEE Trans. Autom. Control 53 1009-13 (Pubitemid 351795861)
15. Rahmani A, Ji M, Mesbahi M and Egerstedt M 2009 Controllability of multi-agent systems from a graphtheoretic perspective SIAM J. Control Optim. 48 162-89
16. Kim D-H and Motter A E 2009 Slave nodes and the controllability of metabolic networks New J. Phys. 11 113047
17. Blum J, Ding M, Thaeler A and Cheng X 2004 Applications of connected dominating sets in wireless networks Handbook of Combinatorial Optimization ed D-Z Du and P Pardalos (Dordrecht: Kluwer) pp 329-69
18. Alzoubi K, Wan P J and Frieder O 2002 Message-optimal connected dominating sets in mobile ad hoc networks Proc. 3rd Int. Symp. on Mobile ad hoc Networks and Computing (New York: ACM) pp 157-64
19. Stojmenovic I, Seddigh M and Zunic J 2002 Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks IEEE Trans. Parallel Distrib. Syst. 13 14-25 (Pubitemid 35037238)
20. Cokuslu D, Erciyes K and Dagdeviren O 2006 A dominating set-based clustering algorithm for mobile ad hoc networks Proc. Int. Conf. on Computational Science (Lecture Notes in Computer Science vol 3991) (Berlin: Springer) pp 571-8 (Pubitemid 44152704)
21. Haynes T W, Hedetniemi S T and Slater P J 1998 Fundamentals of domination in graphs Pure Applied Mathematics (New York: Chapman and Hall/CRC)
22. Sampath A and Thampi S M 2011 An ACO algorithm for effective cluster head selection J. Adv. Inf. Technol. 2 50-6
23. Wolsey L A 1998 Integer Programming (New York: Wiley)
24. Nemhauser G L and Wolsey L A 1998 Integer and Combinatorial Optimization (New York: Wiley)
25. Molloy M and Reed B 1995 A critical point for random graphs with a given degree sequence Random Struct. Algorithms 6 161-79
26. Newman M E J 2003 The structure and function of complex networks SIAM Rev. 45 167-203
27. Viger F and Latapy M 2005 Efficient and simple generation of random simple connected graphs with prescribed degree sequence Proc. COCOON'05 (Computing and Combinatorics Conf.) pp 1-15
28. Cooper C, Klasing R and Zito M 2005 Lower bounds and algorithms for dominating sets in web graphs Internet Math. 2 275-300
29. Cooper C and ZitoM2009 An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm Discrete Appl. Math. 157 2010-14
30. Artmann S, Göring F, Harant J, Rautenbach D and Schniermeyer I 2010 Random procedures for dominating sets in graphs Electron. J. Comb. 17 R102
31. Mitzenmacher M and Upfal E 2005 Probability and Computation (Cambridge: Cambridge University Press)
32. Dong J and Horvath S 2007 Understanding network concepts in modules BMC Syst. Biol. 1 24
33. Colizza V, Pastor-Satorras R and Vespignani A 2007 Reaction-diffusion processes and metapopulation models in heterogeneous networks Nature Phys. 3 276-82
34. Milo R et al 2004 Superfamilies of evolved designed networks Science 303 1538-42
35. Leskovec J, Kleinberg J and Faloutsos C 2007 Graph evolution: densification and shrinking diameters ACM Trans. Knowl. Discovery Data (ACM TKDD) 1 2
36. Leskovec J, Huttenlocher D and Kleinberg J 2010 Signed networks in social media Proc. 28th ACM Conf. of Human Factors and Computing Systems (CHI) (Atlanta, GA, USA)
37. Newman M E J 2005 Power laws, Pareto distributions and Zipf's law Contemp. Phys. 46 323-51 (Pubitemid 41335662)
38. Clauset A, Shalizi C R and Newman M E J 2009 Power-law distributions in empirical data SIAM Rev. 51 661-703