Convex Graph Invariants

Convex Graph Invariants

Venkat Chandrasekaran, Pablo A. Parrilo, and Alan S. Willsky
Laboratory for Information and Decision Systems
Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology
Cambridge, MA 02139 USA
Email: {venkatc,parrilo,willsky}@mit.edu. This work was supported in part by AFOSR grant FA9550-08-1-0180, in part by a MURI through ARO grant W911NF-06-1-0076, in part by a MURI through AFOSR grant FA9550-06-1-0303, and in part by NSF FRG 0757207.
July 5, 2019
Abstract

The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples include functions of a graph such as the maximum degree, the MAXCUT value (and its semidefinite relaxation), and spectral invariants such as the sum of the largest eigenvalues. Such functions can be used to construct convex sets that impose various structural constraints on graphs, and thus provide a unified framework for solving a number of interesting graph problems via convex optimization. We give a representation of all convex graph invariants in terms of certain elementary invariants, and describe methods to compute or approximate convex graph invariants tractably. We also compare convex and non-convex invariants, and discuss connections to robust optimization. Finally we use convex graph invariants to provide efficient convex programming solutions to graph problems such as the deconvolution of the composition of two graphs into the individual components, hypothesis testing between graph families, and the generation of graphs with certain desired structural properties.

Keywords: Graphs; graph invariants; convex optimization; spectral invariants; majorization; robust optimization; graph deconvolution; graph sampling; graph hypothesis testing

1 Introduction

Graphs are useful in many applications throughout science and engineering as they offer a concise model for relationships among a large number of interacting entities. These relationships are often best understood using structural properties of graphs. Graph invariants play an important role in characterizing abstract structural features of a graph, as they do not depend on the labeling of the nodes of the graph. Indeed families of graphs that share common structural attributes are often specified via graph invariants. For example bipartite graphs can be defined by the property that they contain no cycles of odd length, while the family of regular graphs consists of graphs in which all nodes have the same degree. Such descriptions of classes of graphs in terms of invariants have found applications in areas as varied as combinatorics [15], network analysis in chemistry [8] and in biology [31], and in machine learning [27]. For instance the treewidth [34] of a graph is a basic invariant that governs the complexity of various algorithms for graph problems.

We begin by introducing three canonical problems involving structural properties of graphs, and the development of a unified solution framework to address these questions serves as motivation for our discussion throughout this paper.

• Graph deconvolution. Suppose we are given a graph that is the combination of two known graphs overlaid on the same set of nodes. How do we recover the individual components from the composite graph? For example in Figure 1 we are given a composite graph that is formed by adding a cycle and the Clebsch graph. Given no extra knowledge of any labeling of the nodes, can we “deconvolve” the composite graph into the individual cycle/Clebsch graph components?

• Graph generation. Given certain structural constraints specified by invariants how do we produce a graph that satisfies these constraints? A well-studied example is the question of constructing expander graphs. Another example may be that we wish to recover a graph given constraints, for instance, on certain subgraphs being forbidden, on the degree distribution, and on the spectral distribution.

• Graph hypothesis testing. Suppose we have two families of graphs, each characterized by some common structural properties specified by a set of invariants; given a new sample graph which of the two families offers a “better explanation” of the sample graph (see Figure 2)?

In Section 2 we describe these problems in more detail, and also give some concrete applications in network analysis and modeling in which such questions are of interest.

To efficiently solve problems such as these we wish to develop a collection of tractable computational tools. Convex relaxation techniques offer a candidate framework as they possess numerous favorable properties. Due to their powerful modeling capabilities, convex optimization methods can provide tractable formulations for solving difficult combinatorial problems exactly or approximately. Further convex programs may often be solved effectively using general-purpose off-the-shelf software. Finally one can also give conditions for the success of these convex relaxations based on standard optimality results from convex analysis.

Motivated by these considerations we introduce and study convex graph invariants in Section 3. These invariants are convex functions of the adjacency matrix of a graph. More formally letting denote the adjacency matrix of a (weighted) graph, a convex graph invariant is a convex function such that for all permutation matrices . Examples include functions of a graph such as the maximum degree, the MAXCUT value (and its semidefinite relaxation), the second smallest eigenvalue of the Laplacian (a concave invariant), and spectral invariants such as the sum of the largest eigenvalues; see Section 3.3 for a more comprehensive list. As some of these invariants may possibly be hard to compute, we discuss in the sequel the question of approximating intractable convex invariants. We also study invariant convex sets, which are convex sets with the property that a symmetric matrix is a member of such a set if and only if is also a member of the set for all permutations . Such convex sets are useful in order to impose various structural constraints on graphs. For example invariant convex sets can be used to express forbidden subgraph constraints (i.e., that a graph does not contain a particular subgraph such as a triangle), or require that a graph be connected; see Section 3.4 for more examples. We compare the strengths and weaknesses of convex graph invariants versus more general non-convex graph invariants. Finally we also provide a robust optimization perspective of invariant convex sets. In particular we make connections between our work and the data-driven perspective on robust optimization studied in [6].

In order to systematically evaluate the expressive power of convex graph invariants we analyze elementary convex graph invariants, which serve as a basis for constructing arbitrary convex invariants. Given a symmetric matrix , these elementary invariants (again, possibly hard to compute depending on the choice of ) are defined as follows:

 ΘP(A)=maxΠTr(PΠAΠT), (1)

where represents the adjacency matrix of a graph, and the maximum is taken over all permutation matrices . It is clear that is a convex graph invariant, because it is expressed as the maximum over a set of linear functions. Indeed several simple convex graph invariants can be expressed using functions of the form (1). For example gives us the total sum of the node weights, while gives us twice the total (weighted) degree. Our main theoretical results in Section 3 can be summarized as follows: First we give a representation theorem stating that any convex graph invariant can be expressed as the supremum over elementary convex graph invariants (1) (see Theorem 3.4). Second we have a similar result stating that any invariant convex set can be expressed as the intersection of convex sets given by level sets of the elementary invariants (1) (see Proposition 3.6). These results follow as a consequence of the separation theorem from convex analysis. Finally we also show that for any two non-isomorphic graphs given by adjacency matrices and , there exists a such that (see Lemma 3.10). Hence convex graph invariants offer a complete set of invariants as they can distinguish between non-isomorphic graphs.

In Section 3.7 we discuss an important subclass of convex graph invariants, namely the set of convex spectral invariants. These are convex functions of symmetric matrices that depend only on the eigenvalues, and can equivalently be expressed as the set of convex functions of symmetric matrices that are invariant under conjugation by orthogonal matrices (note that convex graph invariants are only required to be invariant with respect to conjugation by permutation matrices) [13]. The properties of convex spectral invariants are well-understood, and they are useful in a number of practically relevant problems (e.g., characterizing the subdifferential of a unitarily invariant matrix norm [39]). These invariants play a prominent role in our experimental demonstrations in Section 5.

