Unified Fourier transform on graphs sampled from stochastic block models
From MaRDI portal
Cites work
- A noncommutative approach to the graphon Fourier transform
- A useful variant of the Davis-Kahan theorem for statisticians
- Community detection and stochastic block models: recent developments
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Estimation and Prediction for Stochastic Blockstructures
- Exact Recovery in the Stochastic Block Model
- Fast Fourier transform for fitness landscapes
- Fourier transform inequalities with measure weights
- Frames for signal processing on Cayley graphs
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- Interacting diffusions on sparse graphs: hydrodynamics from local weak limits
- Introduction to graph signal processing
- Large networks and graph limits
- Limits of dense graph sequences
- Limits of kernel operators and the spectral regularity lemma
- On the graphon mean field game equations: individual agent affine dynamics and mean field dependent performance functions
- Quick approximation to matrices and applications
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Spectra of Cayley graphs
- The automorphism group of a graphon
- The large deviation principle for interacting dynamical systems on random graphs
- The mean field equation for the Kuramoto model on graph sequences with non-Lipschitz limit
- The nonlinear heat equation on \(W\)-random graphs
- Universal graph compression: stochastic block models
This page was built for publication: Unified Fourier transform on graphs sampled from stochastic block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7327043)
