induced graphon signal

[[concept]]

Induced Graphon Signal

Let $(G_{n}, X_{n})$ be a graph signal. The induced graphon signal is defined as the pair $(W_{n}, X_{n})$ where $W_{n}$ is the induced graphon and

X_{n} (u) = \sum_{i = 1}^{n} [x_{n}]_{i} 1 (u \in I_{i})

Where $1$ is the indicator function and

I_{k} = {\begin{cases} [\frac{k - 1}{n}, \frac{k}{n}) 1 \leq k \leq n - 1 \\ [\frac{n - 1}{n}, 1] k = n \end{cases}

Example

Mentions

File
convergence bound for graph convolutions
convergent sequence of graph signals
graph convolutions of bandlimited signals converge to the graphon convolution
graphon signal
lipschitz graph convolutions of graph signals converge to lipschitz graphon filters
2025-03-26 lecture 15
2025-03-31 lecture 16
2025-04-07 lecture 18
2025-04-14 lecture 20

Created 2025-03-26 ֍ Last Modified 2025-09-18