As noted above convex graph invariants, and even elementary invariants, may in general be hard to compute. In Section 4 we investigate the question of approximately computing these invariants in a tractable manner. For many interesting special cases such as the MAXCUT value of a graph, or (the inverse of) the stability number, there exist well-known tractable semidefinite programming (SDP) relaxations that can be used as surrogates instead [22, 32]. More generally functions of the form of our elementary convex invariants (1) have appeared previously in the literature; see [11] for a survey. Specifically we note that evaluating the function for any fixed is equivalent to solving the so-called Quadratic Assignment Problem (QAP), and thus we can employ various tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group symmetry in SDP relaxations of QAP, which is useful for approximately computing elementary convex graph invariants in many interesting cases.

Finally in Section 5 we return to the motivating problems described previously, and give solutions to these questions. These solutions are based on convex programming formulations, with convex graph invariants playing a fundamental role. We give theoretical conditions for the success of these convex formulations in solving the problems discussed above, and experimental demonstration for their effectiveness in practice. Indeed the framework provided by convex graph invariants allows for a unified investigation of our proposed solutions. As an example result we give a tractable convex program (in fact an SDP) in Section 5.2 to “deconvolve” the cycle and the Clebsch graph from a composite graph consisting of these components (see Figure 1); a salient feature of this convex program is that it only uses spectral invariants to perform the decomposition.

Summary of contributions

We emphasize again the main contributions of this paper. We begin by introducing three canonical problems involving structural properties of graphs. These problems arise in various applications (see Section 2), and serve as a motivation for our discussion in this paper. In order to solve these problems we introduce convex graph invariants, and investigate their properties (see Section 3). Specifically we provide a representation theorem of convex graph invariants in terms of elementary invariants, and we make connections between these ideas and concepts from other areas such as robust optimization. Finally we describe tractable convex programming solutions to the motivating problems based on convex graph invariants (see Section 5). Therefore, convex graph invariants provide a useful computational framework based on convex optimization for graph problems.

Related previous work

We note that convex optimization methods have been used previously to solve various graph-related problems. We would particularly like to emphasize a body of work on convex programming formulations to optimize convex functions of the Laplacian eigenvalues of graphs [10, 9] subject to various constraints. Although our objective is similar in that we seek solutions based on convex optimization to graph problems, our work is different in several respects from these previous approaches. While the problems discussed in [9] explicitly involved the optimization of spectral functions, other graph problems such as those described in Section 2 may require non-spectral approaches (for example, hypothesis testing between two families of graphs that are isospectral, i.e., have the same spectrum, but are distinguished by other structural properties). As convex spectral invariants form a subset of convex graph invariants, the framework proposed in this paper offers a larger suite of convex programming methods for graph problems. More broadly our work is the first to formally introduce and characterize convex graph invariants, and to investigate their properties as natural mathematical objects of independent interest.

Outline

In Section 2 we give more details of the questions that motivate our study of convex graph invariants. Section 3 gives the definition of convex graph invariants and invariant convex sets, as well as several examples of these such functions and sets. We also discuss various properties of convex graph invariants in this section. In Section 4 we investigate the question of efficiently computing approximations to intractable convex graph invariants. We give detailed solutions using convex graph invariants to each of our motivating problems in Section 5, and we conclude with a brief discussion in Section 6.

2 Applications

In this section we describe three problems involving structural properties of graphs, which serve as a motivation for our investigation of convex graph invariants. In Section 5 we give solutions to these problems using convex graph invariants.

2.1 Graph Deconvolution

Suppose we are given a graph that is formed by overlaying two graphs on the same set of nodes. More formally we have a graph whose adjacency matrix is formed by adding the adjacency matrices of two known graphs. However, we do not have any information about the relative labeling of the nodes in the two component graphs. Can we recover the individual components from the composite graph? As an example suppose we are given the combination of a cycle and a grid, or a cycle and the Clebsch graph, on the same set of nodes. Without any additional information about the labeling of the nodes, which may reveal the cycle/grid or cycle/Clebsch graph structure, the goal is to recover the individual components. Figure 1 gives a graphical illustration of this question. In general such decomposition problems may be ill-posed, and it is of interest to give conditions under which unique deconvolution is possible as well as to provide tractable computational methods to recover the individual components. In Section 5.2 we describe an approach based on convex optimization for graph deconvolution; for example this method decomposes the cycle and the Clebsch graph from a composite graph consisting of these components (see Figure 1) using only the spectral properties of the two graphs.

Well-known problems that have the flavor of graph deconvolution include the planted clique problem, which involves identifying hidden cliques embedded inside a larger graph, and the clustering problem in which the goal is to decompose a large graph into smaller densely connected clusters by removing just a few edges. Convex optimization approaches for solving such problems have been proposed recently [1, 2]. Graph deconvolution more generally may include other kinds of embedded structures beyond cliques.

Applications of graph deconvolution arise in network analysis in which one seeks to better understand a complex network by decomposing it into simpler components. Graphs play an important role in modeling, for example, biological networks [31] and social networks [25, 18], and lead to natural graph deconvolution problems in these areas. For instance graphs are useful for describing social exchange networks of interactions of multiple agents, and graph decompositions are useful for describing the structure of optimal bargaining solutions in such networks [26]. In a biological network setting, transcriptional regulatory networks of bacteria have been observed to consist of small subgraphs with specific structure (called motifs) that are connected together using a “backbone” [16]. Decomposing such regulatory networks into the component structures is useful for obtaining a better understanding of the high-level properties of the composite network.

2.2 Generating Graphs with Desired Structural Properties

Suppose we wish to construct a graph with certain prescribed structural constraints. A very simple example may be the problem of constructing a graph in which each node has degree equal to two. A graph given by a single cycle satisfies this constraint. A less trivial problem is one in which the objective may be to build a connected graph with constraints on the spectrum of the adjacency matrix, the degree distribution, and the additional requirements that the graph be triangle-free and square-free. Of course such graph reconstruction problems may be infeasible in general, as there may be no graph consistent with the given constraints. Therefore it is of interest to derive suitable conditions under which this problem may be well-posed, and to develop a suitably flexible yet tractable computational framework to incorporate any structural information available about a graph.

A prominent instance of a graph construction problem that has received much attention is the question of generating expander graphs [24]. Expanders are, roughly speaking, sparse graphs that are well-connected, and they have found applications in numerous areas of computer science. Methods used to construct expanders range from random sampling approaches to deterministic constructions based on Ramanujan graphs [24]. In Section 5.3 we describe an approach based on convex optimization to generate sparse, weighted graphs with small degree and large spectral gap.

