Publications associées à Graphe de Cayley

Fast Approximate Spectral Clustering for Dynamic Networks

Pierre Vandergheynst, Lionel Jérémie Martin, Andreas Loukas

Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to get information from past cluster assignments to expedite computation. Our approach builds on a recen ...

2018

Cutting Materials in Half: A Graph Theory Approach for Generating Crystal Surfaces and Its Prediction of 2D Zeolites

Berend Smit, Peter George Boyd, Senja Dominique Barthel, Matthew David Witman

Scientific interest in two-dimensional (2D) materials, ranging from graphene and other single layer materials to atomically thin crystals, is quickly increasing for a large variety of technological applications. While in silico design approaches have made ...

2018

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

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

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

Mario Paolone, Paolo Romano, Marco Pignati, Lorenzo Zanni

A method for a faulted line identification in a power network, including, at a generic time-instant, solving a plurality of parallel phasor measurement units based real-time state estimators, the state estimators having among each other different and augme ...

2017

Geometric Graph Matching Using Monte Carlo Tree Search

Pascal Fua, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present an efficient matching method for generalized geometric graphs. Such graphs consist of vertices in space connected by curves and can represent many real world structures such as road networks in remote sensing, or vessel networks in medical imagi ...

Ieee Computer Soc2017

Exponential extinction time of the contact process on finite graphs

Thomas Mountford, Daniel Rodrigues Valesin, Jean-Christophe Mourrat

We study the extinction time tau of the contact process started with full occupancy on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on Z, then, uniformly over all trees of degr ...

Elsevier Science Bv2016

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

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Pierre Vandergheynst, Nathanaël Perraudin, Nauman Shahid

Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space. Unfortunately, one often has very little or no information about the geometry of the space, resulting in a highly under-determined recovery problem. ...

2016

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.

Graphe de Cayley

Fast Approximate Spectral Clustering for Dynamic Networks

Cutting Materials in Half: A Graph Theory Approach for Generating Crystal Surfaces and Its Prediction of 2D Zeolites

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

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

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Geometric Graph Matching Using Monte Carlo Tree Search

Exponential extinction time of the contact process on finite graphs

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Graph Chatbot

Chattez avec Graph Search

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

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

Fast Approximate Spectral Clustering for Dynamic Networks

Cutting Materials in Half: A Graph Theory Approach for Generating Crystal Surfaces and Its Prediction of 2D Zeolites

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Geometric Graph Matching Using Monte Carlo Tree Search

Exponential extinction time of the contact process on finite graphs