Senior Capstone Talk 2

Strongly Regular Graphs (SRGs) and Connections to Equiangular
Tight Frames (ETFs)
Acuna, Antonio and Jean-Baptiste, Loı̈c

Fort Lewis College
Joint work with Singer, Dayton and Dickey, Timothy

April 27, 2023
Acuna, Antonio and Jean-Baptiste, Loı̈c Fort Lewis College Strongly Regular Graphs (SRGs) and Connections to Equiangular Tight Frames
Introducing Strongly Regular Graphs (SRGs)
Definition
A graph G = (V , E ) is a pair of finite, nonempty sets V , called the set of vertices, and
E , called the set of edges. If there are multiple graphs, typically, we denote V (G ) and
E (G ) as the set of vertices and edges, respectively, to the graph G .
Introducing Strongly Regular Graphs (SRGs)
Definition
A graph G = (V , E ) is a pair of finite, nonempty sets V , called the set of vertices, and
E , called the set of edges. If there are multiple graphs, typically, we denote V (G ) and
E (G ) as the set of vertices and edges, respectively, to the graph G .
Definition
If G is a graph with vertices labelled V (G ) = {1, 2, ..., v } , its adjacency matrix
A = (aij ) is the v × v matrix whose entries are either 1 or 0, where 1 denotes when a
vertex is adjacent to another and 0 otherwise. For instance, if aij = 1, then vertex
j ∈ V (G ) is adjacent to the vertex i ∈ V (G ); if aij = 0, then vertex j is nonadjacent to
i.
Introducing SRGs
Introducing SRGs
Introducing SRGs
Definition
A graph is k-regular if and only if, for its adjacency matrix A, A1 = k1 for some
k ∈ N.
Introducing SRGs
Definition
k ∈ N.
Definition
A strongly regular graph (SRG) is defined as follows. Let G = (V , E ) be a regular
graph with v vertices and degree k. G is said to be strongly regular if there are also
integers λ and µ such that:
(i) Every two adjacent vertices have λ common neighbours;
(ii) Every two non-adjacent vertices have µ common neighbours.
Introducing SRGs
Definition
k ∈ N.
Definition
A strongly regular graph (SRG) is defined as follows. Let G = (V , E ) be a regular
graph with v vertices and degree k. G is said to be strongly regular if there are also
integers λ and µ such that:
(i) Every two adjacent vertices have λ common neighbours;
(ii) Every two non-adjacent vertices have µ common neighbours.
      
0 1 0 0 1 1 2 1
1 0 1 0 0 1 2 1
      

 1 = 2 = 2 × 1
0 1 0 1 0      

0 0 1 0 1 1    2 1
1 0 0 1 0 1 2 1
Introducing Graph Complements
Theorem
The complement of an SRG is another SRG. To be precise, the graph complement of
an SRG(v , k, λ, µ) is an SRG(v , v − k − 1, v − 2k + µ − 2, v − 2k + λ).
v is 5 because there are 5

vertices
k is 2 because each node
has 2 neighbors
λ is zero because every
two adjacent vertices have
0 common neighbors
µ is one because every
two non adjacent vertices
have 1 common neighbors
Introducing the Gram Matrix
Theorem
An n × n symmetric matrix G = Φ∗ Φ is the Gram matrix of an ETF with synthesis
operator Φ if and only if it satisfies the following properties:
1 G2 = αG for some α ∈ R;
2 Gij = 1 for all i = j;
3 there exists β ∈ R such that |Gij | = β for all i ̸= j.
Introducing Naimark Complements
Definition
An orthogonal complement of a space, is a subspace of vectors where all vectors in it
are orthogonal (perpendicular) to all of the vectors in the original vector space.
Introducing Naimark Complements
Definition
An orthogonal complement of a space, is a subspace of vectors where all vectors in it
are orthogonal (perpendicular) to all of the vectors in the original vector space.
Theorem
Let Φ be an m × n synthesis operator of an ETF, and let Φ e be any (n − m) × n matrix
whose rows form an orthogonal basis for the orthogonal complement of the row space
n
of Φ, and have squared norm n−m . Then Φ e is the synthesis operator of an ETF.
Moreover, these synthesis operators satisfy the relationship
m ∗ n − m e∗ e m n−m e
I= Φ Φ+ Φ Φ= nG + n G
n n
Here we define Φ
e as a Naimark Complement.
Constructing Naimark Complements
re1∗
 
  −− −−
| | ··· | −− −− re2∗
Given Φ = φ1 φ2 · · · φn , then Φ e = 
  .. ..  ..
 . .  .
| | ··· |
∗
−−
ren−m −−
where each row e ∗
vector ri is orthogonal to all rows
in Φ and all of the other rows in Φ.
e

Φ
Notably, we can form a square partitioned matrix A = e with dimensions
Φ
(m + (n − m)) × n = n × n such that the identity matrix
I = A∗ A.
How do we get from SRGs to ETFs?
Theorem
Let B be the adjacency matrix of an SRG(v , k, λ, µ) where µ = k2 . Then,
( )
v +1 v − 2k − 1
m= 1+ p
2 (v − 2k − 1)2 + 4v
and is the unique choice of m for which there exists a β > 0 such that
β1∗