2.3 Graph Hypothesis Testing

As our third problem we consider a more statistically motivated question. Suppose we have two families of graphs each characterized by some common structural properties specified by certain invariants. Given a new sample graph which of these two families offers a “better explanation” for the sample graph? For example as illustrated in Figure 2 we may have two families of graphs – one being the collection of cycles, and the other being the set of sparse, well-connected graphs. If a new sample graph is a path (i.e., a cycle with an edge removed), we would expect that the family of cycles should be a better explanation. On the other hand if the sample is a cycle plus some edges connecting diametrically opposite nodes, then the second family of sparse, well-connected graphs offers a more plausible fit. Notice that these classes of graphs may often be specified in terms of different sets of invariants, and it is of interest to develop a suitable framework in which we can incorporate diverse structural information provided about graph families.

We differentiate this problem from the well-studied question of testing properties of graphs [23]. Examples of property testing include testing whether a graph is -colorable, or whether it is close to being bipartite. An important goal in property testing is that one wishes to test for graph properties by only making a small number of “queries” of a graph. We do not explicitly seek such an objective in our algorithms for hypothesis testing. We also note that hypothesis testing can be posed more generally than a yes/no question as in property testing, and as mentioned above the two families in hypothesis testing may be specified in terms of very different sets of invariants.

In order to address the hypothesis testing question in a statistical framework, we would need a statistical theory for graphs and appropriate error metrics with respect to which one could devise optimal decision rules. In Section 5.4 we discuss a computational approach to the hypothesis testing problem using convex graph invariants that gives good empirical performance, and we defer the issue of developing a formal statistical framework to future work.

3 Convex Graph Invariants

In this section we define convex graph invariants, and discuss their properties. Throughout this paper we denote the space of symmetric matrices by . All our definitions of convexity are with respect to the space . We consider undirected graphs that do not have multiple edges and no self-loops; these are represented by adjacency matrices that lie in . Therefore a graph may possibly have node weights and edge weights. A graph is said to be unweighted if its node weights are zero, and if each edge has a weight of one (non-edges have a weight of zero); otherwise a graph is said to be weighted. Let denote the vector with a one in the ’th entry and zero elsewhere, let denote the identity matrix, let denote the all-ones vector, and let denote the all-ones matrix. Further we let ; we will sometimes find it useful in our examples in Section 3.4 to restrict our attention to graphs with adjacency matrices in . Next let denote the symmetric group over elements, i.e., the group of permutations of elements. Elements of this group are represented by permutation matrices. Let represent the orthogonal group of orthogonal matrices. Finally given a vector we let denote the vector obtained by sorting the entries of in descending order.

3.1 Motivation: Graphs and Adjacency Matrices

Matrix representations of graphs in terms of adjacency matrices and Laplacians have been used widely both in applications as well as in the analysis of the structure of graphs based on algebraic properties of these matrices [7]. For example the spectrum of the Laplacian of a graph reveals whether a graph is “diffusive” [24], or whether it is even connected. The degree sequence, which may be obtained from the adjacency matrix or the Laplacian, reveals whether a graph is regular, and it plays a role in a number of real-world investigations of graphs arising in social networks and the Internet.

Given a graph defined on nodes, a labeling of the nodes of is a function that maps the nodes of onto distinct integers in . An adjacency matrix is then said to represent or specify if there exists a labeling of the nodes of so that the weight of the edge between nodes and equals for all pairs and the weight of node equals for all . However an adjacency matrix representation of the graph is not unique. In particular also specifies for all . All these alternative adjacency matrices correspond to different labelings of the nodes of . Thus the graph is specified by the matrix only up to a relabeling of the indices of . Our objective is to describe abstract structural properties of that do not depend on a choice of labeling of the nodes. In order to characterize such unlabeled graphs in which the nodes have no distinct identity except through their connections to other nodes, it is important that any function of an adjacency matrix representation of a graph not depend on the particular choice of indices of . Therefore we seek functions of adjacency matrices that are invariant under conjugation by permutation matrices, and denote such functions as graph invariants.

3.2 Definition of Convex Invariants

A convex graph invariant is an invariant that is a convex function of the adjacency matrix of a graph. Specifically we have the following definition:

Definition 3.1.

A function is a convex graph invariant if it is convex, and if for any it holds that for all permutation matrices .

Thus convex graph invariants are convex functions that are constant over orbits of the symmetric group acting on symmetric matrices by conjugation. As described above the motivation behind the invariance property is clear. The motivation behind the convexity property is that we wish to construct solutions based on convex programming formulations in order to solve problems such as those listed in Section 2. We present several examples of convex graph invariants in Section 3.3. We note that a concave graph invariant is a real-valued function over that is the negative of a convex graph invariant.

We also consider invariant convex sets, which are defined in an analogous manner to convex graph invariants:

Definition 3.2.

A set is said to be an invariant convex set if it is convex and if for any it is the case that for all permutation matrices .

In Section 3.4 we present examples in which graphs can be constrained to have various properties by requiring that adjacency matrices belong to such convex invariant sets. We also make connections between robust optimization and invariant convex sets in Section 3.6.

In order to systematically study convex graph invariants, we analyze certain elementary invariants that serve as a basis for constructing arbitrary convex invariants. These elementary invariants are defined as follows:

Definition 3.3.

An elementary convex graph invariant is a function of the form

 ΘP(A)=maxΠ∈Sym(n)Tr(PΠAΠT),

for any .

It is clear that an elementary invariant is also a convex graph invariant, as it is expressed as the maximum over a set of convex functions (in fact linear functions). We describe various properties of convex graph invariants in Sections 3.5. One useful construction that we give is the expression of arbitrary convex graph invariants as suprema over elementary invariants. We also discuss convex spectral invariants in Section 3.7, which are convex functions of a symmetric matrix that depend purely on its spectrum. Finally an important point is that convex graph invariants may in general be hard to compute. In Section 4 we discuss this problem and propose further tractable convex relaxations for cases in which a convex graph invariant may be intractable to compute.

In the Appendix we describe convex functions defined on that are invariant with respect to any permutation of the argument. Such functions have been analyzed previously, and we provide a list of their well-known properties. We contrast these properties with those of convex graph invariants throughout the rest of this section.

3.3 Examples of Convex Graph Invariants

We list several examples of convex graph invariants. As mentioned previously some of these invariants may possibly be difficult to compute, but we defer discussion of computational issues to Section 4. A useful property that we exploit in several of these examples is that a function defined as the supremum over a set of convex functions is itself convex [35].

