Convex graph invariants

SIAM Review

Volumn 54, Issue 3, 2012, Pages 513-541

  Chandrasekaran, Venkat ^a   Parrilo, Pablo A ^b   Willsky, Alan S ^b  

^a California Institute of Technology   (United States)

^b Department of Electrical Engineering and Computer Science   (United States)

Author keywords

Convex optimization; Graph deconvolution; Graph hypothesis testing; Graph invariants; Graph sampling; Graphs; Majorization; Spectral invariants

Indexed keywords

GRAPH INVARIANT; GRAPHS; HYPOTHESIS TESTING; MAJORIZATION; SPECTRAL INVARIANTS;

CONVEX OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; SET THEORY; STRUCTURAL PROPERTIES;

GRAPHIC METHODS;

EID: 84865517496     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/100816900     Document Type: Review

References (42)

1. B. Ames and S. Vavasis, Nuclear norm minimization for the planted clique and biclique problems, Math. Program., 129 (2011), pp. 69-89.
2. B. Ames and S. Vavasis, Convex Optimization for the Planted k-Disjoint-Clique Problem, preprint, 2010. Available online from http://arxiv.org/abs/1008.2814.
3. N. Alon, R. Yuster, and U. Zwick, Color-coding, J. ACM, 42 (1995), pp. 844-856.
4. A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization, SIAM, Philadelphia, 2001.
5. D. Bertsimas and D. Brown, Constructing uncertainty sets for robust linear optimization, Oper. Res., 57 (2009), pp. 1483-1495.
6. N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, UK, 1994.
7. D. Bonchev, Chemical Graph Theory: Introduction and Fundamentals, Gordon and Breach, New York, 1991.
8. S. Boyd, Convex optimization of graph Laplacian eigenvalues, in Proceedings of the International Congress of Mathematicians, 3 (2006), pp. 1311-1319.
9. S. Boyd, P. Diaconis, and L. Xiao, Fastest mixing Markov chain on a graph, SIAM Rev., 46 (2004), pp. 667-689. (Pubitemid 40072140)
10. E. Çela, The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic, Dordrecht, The Netherlands, 1998.
11. V. Chandrasekaran, P. Parrilo, and A. Willsky, Graph Deconvolution via Semidefinite Programming, in preparation.
12. D. Davis, All convex invariants of Hermitian matrices, Arch. Math., 8 (1957), pp. 276-278.
13. E. de Klerk and R. Sotirov, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem, Math. Program., 122 (2010), pp. 225-246.
14. E. de Klerk and D. V. Pasechnik, Approximating the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
15. R. Diestel, Graph Theory, 3rd ed., Springer, Berlin, 2005.
16. R. Dobrin, Q. Beg, A. Barabasi, and Z. Oltvai, Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network, BMC Bioinform., 5 (2004).
17. J. Dodziuk, Difference equations, isoperimetric inequality and transience of certain random walks, Trans. Amer. Math. Soc., 284 (1984), pp. 787-794.
18. D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World, Cambridge University Press, Cambridge, UK, 2010.
19. G. Finke, R. Burkard, and F. Rendl, Quadratic Assignment Problems, Ann. Discrete Math., 31 (1987), pp. 61-82.
20. A. Ghosh and S. Boyd, Growing well-connected graphs, in Proceedings of the IEEE Conference on Decision and Control, 2006, pp. 6605-6611.
21. C. Godsil and G. Royle, Algebraic Graph Theory, Springer, New York, 2004.
22. M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
23. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750. (Pubitemid 128488791)
24. S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bull. Amer. Math. Soc., 43 (2006), pp. 439-561. (Pubitemid 44448254)
25. M. Jackson, Social and Economic Networks, Princeton University Press, Princeton, NJ, 2008.
26. J. Kleinberg and E.́ Tardos, Balanced outcomes in social exchange networks, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, pp. 295-304.
27. S. L. Lauritzen, Graphical Models, Oxford University Press, New York, 1996.
28. A. Lewis, The convex analysis of unitarily invariant matrix functions, J. Convex Anal., 2 (1995), pp. 173-183.
29. J. Löfberg, YALMIP: A toolbox for modeling and optimization in MATLAB, in Proceedings of the CACSD Conference, Taiwan, 2004. Available online from http://users.isy.liu.se/johanl/yalmip.
30. L. Lovasz, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
31. A. Marshall and I. Olkin, Inequalities: Theory of Majorizations and Its Applications, Academic Press, New York, 1979.
32. O. Mason and M. Verwoerd, Graph theory and networks in biology, IET Syst. Biol., 1 (2007), pp. 89-119. (Pubitemid 46488242)
33. T. Motzkin and E. Straus, Maxima for graphs and a new proof of a theorem of Turan, Canad. J. Math., 17 (1965), pp. 533-540.
34. F. Rendl and R. Sotirov, Bounds for the quadratic assignment problem using the bundle method, Math. Program., 109 (2007), pp. 505-524. (Pubitemid 46197865)
35. N. Robertson and P. Seymour, Graph minors III: Planar tree-width, J. Combin. Theory Ser. B, 36 (1984), pp. 49-64.
36. R. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
37. R. Rockafellar and S. Uryasev, Optimization of conditional value-at-risk, J. Risk, 2 (2000), pp. 21-41.
38. W. Rudin, Real and Complex Analysis, McGraw-Hill, New York, 1996.
39. K. Toh, M. Todd, and R. Tutuncu, SDPT3: A MATLAB Software Package for Semidefinite- Quadratic-Linear Programming. Available online from http://www.math.nus.edu. sg/&mattohkc/sdpt3.html.
40. G. A. Watson, Characterization of the subdifferential of some matrix norms, Linear Algebra Appl., 170 (1992), pp. 1039-1053.
41. Q. Zhao, S. Karisch, F. Rendl, and H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, J. Comb. Optim., 2 (1998), pp. 71-109. (Pubitemid 128512852)
42. G. Ziegler, Lectures on Polytopes, Springer, New York, 1995.