1
G= ,
β1 2βB + (β + 1)I − βJ
is m
qthe Gram matrix of a real ETF for R of n = v + 1 vectors. Here, β is necessarily
n−m
m(n−1) .
How do we get from SRGs to ETFs?
Example
Let B be the adjacency matrix of an SRG(5, 2, 0, 1) where µ = 22 . Then,
( )
5+1 5 − 2(2) − 1
m= 1+ p =3
2 (5 − 2(2) − 1)2 + 4(2)
and is the unique choice of m for which there exists a β > 0 such that
β1∗

1
G= ,
β1 2βB + (β + 1)I − βJ
is the Gram matrix of a real ETF for R3 of n = 5 + 1 vectors. Here, β is necessarily

q
n−m √1
m(n−1) = 5 .
Graph Complement Example SRG(5,2,0,1)
 
1.0000 0.4472 0.4472 0.4472 0.4472 0.4472
0.4472 1.0000
 0.4472 −0.4472 −0.4472 0.4472 
0.4472 0.4472 1.0000 0.4472 −0.4472 −0.4472
G=
 
0.4472 −0.4472 0.4472 1.0000 0.4472 −0.4472 

0.4472 −0.4472 −0.4472 0.4472 1.0000 0.4472 
0.4472 0.4472 −0.4472 −0.4472 0.4472 1.0000
Graph Complement Example SRG(5,2,0,1)
 
1.0000 0.4472 0.4472 0.4472 0.4472 0.4472
0.4472 1.0000
 0.4472 −0.4472 −0.4472 0.4472 

0.4472 0.4472 1.0000 0.4472 −0.4472 −0.4472
G=0.4472 −0.4472 0.4472

 1.0000 0.4472 −0.4472
0.4472 −0.4472 −0.4472 0.4472 1.0000 0.4472 
0.4472 0.4472 −0.4472 −0.4472 0.4472 1.0000
 
0.7312 −0.2640 0.2887 0.8943 0.7159 0.0000
Φ = −0.5152 −0.8546 −0.8466 0.0130 0.5362
 0.0000
0.4472 0.4472 −0.4472 −0.4472 0.4472 1.0000
ΦΦ∗ = 2I
Φ∗ Φ = G
G2 = 2G
How do we get from ETFs to SRGs?
Theorem
Let {φi }ni=1 be an ETF for Rm where m < n, and assume
q without loss of generality
n n−m
that ⟨φi , φj ⟩ > 0 for all i. Letting α = m and β = m(n−1) , the (n − 1) × (n − 1)
matrix B such that
0 1∗

1 ∗ β+1 1 1 β+1 1
=A= Φ Φ− I+ J= G− I+ J
1 B 2β 2β 2 2β 2β 2
λ, µ) where v = n − 1,
is the adjacency matrix of a SRG (v , k,q
m(n−1)
k = ( v −1
2 +
α−2
2β ) = n
2
n
− 1 + ( 2m − 1) n−m and µ = k2 .
Commutative Diagram of ETFs and SRGs
1st Direction
We start with an SRG (v , k, λ, µ)
1st Direction

We use the Graph complement theorem to build the complement
SRG
g = (v , k,
e λ,
e µe) with adjacency matrix B
e
1st Direction

We use the Graph complement theorem to build the complement
SRG
g = (v , k,
e λ,
e µe) with adjacency matrix B
e
We use the SRG to ETF theorem to build G
e the Gram matrix of an ETF with dim
m
e and Welch bound βe
2nd Direction
We start with the same SRG (v , k, λ, µ)
2nd Direction

We use the SRG to ETF theorem to build G the Gram matrix of an ETF with dim
m and Welch bound β
2nd Direction

We take a Naimark complement to build a new ETF Gb with dim mb = n − m and
Welch bound βb
2nd Direction

Welch bound βb
We prove that m
b=m
e and βb = βe
2nd Direction

Welch bound βb
We prove that m
b=m
e and βb = βe
Thus G
b =G e
References
Matthew Fickus and Cody E. Watson. Detailing the equivalence between real
equiangular tight frames and certain strongly regular graphs. In manos Papadakis,
Vivek K. Goal, and Dimitri Van De Ville, editors, SPIE Proceedings. SPIE, aug 2015.
M. A. Sustik, J. A. Tropp, I. S. Dhillon, R. W. Heath, On the existence of equiangular
tight frames, Linear Algebra Appl. 426 (2007) 619–635.
Acknowledgements
Advisor: Dr. Veronika Furst

Collaborators: Dayton Singer and Timothy Dickey

Senior Capstone Talk 2

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Senior Capstone Talk 2

Uploaded by

Copyright:

Available Formats

Strongly Regular Graphs (SRGs) and Connections to Equiangular

Tight Frames (ETFs)

Acuna, Antonio and Jean-Baptiste, Loı̈c

Joint work with Singer, Dayton and Dickey, Timothy

v is 5 because there are 5

is the Gram matrix of a real ETF for R3 of n = 5 + 1 vectors. Here, β is necessarily

We start with an SRG (v , k, λ, µ)

We start with an SRG (v , k, λ, µ)

We start with an SRG (v , k, λ, µ)

We start with the same SRG (v , k, λ, µ)

We start with the same SRG (v , k, λ, µ)

We start with the same SRG (v , k, λ, µ)

We start with the same SRG (v , k, λ, µ)

We start with the same SRG (v , k, λ, µ)

Advisor: Dr. Veronika Furst

You might also like