Publications associées à Taux d'expansion (théorie des graphes)

Lower Bounds on Active Learning for Graphical Model Selection

We consider the problem of estimating the underlying graph associated with a Markov random field, with the added twist that the decoding algorithm can iteratively choose which subsets of nodes to sample based on the previous samples, resulting in an active ...

2017

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Henry Markram, Kathryn Hess Bellwald, Michael Reimann, Rodrigo de Campos Perin, Giuseppe Chindemi, Martina Scolamiero, Ran Levi, Max Christian Nolte, Katharine Felicity Turner, Pawel Tadeusz Dlotko

The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission i ...

Frontiers Media Sa2017

Isogeny graphs of ordinary abelian varieties

Dimitar Petkov Jetchev, Benjamin Pierre Charles Wesolowski, Ernest Hunter Brooks

Fix a prime number l. Graphs of isogenies of degree a power of l are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a finite field. We analyse gr ...

Springer Heidelberg2017

Introduction to the IEEE Journal on Selected Topics in Signal Processing and IEEE Transactions on Signal and Information Processing Over Networks Joint Special Issue on Graph Signal Processing

Pascal Frossard, Pier Luigi Dragotti

The papers in this special issue are intended to address some of the main research challenges in Graph Signal Processing by presenting a collection of the latest advances in the domain. These papers examine key representation, learning and processing aspec ...

2017

On the Difficulty of Selecting Ising Models with Approximate Recovery

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an approximate recovery criterion that allows for a number of missed edges ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Pierre Vandergheynst, Xavier Bresson, Rodrigo Cerqueira Gonzalez Pena

We cast the problem of source localization on graphs as the simultaneous problem of sparse recovery and diffusion ker- nel learning. An l1 regularization term enforces the sparsity constraint while we recover the sources of diffusion from a single snapshot ...

Ieee2016

Multilinear Low-Rank Tensors on Graphs & Applications

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a new framework for the analysis of low- rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank S ...

2016

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

Pierre Vandergheynst, Xavier Bresson, Michaël Defferrard

In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or wor ...

2016

A generalized mountain-pass theorem: the existence of multiple critical points

Hans-Jörg Ruppen

We analyse the existence of multiple critical points for an even functional J : H -> R in the following context: the Hilbert space H can be split into an orthogonal sum H = Y circle plus Z in such a way that inf{J(u) : u is an element of Z and parallel to ...

Springer Heidelberg2016

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.

Taux d'expansion (théorie des graphes)

Lower Bounds on Active Learning for Graphical Model Selection

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Isogeny graphs of ordinary abelian varieties

Introduction to the IEEE Journal on Selected Topics in Signal Processing and IEEE Transactions on Signal and Information Processing Over Networks Joint Special Issue on Graph Signal Processing

Exploring Selection Bias by Causal Frailty Models

On the Difficulty of Selecting Ising Models with Approximate Recovery

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Multilinear Low-Rank Tensors on Graphs & Applications

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

A generalized mountain-pass theorem: the existence of multiple critical points

Graph Chatbot

Chattez avec Graph Search

Introduction to the IEEE Journal on Selected Topics in Signal Processing and IEEE Transactions on Signal and Information Processing Over Networks Joint Special Issue on Graph Signal Processing

Multilinear Low-Rank Tensors on Graphs & Applications

Lower Bounds on Active Learning for Graphical Model Selection

Isogeny graphs of ordinary abelian varieties

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Exploring Selection Bias by Causal Frailty Models

On the Difficulty of Selecting Ising Models with Approximate Recovery

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

A generalized mountain-pass theorem: the existence of multiple critical points