Concept

Théorie spectrale des graphes

Publications associées (126)

Model-based Sketching and Recovery with Expanders

Volkan Cevher, Luca Baldassarre, Bubacarr Bah

Linear sketching and recovery of sparse vectors with randomly constructed sparse matrices has numerous applications in several areas, including compressive sensing, data stream computing, graph sketching, and combinatorial group testing. This paper conside ...

2014

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

Parametric dictionary learning for graph signals

Pascal Frossard, David Shuman

We propose a parametric dictionary learning algorithm to design structured dictionaries that sparsely represent graph signals. We incorporate the graph structure by forcing the learned dictionaries to be concatenations of subdictionaries that are polynomia ...

2013

On the Performance of Percolation Graph Matching

Matthias Grossglauser, Lyudmila Yartseva

Graph matching is a generalization of the classic graph isomorphism problem. By using only their structures a graph-matching algorithm finds a map between the vertex sets of two similar graphs. This has applications in the de-anonymization of social and in ...

ACM2013

Altered structural connectivity in patients with medial temporal lobe epilepsy: A Diffusion Spectrum Imaging and Graph Analysis study

Jean-Philippe Thiran, Alessandra Griffa, Alessandro Daducci, Alia Lemkaddem

In this study we investigated the effect of medial temporal lobe epilepsy (MTLE) on the global characteristics of brain connectivity estimated by topological measures. We used DSI (Diffusion Spectrum Imaging) to construct a connectivity matrix where the no ...

2012

Computing symmetric nonnegative rank factorizations

An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a di ...

Elsevier2012

Systemic Risk in Energy Derivative Markets: A Graph-Theory Analysis

Franck Claude Raynaud

This article uses graph theory to provide novel evidence regarding market integration, a favorable condition for systemic risk to appear in. Relying on daily futures returns covering a 12-year period, we examine cross- and inter-market linkages, both withi ...

2012

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012

Cohomology of GKM fiber bundles

Silvia Sabatini

The equivariant cohomology ring of a GKM manifold is isomorphic to the cohomology ring of its GKM graph. In this paper we explore the implications of this fact for equivariant fiber bundles for which the total space and the base space are both GKM and deri ...

Springer Verlag2012

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012