Statistical Mechanics of the Minimum Dominating Set Problem

Journal of Statistical Physics

Volumn 159, Issue 5, 2015, Pages 1154-1174

  Zhao, Jin Hua ^a   Habibulla, Yusupjan ^a   Zhou, Hai Jun ^a  

^a INSTITUTE OF THEORETICAL PHYSICS   (China)

Author keywords

Belief propagation; Core percolation; Dominating set; Leaf removal; Network coarse graining; Spin glass

Indexed keywords

EID: 84939973626     PISSN: 00224715     EISSN: 15729613     Source Type: Journal    
DOI: 10.1007/s10955-015-1220-2     Document Type: Article

References (48)

1. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
2. Yang, Y., Wang, J., Motter, A.E.: Network observability transitions. Phys. Rev. Lett. 109, 258701 (2012)
3. Biroli, G., Mézard, M.: Lattice glass models. Phys. Rev. Lett. 88, 025501 (2002)
4. Hartmann, A.K., Weigt, M.: Statistical mechanics of the vertex-cover problem. J. Phys. A 36, 11069–11093 (2003)
5. Zhao, J.-H., Zhou, H.-J.: Statistical physics of hard combinatorial optimization: vertex cover problem. Chin. Phys. B 23, 078901 (2014)
6. Echenique, P., Gómez-Gardeñes, J., Moreno, Y., Vázquez, A.: Distance-$$d$$d covering problems in scale-free networks with degree correlations. Phys. Rev. E 71, 035102(R) (2005)
7. Takaguchi, T., Hasegawa, T., Yoshida, Y.: Suppressing epidemics on networks by exploiting observer nodes. Phys. Rev. E 90, 012807 (2014)
8. Liu, Y.-Y., Slotine, J.-J., Barabási, A.-L.: Controllability of complex networks. Nature 473, 167–173 (2011)
9. Wuchty, S.: Controllability in protein interaction networks. Proc. Natl. Acad. Sci. USA 111, 7156–7160 (2014)
10. Wu, J., Li, H.: A dominating-set-based routing scheme in ad hoc wireless networks. Telecomm. Syst. 18, 13–36 (2001)
11. Bramoulle, Y., Kranton, R.: Public goods in networks. J. Econom. Theor. 135, 478–494 (2007)
12. Shen, C., Li, T.: Multi-document summarization via the minimum dominating set. In: Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010, Beijing), pp. 984–992 (Association for Computational Linguistics, 2010)
13. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960–981 (1994)
14. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 475–484 (ACM, New York, 1997)
15. Hedar, A.-R., Ismail, R.: Simulated annealing with stochastic local search for minimum dominating set problem. Int. J. Mach. Learn. Cybernet. 3, 97–109 (2012)
16. Molnár Jr, F., Sreenivasan, S., Szymanski, B.K., Korniss, K.: Minimum dominating sets in scale-free network ensembles. Sci. Rep. 3, 1736 (2013)
17. Bauer, M., Golinelli, O.: Core percolation in random graphs: a critical phenomena analysis. Eur. Phys. J. B 24, 339–352 (2001)
18. Lucibello, C., Ricci-Tersenghi, F.: The statistical mechanics of random set packing and a generalization of the Karp–Sipser algorithm. Int. J. Stat. Mech. 2014, 136829 (2014)
19. Takabe, S., Hukushima, K.: Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm. Phys. Rev. E 89, 062139 (2014)
20. He, D.-R., Liu, Z.-H., Wang, B.-H.: Complex Systems and Complex Networks. Higher Education Press, Beijing (2009)
21. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
22. Goh, K.-I., Kahng, B., Kim, D.: Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701 (2001)
23. Zhao, J.-H., Zhou, H.-J., Liu, Y.-Y.: Inducing effect on the percolation transition in complex networks. Nat. Commun. 4, 2412 (2013)
24. Zhou, H.J.: Long-range frustration in a spin-glass model of the vertex-cover problem. Phys. Rev. Lett. 94, 217203 (2005)
25. Zhou, H.-J.: Erratum: long-range frustration in a spin-glass model of the vertex-cover problem [phys. rev. lett. 94, 217203 (2005)]. Phys. Rev. Lett. 109, 199901 (2012)
26. Catanzaro, M., Pastor-Satorras, R.: Analytic solution of a static scale-free network model. Eur. Phys. J. B 44, 241–248 (2005)
27. Zhou, H.J., Lipowsky, R.: Dynamic pattern evolution on scale-free networks. Proc. Natl. Acad. Sci. USA 102, 10052–10057 (2005)
28. Šubelj, L., Bajec, M.: Robust network community detection using balanced propagation. Eur. Phys. J. B 81, 353–362 (2011)
29. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6, 29–123 (2009)
30. Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ netowrks. Nature 393, 440–442 (1998)
31. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177–187 (ACM, New York, 2005)
32. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1, 2 (2007)
33. Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Comput. 6, 50–57 (2002)
34. Cho, E., Myers, S. A., Leskovec, J.: Friendship and mobility: user movement in localation-based social networks. In: ACM SIGKDD International Conference o Knowledge Discovery and Data Mining, pp. 1082–1090 (San Diego, CA, USA, 2011)
35. Bu, D., et al.: Topological structure analysis of the protein–protein interaction network in budding yeast. Nucleic Acids Res. 31, 2443–2450 (2003)
36. Mézard, M., Montanari, A.: Information, Physics, and Computation. Oxford Univ. Press, New York (2009)
37. Xiao, J.-Q., Zhou, H.J.: Partition function loop series for a general graphical model: free-energy corrections and message-passing equations. J. Phys. A 44, 425001 (2011)
38. Zhou, H.J., Wang, C.: Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results. J. Stat. Phys. 148, 513–547 (2012)
39. Mézard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solution of random satisfiability problems. Science 297, 812–815 (2002)
40. Krzakala, F., Montanari, A., Ricci-Tersenghi, F., Semerjian, G., Zdeborova, L.: Gibbs states and the set of solutions of random constraint satisfaction problems. Proc. Natl. Acad. Sci. USA 104, 10318–10323 (2007)
41. Altarelli, F., Braunstein, A., Dall’Asta, L., Zecchina, R.: Large deviations of cascade processes on graphs. Phys. Rev. E 87, 062115 (2013)
42. Altarelli, F., Braunstein, A., Dall’Asta, L., Zecchina, R.: Optimizing spread dynamics on graphs by message passing. J. Stat. Mech. (2013). doi:10.1088/1742-5468/2013/09/P09011
43. Guggiola, A., Semerjian, G.: Minimal contagious sets in random regular graphs. J. Stat. Phys. 158, 300–358 (2015)
44. Hasegawa, T., Takaguchi, T., Masuda, N.: Observability transitions in correlated networks. Phys. Rev. E 88, 042809 (2013)
45. Mézard, M., Parisi, G.: The bethe lattice spin glass revisited. Eur. Phys. J. B 20, 217–233 (2001)
46. Mézard, M., Montanari, A.: Reconstruction on trees and spin glass transition. J. Stat. Phys. 124, 1317–1350 (2006)
47. Habibulla, Y., Zhao, J.-H., Zhou, H.-J.: The directed dominating set problem: generalized leaf removal and belief propagation. (2015, in preparation)
48. Du, D.-Z., Wan, P.-J.: Connected Dominating Set: Theory and Applications. Springer, New York (2013)