Benjamini–Schramm vs. Plancherel convergence

We show that Plancherel convergence is strictly stronger than Benjamini–Schramm convergence. In order to do so, we introduce two criteria for Plancherel and Benjamini–Schramm convergence in terms of counting functions of the length spectrum.

Authors

Institutions

Publication Details

Journal
Documenta Mathematica
Published
2025-08-27
DOI
https://doi.org/10.4171/dm/1023
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Benjamini–Schramm vs. Plancherel convergence

Giacomo Gavelli, Claudius Kamp
Documenta Mathematica
Matrix Theory and Algorithms
article

Benjamini–Schramm vs. Plancherel convergence

Giacomo Gavelli, Claudius Kamp
article en

Abstract

We show that Plancherel convergence is strictly stronger than Benjamini–Schramm convergence. In order to do so, we introduce two criteria for Plancherel and Benjamini–Schramm convergence in terms of counting functions of the length spectrum.

Documenta Mathematica
University of Tübingen (DE)
Openalex Percentile: Top 76%
Matrix Theory and Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Benjamini–Schramm vs. Plancherel convergence — Giacomo Gavelli, Claudius Kamp · Documenta Mathematica (2025) | TGRS Research Map | TGRS