Number of edges. The total number of edges (or sum of edge weights) is an elementary convex graph invariant with .

Node weight. The maximum node weight of a graph, which corresponds to the maximum diagonal entry of the adjacency matrix of the graph, is an elementary convex graph invariant with . The maximum diagonal entry in magnitude of an adjacency matrix is a convex graph invariant, and can be expressed as follows with :

 max. node weight(A)=max{ΘP(A),Θ−P(A)}.

Similarly the sum of all the node weights, which is the sum of the diagonal entries of an adjacency matrix of a graph, can be expressed as an elementary convex graph invariant with being the identity matrix.

Maximum degree. The maximum (weighted) degree of a node of a graph is also an elementary convex graph invariant with , and all the other entries of set to zero.

Largest cut. The value of the largest weighted cut of a graph specified by an adjacency matrix can be written as follows:

 max. cut(A)=maxy∈{−1,+1}n 14∑i,jAi,j(1−yiyj).

As this function is a maximum over a set of linear functions, it is a convex function of . Further it is also clear that for all permutation matrices . Consequently the value of the largest cut of a graph is a convex graph invariant. We note here that computing this invariant is intractable in general. In practice one could instead employ the following well-known tractable SDP relaxation [22], which is related to the MAXCUT value by an appropriate shift and rescaling:

 f(A)=minX∈Sn Tr(XA) (2) s.t. Xii=1, ∀i X⪰0.

As this relaxation is expressed as the minimum over a set of linear functions, it is a concave graph invariant. In Section 4.2 we discuss in greater detail tractable relaxations for invariants that are difficult to compute.

Isoperimetric number (Cheeger constant). The isoperimetric number, also known as the Cheeger constant [17], of a graph specified by adjacency matrix is defined as follows:

 isoperimetric number(A)=minU⊂{1,…,n},|U|≤n2,y∈Rn,yU=1,yUc=−1  ∑i,j Ai,j(1−yiyj)4|U|.

Here denotes the complement of the set , and is the subset of the entries of the vector indexed by . As with the last example, it is again clear that this function is a concave graph invariant as it is expressed as the minimum over a set of linear functions. In particular it can be viewed as measuring the value of a “normalized” cut, and plays an important role in several aspects of graph theory [24].

Degree sequence invariants. Given a graph specified by adjacency matrix (assume for simplicity that the node weights are zero), the weighted degree sequence is given by the vector , i.e., the vector obtained by sorting the entries of in descending order. It is easily seen that is a graph invariant. Consequently any function of is also a graph invariant. However our interest is in obtaining convex functions of the adjacency matrix . An important class of functions of that are convex functions of , and therefore are convex graph invariants, are of the form:

 f(A)=vTd(A),

for such that . This function can also be expressed as the maximum over all permutations of the inner-product . As described in the Appendix such linear monotone functionals can be used to express all convex functions over that are invariant with respect to permutations of the argument. Consequently these monotone functions serve as building blocks for constructing all convex graph invariants that are functions of .

Spectral invariants. Let the eigenvalues of the adjacency matrix of a graph be denoted as , and let . These eigenvalues form the spectrum of the graph specified by , and clearly remain unchanged under transformations of the form for any orthogonal matrix (and therefore for any permutation matrix). Hence any function of the spectrum of a graph is a graph invariant. Analogous to the previous example, an important class of spectral functions that are also convex are of the form:

 f(A)=vTλ(A),

for such that . We denote spectral invariants that are also convex functions as convex spectral invariants. As with convex invariants of the degree sequence, all convex spectral invariants can be constructed using monotone functions of the type described here (see the Appendix).

Second-smallest eigenvalue of Laplacian. This example is only meaningful for weighted graphs in which the node and edge weights are non-negative. For such a graph specified by adjacency matrix , let , where takes as input a vector and forms a diagonal matrix with the entries of the vector on the diagonal. The Laplacian of a graph is then defined as follows:

 LA=DA−A.

If consists of nonnegative entries, then . In this setting we denote the eigenvalues of as . It is easily seen that as the all-ones vector lies in the kernel of . The second-smallest eigenvalue of the Laplacian is a concave invariant function of . It plays an important role as the graph specified by is connected if and only if .

Inverse of Stability Number. A stable set of an unweighted graph is a subset of the nodes of such that no two nodes in the subset are adjacent. The stability number is the size of the largest stable set of , and is denoted by . By a result of Motzkin and Straus [32], the inverse of the stability number can be written as follows:

 1α(G)=minx xT(I+A)x (3) s.t. xi≥0, ∀i,   ∑ixi=1.

Here is any adjacency matrix representing the graph . Although this formulation is for unweighted graphs with edge weights being either one or zero, we note that the definition can in fact be extended to all weighted graphs, i.e., for graphs with adjacency matrix given by any . Consequently, the inverse of this extended stability number of a graph is a concave graph invariant over as it is expressed as the minimum over a set of linear functions. As this function is difficult to compute in general (because the stability number of a graph is intractable to compute), one could employ the following tractable relaxation:

 f(A)=minX∈Sn Tr(X(I+A)) (4) s.t. X≥0,   X⪰0,   1TX1=1.

This relaxation is also a concave graph invariant as it is expressed as the minimum over a set of affine functions.

3.4 Examples of Invariant Convex Sets

Next we provide examples of invariant convex sets. As described below constraints expressed using such sets are useful in order to require that graphs have certain properties. Note that a sublevel set for any convex graph invariant is an invariant convex set. Therefore all the examples of convex graph invariants given above can be used to construct invariant convex set constraints.

Algebraic connectivity and diffusion. As mentioned in Section 3.3 a graph represented by adjacency matrix has the property that the second-smallest eigenvalue of the Laplacian of the graph is a concave graph invariant. The constraint set for any expresses the property that a graph must be connected. Further if we set to be relatively large, we can require that a graph has good diffusion properties.

Largest clique constraint. Let denote the adjacency matrix of an unweighted -clique. Note that is only nonzero within a submatrix, and is zero-padded to lie in . Consider the following invariant convex set for :

 {A:A∈A, ΘKk(A)≤(k2−k)−ϵ}.

This constraint set expresses the property that a graph cannot have a clique of size (or larger), with the edge weights of all edges in the clique being close to one. For example we can use this constraint set to require that a graph has no triangles (with large edge weights). It is important to note that triangles (and cliques more generally) are forbidden only with the qualification that all the edge weights in the triangle cannot be close to one. For example a graph may contain a triangle with each edge having weight equal to . In this case the function evaluates to , which is much smaller than the maximum value of that can take for matrices in that contain a triangle with edge weights equal to one.

