Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability

Network control refers to a very large and diverse set of problems including controllability of linear time-invariant dynamical systems, where the objective is to select an appropriate input to steer the network to a desired state. There are many notions of controllability, one of them being structural controllability, which is intimately connected to finding maximum matchings on the underlying network topology. In this work, we study fast, scalable algorithms for finding maximum matchings for a large class of random networks. First, we illustrate that degree distribution random networks are realistic models for real networks in terms of structural controllability. Subsequently, we analyze a popular, fast, and practical heuristic due to Karp and Sipser as well as a simplification of it. For both heuristics, we establish asymptotic optimality and provide results concerning the asymptotic size of maximum matchings for an extensive class of random networks.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[2]  and Charles K. Taft Reswick,et al.  Introduction to Dynamic Systems , 1967 .

[3]  T. Kurtz.  Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[4]  Ching-tai Lin.  Structural controllability , 1974 .

[5]  Shimon Even,et al.  An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6]  Michael J. Magazine,et al.  A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[7]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[8]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[10]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[11]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[12]  T. R. Wansoo.  A concentration inequality for maximum matching size in random graphs , 1990 .

[13]  Alan M. Frieze,et al.  Maximum matchings in sparse random graphs: Karp-Sipser revisited , 1998, Random Struct. Algorithms.

[14]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[15]  John N. Tsitsiklis,et al.  The Complexity of Optimal Queuing Network Control , 1999, Math. Oper. Res..

[16]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[17]  José Niño-Mora,et al.  Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach , 2002, Math. Program..

[18]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[19]  Christian Commault,et al.  Characterization of generic properties of linear structured systems for efficient computations , 2002, Kybernetika.

[20]  F. Stokman,et al.  Evolution of sociology freshmen into a friendship network , 2003 .

[21]  Christian Commault,et al.  Generic properties and control of linear structured systems: a survey , 2003, Autom..

[22]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[23]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[24]  Gautam Choudhury,et al.  Optimal design and control of queues , 2005 .

[25]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[26]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[27]  Alan M. Frieze,et al.  Karp–Sipser on Random Graphs with a Fixed Degree Sequence , 2011, Combinatorics, Probability and Computing.

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

[29]  Noah J. Cowan,et al.  Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks , 2011, PloS one.

[30]  Alan M. Frieze,et al.  Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables , 2009, Random Struct. Algorithms.

[31]  Mehran Mesbahi,et al.  What Can Systems Theory of Networks Offer to Biology? , 2012, PLoS Comput. Biol..

[32]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[33]  Alexander Olshevsky,et al.  Minimal Controllability Problems , 2013, IEEE Transactions on Control of Network Systems.

[34]  Derek Ruths,et al.  Control Profiles of Complex Networks , 2014, Science.

[35]  Paul N. Balister,et al.  Controllability and matchings in random bipartite graphs , 2015, Surveys in Combinatorics.

[36]  S. Khanna,et al.  Complexity of the Minimum Input Selection Problem for Structural Controllability , 2015 .

[37]  Christian Commault,et al.  The single-input Minimal Controllability Problem for structured systems , 2015, Syst. Control. Lett..

[38]  Soummya Kar,et al.  A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems , 2013, IEEE Transactions on Automatic Control.

[39]  Terence Tao,et al.  Random matrices have simple spectrum , 2014, Comb..

[40]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.