Dominating scale-free networks using generalized probabilistic methods

Scientific Reports

Volumn 4, Issue , 2014, Pages

  Molnar F ^a,b   Derzsy, N ^a,b   Czabarka, E ^d   Szekely L ^d   Szymanski, B K ^b,c   Korniss, G ^a,b  

^a Rensselaer Polytechnic Institute   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c Rensselaer Polytechnic Institute   (United States)

^d UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84923074465     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep06308     Document Type: Article

References (49)

1. Cowan, N. J., Chastain, E. J., Vilhena, D. A., Freudenberg, J. S. & Bergstrom, C. T. Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks. PLoS ONE 7, e38398 (2012).
2. Nacher, J. C. & Akutsu, T. Structural controllability of unidirectional bipartite networks. Sci. Rep. 3, 1647 (2013).
3. Nacher, J. C. & Akutsu, T. Analysis on Critical Nodes in Controlling Complex Networks Using Dominating Sets. Proc. 2013 Int. Conf. Signal-Image Technology & Internet-Based Systems (IEEE, 2013) pp. 649-654.
4. Jia, T. et al. Emergence of bimodality in controlling complex networks. Nat. Commun. 4, 2002 (2013).
5. Yang, Y., Wang, J. & Motter, A. E. Network Observability Transitions. Phys. Rev. Lett. 109, 258701 (2012).
6. Kelleher, L. & Cozzens, M. Dominating Sets in Social Network Graphs. Math. Soc. Sciences 16, 267-279 (1988).
7. Wang, F., Du, H., Camacho, E., Xu, K., Lee, W., Shi, Y. & Shan, S. On positive influence dominating sets in social networks. Theo. Comp. Sci. 412, 265-269 (2011).
8. Eubank, S., Anil Kumar, V. S., Marathe, M. V., Srinivasan, A. & Wang, N. Structural and algorithmic aspects of massive social networks. Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 718-727 (2004).
9. Echenique, P., Gómez-Gardeñes, J., Moreno, Y. & Vázquez, A. Distance-d covering problems in scale-free networks with degree correlations. Phys. Rev. E 71, 035102(R) (2005).
10. Wuchty, S. Controllability in protein interaction networks. Proc. Natl. Acad. Sci. USA, Early Edition, April 28 (2014); http://dx.doi.org/10.1073/pnas.1311231111 (Date of access: 03/06/2014)
11. Alon, N. Transversal numbers of uniform hypergraphs. Graphs Combin. 6, 1-4 (1990).
12. Alon, N. & Spencer, J. H. The Probabilistic Method. 2nd ed.(Willey, New York, 2000).
13. Raz, R. & Safra, S. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. Proc. 29th Annu. ACM Symp. Theory of Computing, pp. 475-484 (1997).
14. Potluri, A. & Singh, A. Two Hybrid Meta-heuristic Approaches for Minimum Dominating Set Problem. Lect. Notes Comput. Sc. 7077, 97-104 (2011).
15. Hedar, A. R. & Ismail, R. Hybrid Genetic Algorithm for Minimum Dominating Set Problem. Lect. Notes Comput. Sc. 6019, 457-467 (2010).
16. Blum, J., Ding, M., Thaeler, A. & Cheng, X. Connected Dominating Set in Sensor Networks and MANETs. Du, D.-Z. & Pardalos, P. (Eds.), Handbook of Combinatorial Optimization, 329-369 (2004).
17. Ruan, L., Du, H., Jia, X., Wu, W., Li, Y. & Ko, K.-I. A greedy approximation for minimum connected dominating sets. Theo. Comp. Sci. 329, 325-330 (2004).
18. Wan, P.-J., Alzoubi, K. M. & Frieder, O. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. Mobile Netw. Appl. 9, 141-149 (2004).
19. Chen, Q., Fan, W. T. & Zhang, M. Distributed heuristic approximation algorithm for minimumconnected dominating set. Computer Engineering 35, 92-94 (2009).
20. Simonetti, L., da Cunha, A. S. & Lucena, A. The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. Lect. Notes Comput. Sc. 6701, 162-169 (2011).
21. Fomin, F. V., Grandoni, F., Pyatkin, A. V. & Stepanov, A. A. Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications. ACM Trans. Algorithms 5, 9 (2008).
22. Fomin, F. V., Grandoni, F. & Kratsch, D. AMeasure & Conquer Approach for the Analysis of Exact Algorithms. J. ACM 56, 25 (2009).
23. van Rooij, J. M. M., Nederlof, J. & van Dijk, T. C. Inclusion/Exclusion Meets Measure and Conquer: Exact Algorithms for Counting Dominating Sets. Lect. Notes Comput. Sc. 5757, 554-565 (2009).
24. van Rooij, J. M. M. & Bodlaender, H. L. Exact algorithms for dominating set. Discrete Appl. Math. 159, 2147-2164 (2011).
25. Haynes, T. W., Hedetniemi, S. T. & Slater, P. J. Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998).
26. Cooper, C., Klasing, R. & Zito, M. Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2, 275-300 (2005).
27. Barabási, A.-L. & Albert, R. Emergence of scaling in random networks. Science 286, 509-512 (1999).
28. Erdo{double acute}s, P. & Rényi, A. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17-61 (1960).
29. Zito, M. Greedy Algorithms for Minimisation Problems in Random Regular Graphs. Proc. 9th Annu. Eur. Symp. Algorithms 525-536 (2001).
30. Bíró, Cs., Czabarka, É., Dankelmann, P. & Székely, L. Bulletin of the I. C. A. 64, 73-82 (2012).
31. Arnautov, V. I. Estimation of the exterior stability number of a graph bymeans of the minimal degrees of the vertices. Prikl. Mat. i Programmirovanie 11 3-8, 126 (1974) (in Russian).
32. Clark, W. E., Shekhtman, B., Suen, S. & Fisher, D. C. Upper bounds for the domination number of a graph. Congr. Numer. 132, 99-123 (1998).
33. Wieland, B. & Godbole, A. P. On the Domination Number of a Random Graph. Electron. J. Combin. 8, R37 (2001).
34. Molnár, F. Jr., Sreenivasan, S., Szymanski, B. K. & Korniss, G. Minimum dominating sets in scale-free network ensembles. Sci. Rep. 3, 1736 (2013).
35. Nacher, J. C. & Akutsu, T. Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control. New J. Phys. 14, 073005 (2012).
36. Viger, F. & Latapy, M. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. Proc. 11th Intl. Comp. Combin. Conf. pp. 440-449 (2005).
37. Eguiluz, V. & Klemm, K. Phys. Rev. Lett. 89, 108701 (2002).
38. Eubank, S., Guclu, H., Anil Kumar, V., Marathe, M., Srinivasan, A., Toroczkai, Z. & Wang, N. Modelling disease outbreaks in realistic urban social networks. Nature 429, 180-184 (2004).
39. Fortunato, S., Boguña, M., Flammini, A. & Menczer, F. On Local Estimations of PageRank: A Mean Field Approach. Internet Math. 4, 245-266 (2007).
40. Li, L., Alderson, D., Doyle, J. & Willinger, W. Towards a theory of scale-free graphs: Definition, properties, and implications. Internet Math. 2, 431-523 (2005).
41. Newman, M. Mixing patterns in networks. Phys. Rev. E 67, 026126 (2003).
42. Newman, M. Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002).
43. Litvak, N. & van der Hofstad, R. Uncovering disassortativity in large scale-free networks. Phys. Rev. E 87, 022801 (2013).
44. Spearman, C. The Proof and Measurement of Association between Two Things. Amer. J. Psycho. 15, 72-101 (1904).
45. Molloy, M. & Reed, B. A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algor. 6, 161-180 (1995).
46. Britton, T., Deijfen, M. & Martin-Löf, A. Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124, 1377-1397 (2005).
47. Catanzaro, M., Boguna, M. & Pastor-Satorras, R. Generation of uncorrelated random scale-free networks. Phys. Rev. E 71, 027103 (2005).
48. Boguñá, M., Pastor-Satorras, R. & Vespignani, A. Cut-offs and finite size effects in scale-free networks. Eur. Phys. B 38, 205-509 (2004).
49. Stanford Network Analysis Project (SNAP). http://snap.stanford.edu/data (2009) (Date of access: 01/12/2013).