• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

无限量子图的自伴与马尔可夫扩张

Self-adjoint and Markovian extensions of infinite quantum graphs.

作者信息

Kostenko Aleksey, Mugnolo Delio, Nicolussi Noema

机构信息

Faculty of Mathematics and Physics University of Ljubljana Ljubljana Slovenia.

Institute for Analysis and Scientific Computing Vienna University of Technology Vienna Austria.

出版信息

J Lond Math Soc. 2022 Mar;105(2):1262-1313. doi: 10.1112/jlms.12539. Epub 2022 Feb 21.

DOI:10.1112/jlms.12539
PMID:35912286
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9303478/
Abstract

We investigate the relationship between one of the classical notions of boundaries for infinite graphs, , and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of for ends of a metric graph and show that finite volume graph ends is the proper notion of a boundary for Markovian extensions of the Kirchhoff Laplacian. In contrast to manifolds and weighted graphs, this provides a transparent geometric characterization of the uniqueness of Markovian extensions, as well as of the self-adjointness of the Gaffney Laplacian - the underlying metric graph does not have finite volume ends. If, however, finitely many finite volume ends occur (as is the case of edge graphs of normal, locally finite tessellations or Cayley graphs of amenable finitely generated groups), we provide a complete description of Markovian extensions upon introducing a suitable notion of traces of functions and normal derivatives on the set of graph ends.

摘要

我们研究了无限图边界的经典概念之一—— ,与度量图上最小基尔霍夫拉普拉斯算子的自伴扩张之间的关系。我们引入了度量图端点的 概念,并表明有限体积图端点是基尔霍夫拉普拉斯算子马尔可夫扩张的恰当边界概念。与流形和加权图不同,这为马尔可夫扩张的唯一性以及加夫尼拉普拉斯算子的自伴性提供了一个清晰的几何特征——基础度量图没有有限体积端点。然而,如果出现有限多个有限体积端点(如正规局部有限镶嵌的边图或顺从有限生成群的凯莱图的情况),我们在引入图端点集上函数和法向导数迹的合适概念后,给出了马尔可夫扩张的完整描述。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/615e/9303478/e11925eddb37/JLMS-105-1262-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/615e/9303478/bd6bfcd9c6bd/JLMS-105-1262-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/615e/9303478/e11925eddb37/JLMS-105-1262-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/615e/9303478/bd6bfcd9c6bd/JLMS-105-1262-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/615e/9303478/e11925eddb37/JLMS-105-1262-g001.jpg

相似文献

1
Self-adjoint and Markovian extensions of infinite quantum graphs.无限量子图的自伴与马尔可夫扩张
J Lond Math Soc. 2022 Mar;105(2):1262-1313. doi: 10.1112/jlms.12539. Epub 2022 Feb 21.
2
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups.无限阿贝尔群的4正则凯莱图的哈密顿分解
J Graph Theory. 2022 Nov;101(3):559-571. doi: 10.1002/jgt.22840. Epub 2022 May 9.
3
On the Solvability of the Discrete (,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs.关于简单、连通、无向、加权和有限图上离散(,·)-拉普拉斯问题的可解性
Entropy (Basel). 2022 Sep 24;24(10):1353. doi: 10.3390/e24101353.
4
Dirac particles in transparent quantum graphs: Tunable transport of relativistic quasiparticles in branched structures.透明量子图中的狄拉克粒子:分支结构中相对论性准粒子的可调输运。
Phys Rev E. 2020 Jun;101(6-1):062208. doi: 10.1103/PhysRevE.101.062208.
5
On Cayley graphs of {\bb Z}^4.关于\(\mathbb{Z}^4\)的凯莱图。
Acta Crystallogr A Found Adv. 2020 Sep 1;76(Pt 5):584-588. doi: 10.1107/S2053273320007159. Epub 2020 Jul 16.
6
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain.图拉普拉斯正则化在图像去噪中的应用:连续域分析。
IEEE Trans Image Process. 2017 Apr;26(4):1770-1785. doi: 10.1109/TIP.2017.2651400. Epub 2017 Jan 11.
7
Computing The Energy of Certain Graphs based on Vertex Status.基于顶点状态计算某些图的能量
Curr Org Synth. 2023 Aug 11. doi: 10.2174/1570179420666230811124140.
8
Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO) tetrahedra.链状、带状和管状硅酸盐的键拓扑结构。第一部分。(TO)四面体无限一维排列的图论生成。
Acta Crystallogr A Found Adv. 2022 May 1;78(Pt 3):212-233. doi: 10.1107/S2053273322001747. Epub 2022 Apr 4.
9
Simple graph models of information spread in finite populations.有限群体中信息传播的简单图模型。
R Soc Open Sci. 2015 May 20;2(5):150028. doi: 10.1098/rsos.150028. eCollection 2015 May.
10
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.一种对某些平面图类进行 4 着色的线性时间算法。
Comput Intell Neurosci. 2021 Oct 5;2021:7667656. doi: 10.1155/2021/7667656. eCollection 2021.