Subgraph Entropy

Given $r \geq 3$, we prove that there exists $λ>0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $λ$. This answers a question of the second two authors together with Rieck. We interpret this as a graph theoretic version of the Bers Lemma from hyperbolic geometry, and explain some connections to the pressure metric on the Culler-Vogtmann Outer Space.

Publication Details

Journal
ArXiv.org
Published
2025-06-23
Primary Topic
Enterobacteriaceae and Cronobacter Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Subgraph Entropy

ArXiv.org
Enterobacteriaceae and Cronobacter Research
article

Subgraph Entropy

article en

Abstract

Given $r \geq 3$, we prove that there exists $λ>0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $λ$. This answers a question of the second two authors together with Rieck. We interpret this as a graph theoretic version of the Bers Lemma from hyperbolic geometry, and explain some connections to the pressure metric on the Culler-Vogtmann Outer Space.

ArXiv.org
Openalex Percentile: Top 46%
Enterobacteriaceae and Cronobacter Research
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.

Subgraph Entropy · ArXiv.org (2025) | TGRS Research Map | TGRS