Girth constraint. The girth of a graph is the length of the shortest cycle. Let denote the adjacency matrix of an unweighted -cycle for . As with the -clique note that is nonzero only within a submatrix, and is zero-padded so that it lies in . In order to express the property that a graph has no small cycles, consider the following invariant convex set for :

 {A:A∈A, ΘCk(A)≤2k−ϵ ∀k≤k0}.

Graphs belonging to this set cannot have cycles of length less than or equal to , with the weights of edges in the cycle being close to one. Thus we can impose a lower bound on a weighted version of the girth of a graph.

Forbidden subgraph constraint. The previous two examples can be viewed as special cases of a more general constraint involving forbidden subgraphs. Specifically let denote the adjacency matrix of an unweighted graph on nodes that consists of edges. As before is zero-padded to ensure that it lies in . Consider the following invariant convex set for :

 {A:A∈A, ΘAk(A)≤2Ek−ϵ}.

This constraint set requires that a graph not contain the subgraph given by the adjacency matrix , with edge weights close to one.

Degree distribution. Using the notation described previously, let denote the sorted degree sequence () of a graph specified by adjacency matrix . We wish to consider the set of all graphs that have degree sequence . This set is in general not convex unless represents a (weighted) regular graph, i.e., for some constant . Therefore we consider the convex hull of all graphs that have degree sequence given by :

 D(A)=conv{B:B∈Sn, ¯¯¯¯¯¯¯B1=d(A)}.

This set is in fact tractable to represent, and is given by the set of graphs whose degree sequence is majorized by :

 D(A)={B:B∈Sn, 1TB1=1Td(A), k∑i=1(¯¯¯¯¯¯¯B1)i≤k∑i=1d(A)i ∀k=1,…,n−1}.

By the majorization principle [5] another representation for this convex set is as the set of graphs whose degree sequence lies in the permutahedron generated by [41]; the permutahedron generated by a vector is the convex hull of all permutations of the vector. The notion of majorization is sometimes also referred to as Lorenz dominance (see the Appendix for more details).

Spectral distribution. Let denote the spectrum of a graph represented by adjacency matrix . As before we are interested in the set of all graphs that have spectrum . This set is nonconvex in general, unless is a multiple of the identity matrix in which case all the eigenvalues are the same. Therefore we consider the convex hull of all graphs (i.e., symmetric adjacency matrices) that have spectrum equal to :

 E(A)=conv{B:B∈Sn, λ(B)=λ(A)}.

This convex hull also has a tractable semidefinite representation analogous to the description above [5]:

 E(A)={B:B∈Sn, Tr(B)=Tr(A), k∑i=1λ(B)i≤k∑i=1λ(A)i ∀k=1,…,n−1}.

Note that eigenvalues are specified in descending order, so that represents the sum of the -largest eigenvalues of .

3.5 Representation of Convex Graph Invariants

All invariant convex sets and convex graph invariants can be represented using elementary convex graph invariants. In this section we describe both these representation results. Representation theorems in mathematics give expressions of complicated sets or functions in terms of simpler, basic objects. In functional analysis the Riesz representation theorem relates elements in a Hilbert space and its dual, by uniquely associating each element of the Hilbert space to a linear functional [37]. In probability theory de Finetti’s theorem states that a collection of exchangeable random variables can be expressed as a mixture of independent, identically distributed random variables. In convex analysis every closed convex set can be expressed as the intersection of halfspaces [35]. In each of these cases representation theorems provide a powerful analysis tool as they give a canonical expression for complicated mathematical objects in terms of elementary sets/functions.

First we give a representation result for convex graph invariants. In order to get a flavor of this result consider the maximum absolute-value node weight invariant of Section 3.3, which is represented as the supremum over two elementary convex graph invariants. The following theorem states that in fact any convex graph invariant can be expressed as a supremum over elementary invariants:

Theorem 3.4.

Let be any convex graph invariant. Then can be expressed as follows:

 f(A)=supP∈P ΘP(A)−αP,

for and for some subset .

Proof.

Since is a convex function, it can be expressed as the supremum over linear functionals as follows:

 f(A)=supP∈P⊆Sn Tr(PA)−αP,

for . This conclusion follows directly from the separation theorem in convex analysis [35]; in particular this description of the convex function can be viewed as a specification in terms of supporting hyperplanes of the epigraph of , which is a convex subset of . However as is also a graph invariant, we have that for any permutation and for all . Consequently for any permutation and for any ,

 f(A)=f(ΠAΠT)≥Tr(PΠAΠT)−αP.

Thus we have that

 f(A)≥supP∈P ΘP(A)−αP. (5)

However it also clear that for each

 ΘP(A)−αP≥Tr(PA)−αP,

which allows us to conclude that

 supP∈P ΘP(A)−αP≥supP∈P Tr(PA)−αP=f(A). (6)

Combining equations (5) and (6) we have the desired result. ∎

Remark 3.5.

This result can be strengthened in the sense that one need only consider elements in that lie in different equivalence classes up to conjugation by permutation matrices . In each equivalence class the representative functional is the one with the smallest value of . This idea can be formalized as follows. Consider the group action that conjugates elements in by a permutation matrix in . With this notation we may restrict our attention in Theorem 3.4 to , where represents the quotient space under the group action . Such a mathematical object obtained by taking the quotient of a Euclidean space (or more generally a smooth manifold) under the action of a finite group is called an orbifold. With this strengthening one can show that there exists a unique, minimal representation set . We however do not emphasize such refinements in subsequent results, and stick with the weaker statement that for notational and conceptual simplicity.

As our next result we show that any invariant convex set can be represented as the intersection of sublevel sets of elementary convex graph invariants:

Proposition 3.6.

Let be an invariant convex set. Then there exists a representation of as follows:

 S=⋂P∈P {A:A∈Sn, ΘP(A)≤αP},

for some and for .

Proof.

The proof of this statement proceeds in an analogous manner to that of Theorem 3.4, and is again essentially a consequence of the separation theorem in convex analysis. ∎

3.6 A Robust Optimization View of Invariant Convex Sets

Uncertainty arises in many real-world problems. An important goal in robust optimization (see [4] and the reference therein) is to translate formal notions of measures of uncertainty into convex constraint sets. Convexity is important in order to obtain optimization formulations that are tractable.

The representation of a graph via an adjacency matrix in is inherently uncertain as we have no information about the specific labeling of the nodes of the graph. In this section we associate to each graph a convex polytope, which represents the best convex uncertainty set given a graph:

Definition 3.7.

Let be a graph that is represented by an adjacency matrix (any choice of representation is suitable). The convex hull of the graph is defined as the following convex polytope:

 C(G)=conv{ΠAΠT:Π∈Sym(n)}.

