| | |
| | |
Stat |
Members: 3645 Articles: 2'504'928 Articles rated: 2609
25 April 2024 |
|
| | | |
|
Article overview
| |
|
Expansion in Matrix-Weighted Graphs | Jakob Hansen
; | Date: |
25 Sep 2020 | Abstract: | A matrix-weighted graph is an undirected graph with a $k imes k$ positive
semidefinite matrix assigned to each edge. There are natural generalizations of
the Laplacian and adjacency matrices for such graphs. These matrices can be
used to define and control expansion for matrix-weighted graphs. In particular,
an analogue of the expander mixing lemma and one half of a Cheeger-type
inequality hold for matrix-weighted graphs. A new definition of a
matrix-weighted expander graph suggests the tantalizing possibility of families
of matrix-weighted graphs with better-than-Ramanujan expansion. | Source: | arXiv, 2009.12008 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |