Publications associées à A lower bound for algebraic connectivity based on the connection-graph-stability method

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.

Graph Heat Mixture Model Learning

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic

Graph inference methods have recently attracted a great interest from the scientific community, due to the large value they bring in data interpretation and analysis. However, most of the available state-of-the-art methods focus on scenarios where all avai ...

IEEE2018

Assembling a Network out of Ambiguous Patches

Matthias Grossglauser, Lyudmila Yartseva, Jefferson Elbert Simões

Many graph mining and network analysis problems rely on the availability of the full network over a set of nodes. But inferring a full network is sometimes non-trivial if the raw data is in the form of many small {\em patches} or subgraphs, of the true net ...

2016

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Nathanaël Perraudin, Benjamin Ricaud, Francesco Grassi

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolv ...

2016

Heuristic-driven Graph Wavelet Modeling of Complex Terrain

Alexandre Buttler, François Golay, Alexander Ludwig Johannes Peringer, Ioana Stoicescu

We present a novel method for building a multiresolution representation of large digital surface models. The surface points coincide with the nodes of a planar graph which can be processed using a critically sampled, invertible lifting scheme. To drive the ...

Spie-Int Soc Optical Engineering2015

The Range of a Random Walk on a Comb

János Pach, Gábor Tardos

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of ...

Electronic Journal Of Combinatorics2013

On the Dihedral Main Conjectures of Iwasawa Theory for Hilbert Modular Eigenforms

Jeanine Marie Van Order

We construct a bipartite Euler system in the sense of Howard for Hilbert modular eigenforms of parallel weight two over totally real fields, generalizing works of Bertolini-Darmon, Longo, Nekovar, Pollack-Weston, and others. The construction has direct app ...

Canadian Mathematical Soc2013

Graph Transformations preserving the stability number

Dominique de Werra

We analyze the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin de ...

Elsevier Science Bv2012

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

A lower bound for algebraic connectivity based on the connection-graph-stability method

Graph Chatbot

Chattez avec Graph Search

Graph Heat Mixture Model Learning

Assembling a Network out of Ambiguous Patches

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Heuristic-driven Graph Wavelet Modeling of Complex Terrain

Reversible Sesqui-Pushout Rewriting, Graph Transformation

The Range of a Random Walk on a Comb

On the Dihedral Main Conjectures of Iwasawa Theory for Hilbert Modular Eigenforms

Graph-Based Information Processing

Graph Transformations preserving the stability number

Lower bounds on the obstacle number of graphs

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Graph-Based Information Processing

The Range of a Random Walk on a Comb

Graph Transformations preserving the stability number

Lower bounds on the obstacle number of graphs

Graph Heat Mixture Model Learning

Assembling a Network out of Ambiguous Patches

Heuristic-driven Graph Wavelet Modeling of Complex Terrain

On the Dihedral Main Conjectures of Iwasawa Theory for Hilbert Modular Eigenforms

Reversible Sesqui-Pushout Rewriting, Graph Transformation