Some Combinatorial Problems in Power-law Graphs

The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties of graphs. For example, it has been shown that in real-life power-law networks, both the matching number and the domination number are relatively smaller, compared with homogeneous graphs. In this paper, we study analytically several combinatorial problems for two powerlaw graphs with the same number of vertices, edges, and the same power exponent. For both graphs, we determine exactly or recursively their matching number, independence number, domination number, the number of maximum matchings, the number of maximum independent sets, and the number of minimum dominating sets. We show that power-law behavior itself cannot characterize the combinatorial properties of a heterogenous graph. Since the combinatorial properties studied here have found wide applications in different fields, such as structural controllability of complex networks, our work offers insight in the applications of these combinatorial problems in power-law graphs.

[1]  Ness B. Shroff,et al.  Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels , 2013, MobiHoc.

[2]  Damir Vukicevic.  Applications of Perfect Matchings in Chemistry , 2011, Structural Analysis of Complex Networks.

[3]  Albert-László Barabási,et al.  Control Principles of Complex Networks , 2015, ArXiv.

[4]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[5]  Fuji Zhang,et al.  A quadratic identity for the number of perfect matchings of plane graphs , 2008, Theor. Comput. Sci..

[6]  Derrick Kondo,et al.  A maximum independent set approach for collusion detection in voting pools , 2011, J. Parallel Distributed Comput..

[7]  Jane Zundel.  MATCHING THEORY , 2011 .

[8]  Zhongzhi Zhang,et al.  Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph , 2017, Theor. Comput. Sci..

[9]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

[10]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[11]  Fabrizio Grandoni,et al.  Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications , 2008, TALG.

[12]  Zhongzhi Zhang,et al.  Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket , 2018, Theor. Comput. Sci..

[13]  Tao Li,et al.  Multi-Document Summarization via the Minimum Dominating Set , 2010, COLING.

[14]  Alan M. Frieze,et al.  Finding a maximum matching in a sparse random graph in O(n) expected time , 2008, JACM.

[15]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[16]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[17]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Tatsuya Akutsu,et al.  Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control , 2012 .

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

[20]  Bin Wu,et al.  Pfaffian orientations and perfect matchings of scale-free networks , 2015, Theor. Comput. Sci..

[21]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[22]  Fuji Zhang,et al.  Graphical condensation for enumerating perfect matchings , 2005, J. Comb. Theory, Ser. A.

[23]  Marek Karpinski,et al.  Inapproximability of dominating set on power law graphs , 2012, Theor. Comput. Sci..

[24]  Julia Chuzhoy,et al.  On Approximating Maximum Independent Set of Rectangles , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[25]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[26]  Christos Faloutsos,et al.  Epidemic thresholds in real networks , 2008, TSEC.

[27]  Stefan Wuchty,et al.  Controllability in protein interaction networks , 2014, Proceedings of the National Academy of Sciences.

[28]  Raphael Yuster,et al.  Maximum Matching in Regular and Almost Regular Graphs , 2012, Algorithmica.

[29]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[30]  William Staton,et al.  Graphs with unique maximum independent sets , 1985, Discret. Math..

[31]  Zhongzhi Zhang,et al.  Spanning trees in a fractal scale-free lattice. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[33]  Tamás Vicsek,et al.  Controlling edge dynamics in complex networks , 2011, Nature Physics.

[34]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[35]  Hiroshi Nagamochi,et al.  Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs , 2013, Theor. Comput. Sci..

[36]  Stacy Patterson,et al.  Scale-Free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks , 2018, IEEE Transactions on Cybernetics.

[37]  Wing-Kai Hon,et al.  On maximum independent set of categorical product and ultimate categorical ratios of graphs , 2015, Theor. Comput. Sci..

[38]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[39]  Abdel-Rahman Hedar,et al.  Simulated annealing with stochastic local search for minimum dominating set problem , 2011, International Journal of Machine Learning and Cybernetics.

[40]  Michael Hinczewski,et al.  Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[42]  Kihong Park,et al.  On the hardness of optimization in power-law graphs , 2008, Theor. Comput. Sci..

[43]  Zhongzhi Zhang,et al.  Maximum matchings in scale-free networks with identical degree distribution , 2017, Theor. Comput. Sci..