Lovász Number

In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lovász theta function and is commonly denoted by $\vartheta(G)$, using a script form of the Greek letter theta to contrast with the upright theta used for Shannon capacity. This quantity was first introduced by László Lovász in his 1979 paper ''On the Shannon Capacity of a Graph''.

Accurate numerical approximations to this number can be computed in polynomial time by semidefinite programming and the ellipsoid method.
It is sandwiched between the chromatic number and clique number of any graph, and can be used to compute these numbers on graphs for which they are equal, including perfect graphs.

Definition

Let $G=(V,E)$ be a graph on $n$ vertices. An ordered set of $n$ unit vectors $U=(u_i\mid i\in V)\subset\mathbb^N$ is called an orthonormal representation of $G$ in $\mathbb^N$, if $u_i$ and $u_j$ are orthogonal whenever vertices $i$ and $j$ are not adjacent in $G$:
$u_i^\mathrm u_j = \begin 1, & \texti = j, \\ 0, & \textij \notin E. \end$
Clearly, every graph admits an orthonormal representation with $N=n$: just represent vertices by distinct vectors from the standard basis of $\mathbb^N$. Depending on the graph it might be possible to take $N$ considerably smaller than the number of vertices $n$.

The Lovász number $\vartheta$ of graph $G$ is defined as follows:
$\vartheta(G) = \min_ \max_ \frac,$
where $c$ is a unit vector in $\mathbb^N$ and $U$ is an orthonormal representation of $G$ in $\mathbb^N$. Here minimization implicitly is performed also over the dimension $N$, however without loss of generality it suffices to consider $N=n$. Intuitively, this corresponds to minimizing the half-angle of a rotational cone containing all representing vectors of an orthonormal representation of $G$. If the optimal angle is $\phi$, then $\vartheta(G)=1/\cos^2\phi$ and $c$ corresponds to the symmetry axis of the cone.

Equivalent expressions

Let $G=(V,E)$ be a graph on $n$ vertices. Let $A$ range over all $n\times n$ symmetric matrices such that $a_=1$ whenever $i=j$ or vertices $i$ and $j$ are not adjacent, and let $\lambda_(A)$ denote the largest eigenvalue of $A$. Then an alternative way of computing the Lovász number of $G$ is as follows:
$\vartheta(G) = \min_A \lambda_(A).$

The following method is dual to the previous one. Let $B$ range over all $n\times n$ symmetric positive semidefinite matrices such that $b_=0$ whenever vertices $i$ and $j$ are adjacent, and such that the trace (sum of diagonal entries) of $B$ is $\operatorname(B)=1$. Let $J$ be the $n\times n$ matrix of ones. Then
$\vartheta(G) = \max_B \operatorname(BJ).$
Here, $\operatorname(BJ)$ is just the sum of all entries of $B$.

The Lovász number can be computed also in terms of the complement graph $\bar G$. Let $d$ be a unit vector and $U=(u_i\mid i\in V)$ be an orthonormal representation of $\bar G$. Then
$\vartheta(G) = \max_ \sum_ (d^\mathrm u_i)^2.$

Value for well-known graphs

The Lovász number has been computed for the following graphs:

Properties

If $G \boxtimes H$ denotes the strong graph product of graphs $G$ and $H$, then
$\vartheta(G \boxtimes H) = \vartheta(G) \vartheta(H).$

If $\bar G$ is the complement of $G$, then
$\vartheta(G) \vartheta(\bar) \geq n,$
with equality if $G$ is vertex-transitive.

Lovász "sandwich theorem"

The Lovász "sandwich theorem" states that the Lovász number always lies between two other numbers that are NP-complete to compute. More precisely,
$\omega(G) \leq \vartheta(\bar) \leq \chi(G),$
where $\omega(G)$ is the clique number of $G$ (the size of the largest clique) and $\chi(G)$ is the chromatic number of $G$ (the smallest number of colors needed to color the vertices of $G$ so that no two adjacent vertices receive the same color).

The value of $\vartheta(G)$ can be formulated as a semidefinite program and numerically approximated by the ellipsoid method in time bounded by a polynomial in the number of vertices of ''G''.; .
For perfect graphs, the chromatic number and clique number are equal, and therefore are both equal to $\vartheta(\bar)$. By computing an approximation of $\vartheta(\bar)$ and then rounding to the nearest integer value, the chromatic number and clique number of these graphs can be computed in polynomial time.

Relation to Shannon capacity

The Shannon capacity of graph $G$ is defined as follows:

\Theta(G)
= \sup_k \sqrt = \lim_ \sqrt

where $\alpha(G)$ is the independence number of graph $G$ (the size of a largest independent set of $G$) and $G^k$ is the strong graph product of $G$ with itself $k$ times. Clearly, $\Theta(G)\ge\alpha(G)$. However, the Lovász number provides an upper bound on the Shannon capacity of graph, hence
$\alpha(G) \leq \Theta(G) \leq \vartheta(G).$

For example, let the confusability graph of the channel be $C_5$, a pentagon. Since the original paper of it was an open problem to determine the value of $\Theta(C_5)$. It was first established by that $\Theta(C_5)=\sqrt5$.

Clearly, $\Theta(C_5)\ge\alpha(C_5)=2$. However, $\alpha(C_5^2)\ge 5$, since "11", "23", "35", "54", "42" are five mutually non-confusable messages (forming a five-vertex independent set in the strong square of $C_5$), thus $\Theta(C_5)\ge\sqrt5$.

To show that this bound is tight, let $U=(u_1,\dots,u_5)$ be the following orthonormal representation of the pentagon:
$u_k = \begin \cos \\ \sin \cos \\ \sin \sin \end, \quad \cos = \frac, \quad \varphi_k = \frac$
and let $c=(1,0,0)$. By using this choice in the initial definition of Lovász number, we get $\vartheta(C_5)\le\sqrt5$. Hence, $\Theta(C_5)=\sqrt5$.

However, there exist graphs for which the Lovász number and Shannon capacity differ, so the Lovász number cannot in general be used to compute exact Shannon capacities.

Quantum physics

The Lovász number has been generalized for "non-commutative graphs" in the context of quantum communication. The Lovasz number also arises in quantum contextuality in an attempt to explain the power of quantum computers.

See also

* Tardos function, a monotone approximation to the Lovász number of the complement graph that can be computed in polynomial time and has been used to prove lower bounds in circuit complexity

Notes

References

*
*
*
*
*
*
*
*
*
*
*
*
*

External links

*

{{DEFAULTSORT:Lovasz number
Graph invariants
Information theory