Potential energy principles in networked systems and their connections to optimization problems on graphs
- 131 Downloads
We introduce the concepts of “gravitational” and “elastic” potential energy in the context of networks and investigate their implications on interpreting certain well-known graph-theoretic parameters and optimization problems. In the case of gravitational potential energy, we treat the nodes of a graph as “particles” with masses and consider the potential energy of gravitational interactions between them. We prove that the maximum clique in a graph represents the minimum gravitational potential energy structure. This result yields a natural physics-based interpretation of the well-known Motzkin-Strauss formulation for the maximum clique problem. In the case of elastic potential energy, we assume that graph nodes are located on an elastic surface, the graph edges represent “springs” connecting the nodes on the surface, and consider the potential energy corresponding to elastic deformations of springs. We show that under certain reasonable assumptions on surface deformation, the second-smallest and the largest eigenvalues of the graph Laplacian matrix correspond to the minimum and the maximum elastic potential energies of a graph, respectively. Moreover, the associated eigenvectors correspond to the node heights in the minimum and maximum energy configurations. Note that the second-smallest eigenvalue of the graph Laplacian is widely known as algebraic connectivity, and it turns out that this concept also has a simple and intuitive physics-based interpretation.
KeywordsNetworks Potential energy Graph theory Optimization Maximum clique Motzkin-strauss formulation Graph laplacian spectra Algebraic connectivity
This research was supported in part by the Air Force Research Laboratory (AFRL) and the Defense Threat Reduction Agency (DTRA). This material is based upon work supported by the AFRL Mathematical Modeling and Optimization Institute. The research was performed while the first author held a National Research Council Research Associateship Award at AFRL. The authors would like to thank the referees for the constructive comments that helped to improve the paper.
- 6.Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: handbook of combinatorial optimization, pp. 1–74. Kluwer (1999)Google Scholar
- 9.Chung, F.R.K.: Spectral graph theory (CBMS regional conference series in mathematics, No. 92). Am. Math. Soc. (1996).Google Scholar
- 16.Kobourov, S.G.: Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 (2012)
- 18.Matula, D.W.: On the complete subgraphs of a random graph. In: proceedings of the 2nd conference on combinatorial mathematics and its applications, pp. 356–369. University of North Carolina, Chapel Hill (1970)Google Scholar
- 20.Mohar, B.: Some applications of laplace eigenvalues of graphs. In: graph symmetry: algebraic methods and applications, vol. 497, of NATO ASI Series C, pp. 227–275. Kluwer (1997)Google Scholar
- 21.Mohar, B., Poljak, S.: Eigenvalues in combinatorial optimization. Springer (1993)Google Scholar
- 23.Newton, I.: Philosophiae naturalis principia mathematica (mathematical principles of natural philosophy). London (1687)Google Scholar
- 25.Petroski, H.: Invention by design: how engineers get from thought to thing. Harvard University Press (1996)Google Scholar
- 26.Prokopyev, O.A., Boginski, V.L., Chaovalitwongse, W., Pardalos, P.M., Sackellares, J.C., Carney, P.R.: Network-based techniques in eeg data analysis and epileptic brain modeling. In: data mining in biomedicine, pp. 559–573. Springer (2007)Google Scholar
- 27.Veremyev, A., Boginski, V.: Robustness and strong attack tolerance of low-diameter networks. In: A. Sorokin, R. Murphey, M.T. Thai, P.M. Pardalos (eds.) Dynamics of information systems: mathematical foundations, Springer proceedings in mathematics and statistics, vol. 20, pp. 137–156. Springer New York (2012)Google Scholar
- 28.Wasserman, S.: Social network analysis: methods and applications, vol. 8. Cambridge university press (1994)Google Scholar