Embedded trace operator for infinite metric trees

Abstract We consider a class of infinite weighted metric trees obtained as perturbations of self‐similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using identifications of the tree boundary with a surface. Our approach unifies some constructions proposed by Maury, Salort, and Vannier for discrete weighted dyadic trees (expansion in orthogonal bases of harmonic functions on the graph and using Haar‐type bases on the domain representing the boundary), and by Nicaise and Semin and Joly, Kachanovska, and Semin for fractal metric trees (approximation by finite sections and identification of the boundary with a interval): We show that both machineries give the same trace map, and for a range of parameters we establish the precise Sobolev regularity of the traces. In addition, we introduce new geometric ingredients by proposing an identification with arbitrary Riemannian manifolds. It is shown that any compact manifold admits a suitable multiscale decomposition and, therefore, can be identified with a metric tree boundary in the context of trace theorems.

Authors

Institutions

Publication Details

Journal
Mathematische Nachrichten
Published
2024-11-27
DOI
https://doi.org/10.1002/mana.202300574
Citations
2
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.72
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Embedded trace operator for infinite metric trees

Valentina Franceschi, Konstantin Pankrashkin, Kiyan Naderi
2 citations
Mathematische Nachrichten
Matrix Theory and Algorithms
0.72
article

Embedded trace operator for infinite metric trees

Valentina Franceschi, Konstantin Pankrashkin, Kiyan Naderi
article en
2 citations

Abstract

Abstract We consider a class of infinite weighted metric trees obtained as perturbations of self‐similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using identifications of the tree boundary with a surface. Our approach unifies some constructions proposed by Maury, Salort, and Vannier for discrete weighted dyadic trees (expansion in orthogonal bases of harmonic functions on the graph and using Haar‐type bases on the domain representing the boundary), and by Nicaise and Semin and Joly, Kachanovska, and Semin for fractal metric trees (approximation by finite sections and identification of the boundary with a interval): We show that both machineries give the same trace map, and for a range of parameters we establish the precise Sobolev regularity of the traces. In addition, we introduce new geometric ingredients by proposing an identification with arbitrary Riemannian manifolds. It is shown that any compact manifold admits a suitable multiscale decomposition and, therefore, can be identified with a metric tree boundary in the context of trace theorems.

Mathematische NachrichtenVol. 298(1)
Carl von Ossietzky Universität Oldenburg (DE), University of Padua (IT), Civita (IT)
Sustainable cities and communities
Openalex Percentile: Top 25%
Matrix Theory and Algorithms
0.72
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.