Recall that is the symmetric group of permutation matrices. One can check that the convex hull of a graph is an invariant convex set, and that its extreme points are the matrices for all . Note that this convex hull may in general be intractable to characterize; if these polytopes were tractable to characterize we would be able to solve the graph isomorphism problem in polynomial time.

The convex hull of a graph is the smallest convex set that contains all the adjacency matrices that represent the graph. Therefore is in some sense the “best convex characterization” of the graph . This notion is related to the concept of risk measures studied in [3], and the construction of convex uncertainty sets based on these risk measures studied in [6]. In particular we recall the following definition from [6]:

Definition 3.8.

Let be any finite collection of elements with . Let be a probability distribution, i.e., and . Then the -permutohull is the polytope in defined as follows:

 Bq(Z)=conv{∑i(Πq)iZi:Π∈Sym(k)}.

Convex uncertainty sets given by permutohulls emphasize a data-driven view of robust optimization as adopted in [6]. Specifically the only information available about an uncertain set in many settings is a finite collection of data vectors , and the probability distribution expresses preferences over such an unordered data set. Therefore given a data set and a probability distribution that quantifies uncertainty with respect to elements of this data set, the -permutohull is the smallest convex set expressing these uncertainty preferences. We note that an important property of a permutohull is that it is invariant with respect to relabeling of the data vectors in .

The convex hull of a graph is a simple example of a permutohull , with the distribution being and the set where represents the graph . More complicated permutohulls of graphs may be of interest in several applications but we do not pursue these generalizations here, and instead focus on the case of the convex hull of a graph as defined above.

The convex hull of a graph is itself an invariant convex set by definition. Therefore we can appeal to Proposition 3.6 to give a representation of this set in terms of sublevel sets of elementary convex graph invariants. As our next result we show that the values of all elementary convex graph invariants of can be used to produce such a representation:

Proposition 3.9.

Let be a graph and let be an adjacency matrix representing . We then have that

 C(G)=⋂P∈Sn {B:B∈Sn, ΘP(B)≤ΘP(A)}.
Proof.

One direction of inclusion in this result is easily seen. Indeed we have that for any

 ΠAΠT∈⋂P∈Sn {B:B∈Sn, ΘP(B)≤ΘP(A)}.

As the right-hand-side is a convex set it is clear that the convex hull belongs to the set on the right-hand-side:

 C(G)⊆⋂P∈Sn {B:B∈Sn, ΘP(B)≤ΘP(A)}.

For the other direction suppose for the sake of a contradiction that we have a point but with for all . As we appeal to the separation theorem from convex analysis [35] to produce a strict separating hyperplane between and , i.e., a such that

 Tr(~PB)<α,∀B∈C(G),   and   Tr(~PM)>α.

Further as is an invariant convex set, it must be the case that

 Θ~P(B)<α,∀B∈C(G).

On the other hand as we also have that . It is thus clear that

 Θ~P(A)<α<Θ~P(M),

Therefore elementary convex graph invariants are useful for representing all the “convex properties” of a graph. This result agrees with the intuition that the “maximum amount of information” that one can hope to obtain from convex graph invariants about a graph should be limited fundamentally by the convex hull of the graph.

As mentioned previously in many cases the convex hull of a graph may be intractable to characterize. One can obtain outer bounds to this convex hull by using a tractable subset of elementary convex graph invariants; therefore we may obtain tractable but weaker convex uncertainty sets than the convex hull of a graph. From Proposition 3.9 such approximations can be refined as we use additional elementary convex graph invariants. As an example the spectral convex constraint sets described in Section 3.4 provide a tractable relaxation that plays a prominent role in our experiments in Section 4.

3.7 Comparison with Spectral Invariants

Convex functions that are invariant under certain group actions have been studied previously. The most prominent among these is the set of convex functions of symmetric matrices that are invariant under conjugation by orthogonal matrices [13]:

 f(M)=f(VMVT), ∀ M∈Sn, ∀ V∈O(n).

It is clear that such functions depend only on the spectrum of a symmetric matrix, and therefore we refer to them as convex spectral invariants:

 f(M)=~f(λ(M)),

where . It is shown in [13] that is convex if and only if is a convex function that is symmetric in its argument:

One can check that any convex spectral invariant can be represented as the supremum over monotone functionals of the spectrum of the form:

 ~f(x)=vT¯¯¯x−α,

for such that . See the Appendix for more details.

A convex spectral invariant is also a convex graph invariant as invariance with respect to conjugation by any orthogonal matrix is a stronger requirement than invariance with respect to conjugation by any permutation matrix. As many convex spectral invariants are tractable to compute, they form an important subclass of convex graph invariants. In Section 4.1 we discuss a natural approximation to elementary convex graph invariants using convex spectral invariants by replacing the symmetric group in the maximization by the orthogonal group . Finally one can define a spectrally invariant convex set (analogous to invariant convex sets defined in Section 3.2) in which if and only if for all . Such sets are very useful in order to impose various spectral constraints on graphs, and often have tractable semidefinite representations.

3.8 Convex versus Non-Convex Invariants

There are many graph invariants that are not convex. In this section we give two examples that serve to illustrate the strengths and weaknesses of convex graph invariants. First consider the spectral invariant given by the fifth largest eigenvalue of a graph, i.e., for a graph specified by adjacency matrix . This function is a graph invariant but it is not convex. However from Section 3.3 we have that the sum of the first five eigenvalues of a graph is a convex graph invariant. More generally any function of the form with is a convex graph invariant. Thus information about the fifth eigenvalue can be obtained in a “convex manner” only by including information about all the top five eigenvalues (or all the bottom eigenvalues). As a second example consider the (weighted) sum of the total number of triangles that occur as subgraphs in a graph. This function is again a non-convex graph invariant. However recall from the forbidden subgraph example in Section 3.4 that we can use elementary convex graph invariants to test whether a graph contains a triangle as a subgraph (with the edges of the triangle having large weights). Therefore, roughly speaking convex graph invariants can be used to decide whether a graph contains a triangle, while general non-convex graph invariants can provide more information about the total number of triangles in a graph. These examples demonstrate that convex graph invariants have certain limitations in terms of the type of information that they can convey about a graph.

The weaker form of information about a graph conveyed by convex graph invariants is nonetheless still useful in distinguishing between graphs. As the next result demonstrates convex graph invariants are strong enough to distinguish between non-isomorphic graphs. This lemma follows from a straightforward application of Proposition 3.9:

Lemma 3.10.

Let be two non-isomorphic graphs represented by adjacency matrices , i.e., there exists no permutation such that . Then there exists a such that .

Proof.

