Quantum ergodicity on large regular graphs

Nalini Anantharaman; Etienne Le Masson

doi:10.1215/00127094-2881592

Quantum ergodicity on large regular graphs

Nalini Anantharaman, Etienne Le Masson

School of Mathematics

Research output: Contribution to journal › Article (Academic Journal) › peer-review

60 Citations (Scopus)

107 Downloads (Pure)

Abstract

We propose a version of the quantum ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of “most” eigenfunctions. We consider expander graphs with few short cycles (for instance random large regular graphs). Our method mimics the proof of quantum ergodicity on manifolds: it uses microlocal analysis on regular trees, as introduced by the second author in an earlier paper.

Original language	English
Pages (from-to)	723-765
Number of pages	43
Journal	Duke Mathematical Journal
Volume	164
Issue number	4
Early online date	16 Mar 2015
DOIs	https://doi.org/10.1215/00127094-2881592
Publication status	E-pub ahead of print - 16 Mar 2015

Bibliographical note

Acceptance date is provisional and based on date of publication.

Keywords

large random graphs
Laplacian eigenfunctions
quantum ergodicity
semiclassical measures

Access to Document

10.1215/00127094-2881592

Full-text PDF (author’s accepted manuscript)
This is the author accepted manuscript (AAM). The final published version (version of record) is available online via Duke University Press at https://projecteuclid.org/euclid.dmj/1426512106 . Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 498 KB

Handle.net

Persistent link

Cite this

@article{2fafcc4b9cef42aa915e592a4dbc9630,

title = "Quantum ergodicity on large regular graphs",

abstract = "We propose a version of the quantum ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of “most” eigenfunctions. We consider expander graphs with few short cycles (for instance random large regular graphs). Our method mimics the proof of quantum ergodicity on manifolds: it uses microlocal analysis on regular trees, as introduced by the second author in an earlier paper.",

keywords = "large random graphs, Laplacian eigenfunctions, quantum ergodicity, semiclassical measures",

author = "Nalini Anantharaman and \{Le Masson\}, Etienne",

note = "Acceptance date is provisional and based on date of publication.",

year = "2015",

month = mar,

day = "16",

doi = "10.1215/00127094-2881592",

language = "English",

volume = "164",

pages = "723--765",

journal = "Duke Mathematical Journal",

issn = "0012-7094",

publisher = "Duke University Press",

number = "4",

}

TY - JOUR

T1 - Quantum ergodicity on large regular graphs

AU - Anantharaman, Nalini

AU - Le Masson, Etienne

N1 - Acceptance date is provisional and based on date of publication.

PY - 2015/3/16

Y1 - 2015/3/16

N2 - We propose a version of the quantum ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of “most” eigenfunctions. We consider expander graphs with few short cycles (for instance random large regular graphs). Our method mimics the proof of quantum ergodicity on manifolds: it uses microlocal analysis on regular trees, as introduced by the second author in an earlier paper.

AB - We propose a version of the quantum ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of “most” eigenfunctions. We consider expander graphs with few short cycles (for instance random large regular graphs). Our method mimics the proof of quantum ergodicity on manifolds: it uses microlocal analysis on regular trees, as introduced by the second author in an earlier paper.

KW - large random graphs

KW - Laplacian eigenfunctions

KW - quantum ergodicity

KW - semiclassical measures

U2 - 10.1215/00127094-2881592

DO - 10.1215/00127094-2881592

M3 - Article (Academic Journal)

SN - 0012-7094

VL - 164

SP - 723

EP - 765

JO - Duke Mathematical Journal

JF - Duke Mathematical Journal

IS - 4

ER -

Quantum ergodicity on large regular graphs

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this