Concept

Spectral graph theory

Related publications (126)

An Introduction to Bayesian Network Theory and Usage

I present an introduction to some of the concepts within Bayesian networks to help a beginner become familiar with this field's theory. Bayesian networks are a combination of two different mathematical areas: graph theory and probability theory. So, I firs ...

IDIAP2000

Alternative pseudogap scenario: Spectroscopic analogies between underdoped and disordered Bi2Sr2CaCu2O8+x

Giorgio Margaritondo, László Forró, Marco Grioni, Helmuth Berger

Disorder has a strong influence on the spectral properties of the Bi2Sr2CaCu2O8+x high-T-c superconductor, both in the normal and in the superconducting state. High-resolution photoemission reveals a progressive quasiparticle suppression with increasing di ...

2000

Spectral consequences of broken phase coherence in 1T-TaS/sub 2/

Giorgio Margaritondo, László Forró, Helmuth Berger

Random defects destroy long-range phase coherence, and inhibit the metal-insulator transition in the charge density wave (CDW) system IT-TaS/sub 2/. Photoelectron spectroscopy with high resolution reveals corresponding changes in the electronic structure. ...

1998

Spectral consequences of broken phase coherence in 1T-TaS2

Giorgio Margaritondo, László Forró, Marco Grioni, Helmuth Berger

Random defects destroy long-range phase coherence, and inhibit the metal-insulator transition in the charge density wave (CDW) system 1T-TaS2. Photoelectron spectroscopy with high resolution reveals corresponding changes in the electronic structure. Core l ...

1998

Isospectral Riemann surfaces

We construct new examples of compact Riemann surfaces which are non isometric but have the same spectrum of the Laplacian. Examples are given for genus

g=5

and for all

gge 7

. In a second part we give examples of isospectral non isometric surfaces in $b ...

1986

Fast Eigenspace Approximation using Random Signals

Lionel Jérémie Martin, Johann Paratte

We focus in this work on the estimation of the first k eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need k such signals to be able to exactly recover as many of the smallest eigenvectors, regardless ...

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Isospectral Riemann surfaces

We construct new examples of compact Riemann surfaces which are non isometric but have the same spectrum of the Laplacian. Examples are given for genus

g=5

and for all

gge 7

. In a second part we give examples of isospectral non isometric surfaces in $b ...

1986