Publications associées à Wavelets on Graphs via Spectral Graph Theory

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Homogenization of Multiscale Eddy Current Problem by Localized Orthogonal Decomposition Method

Xiaotao Ren

A homogenization approach for the solution of multiscale eddy current problem is proposed. The method is based on the subspace decomposition and it involves a coarse space and a nested fine space. The homogenized problem is posed in the coarse space with t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Spectrally approximating large graphs with smaller graphs

Pierre Vandergheynst, Andreas Loukas

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to depend on standard ...

2018

The Sketching Complexity of Graph and Hypergraph Counting

Mikhail Kapralov, John Michael Goddard Kallaugher

Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been ...

IEEE COMPUTER SOC2018

Stationary signal processing on graphs

Pierre Vandergheynst, Nathanaël Perraudin

Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over graphs or network ...

Institute of Electrical and Electronics Engineers2017

Towards Stationary Time-Vertex Signal Processing

Pierre Vandergheynst, Nathanaël Perraudin, Andreas Loukas, Francesco Grassi

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods ...

Ieee2017

Conditional expanding bounds for two-variable functions over finite valuation rings

Van Thang Pham

In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings R of order q(r) which generalize recent results given by Hegyvari and Hennecart (2013). More precisely, we prove that, fo ...

Academic Press Ltd- Elsevier Science Ltd2017

Towards stationary time-vertex signal processing

Pierre Vandergheynst, Nathanaël Perraudin, Andreas Loukas, Francesco Grassi

2016

Clustered planarity testing revisited

Radoslav Fulek, Jan Kyncl, Igor Malinovic

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...

2015

Wavelets on Graphs via Spectral Graph Theory

Graph Chatbot

Chattez avec Graph Search

Homogenization of Multiscale Eddy Current Problem by Localized Orthogonal Decomposition Method

Spectrally approximating large graphs with smaller graphs

The Sketching Complexity of Graph and Hypergraph Counting

Graph-based structures in data science

Graph-based Methods for Visualization and Clustering

Stationary signal processing on graphs

Towards Stationary Time-Vertex Signal Processing

Conditional expanding bounds for two-variable functions over finite valuation rings

Towards stationary time-vertex signal processing

Clustered planarity testing revisited

Graph-based structures in data science

Conditional expanding bounds for two-variable functions over finite valuation rings

Stationary signal processing on graphs

The Sketching Complexity of Graph and Hypergraph Counting

Spectrally approximating large graphs with smaller graphs

Graph-based Methods for Visualization and Clustering

Homogenization of Multiscale Eddy Current Problem by Localized Orthogonal Decomposition Method

Clustered planarity testing revisited

Towards stationary time-vertex signal processing

Towards Stationary Time-Vertex Signal Processing