Assume for the sake of a contradiction that for all . Then we have from Proposition 3.9 that . As the extreme points of these polytopes must be the same, there must exist a permutation such that . This leads to a contradiction. ∎

Hence for any two given non-isomorphic graphs there exists an elementary convex graph invariant that evaluates to different values for these two graphs. Consequently elementary convex graph invariants form a complete set of graph invariants as they can distinguish between any two non-isomorphic graphs.

4 Computing Convex Graph Invariants

In this section we focus on efficiently computing and approximating convex graph invariants, and on tractable representations of invariant convex sets. We begin by studying the question of computing elementary convex graph invariants, before moving on to more general convex invariants.

4.1 Elementary Invariants and the Quadratic Assignment Problem

As all convex graph invariants can be represented using only elementary invariants, we initially focus on computing the latter. Computing an elementary convex graph invariant for general is equivalent to solving the so-called Quadratic Assignment Problem (QAP) [11]. Solving QAP is hard in general, because it includes as a special case the Hamiltonian cycle problem; if is the adjacency matrix of the -cycle, then for an unweighted graph specified by adjacency matrix we have that is equal to if and only if the graph contains a Hamiltonian cycle. However there are well-studied spectral and semidefinite relaxations for QAP, which we discuss next.

The spectral relaxation of is obtained by replacing the symmetric group in the definition by the orthogonal group :

 ΛP(A)=maxV∈O(n) Tr(PVAVT). (7)

Clearly for all . As one might expect has a simple closed-form solution [19]:

 ΛP(A)=λ(P)Tλ(A), (8)

where are the eigenvalues of sorted in descending order.

The spectral relaxation offers a simple bound, but is quite weak in many instances. Next we consider the well-studied semidefinite relaxation for the QAP, which offers a tighter relaxation [40]. The main idea behind the semidefinite relaxation is that we can linearize as follows:

 ΘP(A) = maxΠ∈Sym(n) Tr(PΠAΠT) = maxx∈Rn2,x=vec(Π),Π∈Sym(n) ⟨x,(A⊗P)x⟩ = maxx∈Rn2,x=vec(Π),Π∈Sym(n) Tr((A⊗P)xxT).

Here denotes the tensor product between and , and denotes the operation that stacks the columns of a matrix into a single vector. Consequently it is of interest to characterize the following convex hull:

 conv{xxT:x∈Rn2, x=vec(Π), Π∈Sym(n)}.

There is no known tractable characterization of this set, and by considering tractable approximations the semidefinite relaxation to is then obtained as follows:

 ΩP(A)=maxy∈Rn2, Y∈S(n2) Tr(P⊗A) (9) s.t. Tr((I⊗(J−I))Y+((J−I)⊗I)Y)=0 Tr(Y)−2yT1=−n Y≥0, (1yTyY)⪰0.

We refer the reader to [40] for the detailed steps involved in the construction of this relaxation. This SDP relaxation gives an upper bound to , i.e., . One can show that if the extra rank constraint

 rank(1yTyY)=1

is added to the SDP (9), then . Therefore if the optimal value of the SDP (9) is achieved at some such that this rank-one constraint is satisfied, then the relaxation is tight, i.e., we would have that .

While the semidefinite relaxation (9) can in principle be computed in polynomial-time, the size of the variable means that even moderate size problem instances are not well-suited to solution by interior-point methods. In many practical situations however, we often have that the matrix represents the adjacency matrix of some small graph on nodes with , i.e., is nonzero only inside a submatrix and is zero-padded elsewhere so that it lies in . For example as discussed in Section 3.4, may represent the adjacency matrix of a triangle in a constraint expressing that a graph is triangle-free. In such cases computing or approximating may be done more efficiently as follows:

1. Combinatorial enumeration. For very small values of it is possible to compute efficiently even by explicit combinatorial enumeration. The complexity of such a procedure scales as . This approach may be suitable if, for example, represents the adjacency matrix of a triangle.

2. Symmetry reduction. For larger values of , combinatorial enumeration may no longer be appropriate. In these cases the special structure in can be exploited to reduce the size of the SDP relaxation (9). Specifically, using the methods described in [14] it is possible to reduce the size of the matrix variables from to size . More generally, it is also possible to exploit group symmetry in to similarly reduce the size of the SDP (9) (see [14] for details).

4.2 Other Methods and Computational Issues

In many special cases in which computing convex graph invariants may be intractable, it is also possible to use other types of tractable semidefinite relaxations. As described in Section 3.3 the MAXCUT value and the inverse stability number of graphs are invariants that are respectively convex and concave. However both of these are intractable to compute, and as a result we must employ the SDP relaxations for these invariants as discussed in Section 3.3.

Another issue that arises in practice is the representation of invariant convex sets. As an example, let denote the SDP relaxation of the MAXCUT value as defined in (2). As is a concave graph invariant, we may be interested in representing convex constraint sets as follows:

 {A:A∈Sn, f(A)≥α}={A:A∈Sn, Tr(XA)≥α  ∀X∈Sn s.t. Xii=1, X⪰0}.

In order to computationally represent such a set specified in terms of a universal quantifier, we appeal to convex duality. Using the standard dual formulation of (2), we have that:

 {A:A∈Sn, f(A)≥α}={A:A∈Sn,  ∃Y diagonal s.t. A⪰Y, Tr(Y)≥α}.

This reformulation provides a description in terms of existential quantifiers that is more suitable for practical representation. Such reformulations using convex duality are well-known, and can be employed more generally (e.g., for invariant convex sets specified by sublevel sets of the inverse stability number or its relaxations in Section 3.3)

5 Using Convex Graph Invariants in Applications

In this section we give solutions to the stylized problems of Section 2 using convex graph invariants. In order to properly state our results we begin with a few definitions. All the convex programs in our numerical experiments are solved using a combination of the SDPT3 package [38] and the YALMIP parser [29].

5.1 Preliminary Definitions

Let be a convex set in , and let be any point in . Following standard notions from convex analysis [35], the tangent cone at with respect to is defined as follows:

Definition 5.1.

Given a convex set , the tangent cone at a point with respect to is the set of directions from to any other point in :

 TC(x)={αz:z=y−x,y∈C,α≥0}.

If is a convex set expressing a constraint in a convex program, the tangent cone at a point can be viewed as the set of feasible directions at to other points in . Next we define the normal cone at with respect to , again following the usual conventions in convex analysis [35]:

Definition 5.2.

Given a convex set , the normal cone at a point with respect to is the set of normal vectors to supporting hyperplanes of at :

 NC(x)={z:⟨z,y−x⟩≤0 ∀y∈C}.

The normal cone and the tangent cone are polars of each other [35]. A key property of normal cones that we use in stating our results is that for any convex set , the normal cones at all the extreme points of form a partition111Note that there may be overlap on the boundaries of the normal cones at the extreme points, but these overlaps have smaller dimension than those of the normal cones. of [35].

5.2 Application: Graph Deconvolution

Given a combination of two graphs overlaid on the same set of nodes, the graph deconvolution problem is to recover the individual graphs (as introduced in Section 2.1).

Problem 1.

Let and be two graphs specified by particular adjacency matrices . We are given the sum , and the additional information that correspond to particular realizations (labelings of nodes) of . The goal is to recover and from .

See Figure 1 for an example illustrating this problem. The key unknown in this problem is the specific labeling of the nodes of and relative to each other in the composite graph represented by . As described in Section 3.6, the best convex constraints that express this uncertainty are the convex hulls of the graphs . Therefore we consider the following natural solution based on convex optimization to solve the deconvolution problem:

Solution 1.

Recall that and are the convex hulls of the unlabeled graphs (which we are given), and that denotes the Euclidean norm. We propose the following convex program to recover :

 (^A1,^A2)=argminA1,A2∈Sn ∥A−A1−A2∥ (10) s.t.

One could also use in the objective any other norm that is invariant under conjugation by permutation matrices. This program is convex, although it may not be tractable if the sets cannot be efficiently represented. Therefore it may be desirable to use tractable convex relaxations of the sets , i.e., and :

 (^A1,^A2)=argminA1,A2∈Sn ∥A−A1−A2∥ (11) s.t. A1∈C1, A2∈C2.

Recall from Proposition 3.9 that we can represent using all the elementary convex graph invariants. Tractable relaxations to this convex hull may be obtained, for example, by just using spectral invariants, degree-sequence invariants, or any other subset of invariant convex set constraints that can be expressed efficiently. We give numerical examples later in this section. The following result gives conditions under which we can exactly recover using the convex program (11):

Proposition 5.3.

Given the problem setup as described above, we have that is the unique optimum of (11) if and only if:

 TC1(A∗1)∩−TC2(A∗2)={0},

where denotes the negative of the tangent cone .

Proof.

Note that in the setup described above is an optimal solution of the convex program (11) as this point is feasible (since by construction and ), and the cost function achieves its minimum at this point. This result is concerned with being the unique optimal solution.

For one direction suppose that . Then there exists no such that with . Consequently every feasible direction from into would increase the value of the objective. Thus is the unique optimum of (11).

For the other direction suppose that is the unique optimum of (11), and assume for the sake of a contradiction that contains a nonzero element, which we’ll denote by . There exists a scalar such that and . Consequently is also a feasible solution that achieves the lowest possible cost of zero. This contradicts the assumption that is the unique optimum. ∎

Thus we have that transverse intersection of the tangent cones and is equivalent to exact recovery of given the sum . As and , we have that and . These relations follow from the fact that the set of feasible directions from and into the respective convex sets is enlarged. Therefore the tangent cone transversality condition of Proposition 5.3 is generally more difficult to satisfy if we use relaxations to the convex hulls . Consequently we have a tradeoff between the complexity of solving the convex program, and the possibility of exactly recovering . However the following example suggests that it is possible to obtain tractable relaxations that still allow for perfect recovery.

Example. We consider the -cycle, the Shrikhande graph, and the Clebsch graph (see Figure 3), and investigate the deconvolution problem for all three pairings of these graphs. For illustration purposes suppose is an adjacency matrix of the unweighted -node cycle denoted , and that is an adjacency matrix of the -node Clebsch graph denoted (see Figure 1). These adjacency matrices are random instances chosen from the set of all valid adjacency matrices that represent the graphs . Given the sum , we construct convex constraint sets as follows:

 C1 = A ∩ E(A∗1) C2 = A ∩ E(A∗2).

Here represents the spectral constraints of Section 3.4. Therefore the graphs and are characterized purely by their spectral properties. By running the convex program described above for random choices of labelings of the vertices of the graphs , we obtained exact recovery of the adjacency matrices in all cases (see Table 1). Thus we have exact decomposition based only on convex spectral constraints, in which the only invariant information used to characterize the component graphs are the spectra of . Similarly successful decomposition results using only spectral invariants are also seen in the cycle/Shrikhande graph deconvolution problem, and the Clebsch graph/Shrikhande graph deconvolution problem; Table 1 gives complete results.

The inspiration for using the Clebsch graph and the Shrikhande graph as examples for deconvolution is based on Proposition 5.3. Specifically, a graph for which the tangent cone with respect to the corresponding spectral constraint set (defined in Section 3.4) is small is well-suited to being deconvolved from other graphs using spectral invariants. This is because the tangent cone being smaller implies that the transversality condition of Proposition 5.3 is easier to satisfy. In order to obtain small tangent cones with respect to spectral constraint sets, we seek graphs that have many repeated eigenvalues. Strongly regular graphs, such as the Clebsch graph and the Shrikhande graph, are prominent examples of graphs with repeated eigenvalues as they have only three distinct eigenvalues. A strongly regular graph is an unweighted regular graph (i.e., each node has the same degree) in which every pair of adjacent vertices have the same number of common neighbors, and every pair of non-adjacent vertices have the same number of common neighbors [21]. We explore in more detail the properties of these and other graph classes in a separate report [12], where we characterize families of graphs for which the transverse intersection condition of Proposition 5.3 provably holds for constraint sets constructed using tractable graph invariants.

5.3 Application: Generating Graphs with Desired Properties

We first consider the problem of constructing a graph with certain desired structural properties.

Problem 2.

Suppose we are given structural constraints on a graph in terms of a collection of (possibly nonconvex) graph invariants . Can we recover a graph that is consistent with these constraints? For example we may be given constraints on the spectrum, the degree distribution, the girth, and the MAXCUT value. Can we construct some graph that is consistent with this knowledge?

This problem may be infeasible in that there may no graph consistent with the given information. We do not address this feasibility question here, and instead focus only on the computational problem of generating graphs that satisfy the given constraints assuming such graphs do exist. Next we propose a convex programming approach using invariant convex sets to construct a graph , specified by an adjacency matrix , which satisfies the required constraints. Both the problem as well the solution can be suitably modified to include inequality constraints.

Solution 2.

We combine information from all the invariants to construct an invariant convex set . Given a constraint of the form , we consider the following convex set:

 Cj=conv{A:A∈Sn, hj(A)=αj}.

This set is convex by construction, and is an invariant convex set if is a graph invariant. If is a convex graph invariant this set is equal to the sublevel set . Given a collection of constraints we then form an invariant convex constraint set as follows:

 C=∩j