泊松点云上图拉普拉斯谱的最优收敛速率

IF 2.5 1区 数学 Q2 COMPUTER SCIENCE, THEORY & METHODS Foundations of Computational Mathematics Pub Date : 2025-01-22 DOI:10.1007/s10208-025-09696-9
Scott Armstrong, Raghavendra Venkatraman
{"title":"泊松点云上图拉普拉斯谱的最优收敛速率","authors":"Scott Armstrong, Raghavendra Venkatraman","doi":"10.1007/s10208-025-09696-9","DOIUrl":null,"url":null,"abstract":"<p>We prove optimal convergence rates for eigenvalues and eigenvectors of the graph Laplacian on Poisson point clouds. Our results are valid down to the critical percolation threshold, yielding error estimates for relatively sparse graphs.</p>","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":"20 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Convergence Rates for the Spectrum of the Graph Laplacian on Poisson Point Clouds\",\"authors\":\"Scott Armstrong, Raghavendra Venkatraman\",\"doi\":\"10.1007/s10208-025-09696-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We prove optimal convergence rates for eigenvalues and eigenvectors of the graph Laplacian on Poisson point clouds. Our results are valid down to the critical percolation threshold, yielding error estimates for relatively sparse graphs.</p>\",\"PeriodicalId\":55151,\"journal\":{\"name\":\"Foundations of Computational Mathematics\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2025-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Foundations of Computational Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10208-025-09696-9\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10208-025-09696-9","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

证明了泊松点云上拉普拉斯图的特征值和特征向量的最优收敛速率。我们的结果是有效的,直到临界渗透阈值,产生相对稀疏图的误差估计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Convergence Rates for the Spectrum of the Graph Laplacian on Poisson Point Clouds

We prove optimal convergence rates for eigenvalues and eigenvectors of the graph Laplacian on Poisson point clouds. Our results are valid down to the critical percolation threshold, yielding error estimates for relatively sparse graphs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Foundations of Computational Mathematics
Foundations of Computational Mathematics 数学-计算机:理论方法
CiteScore
6.90
自引率
3.30%
发文量
46
审稿时长
>12 weeks
期刊介绍: Foundations of Computational Mathematics (FoCM) will publish research and survey papers of the highest quality which further the understanding of the connections between mathematics and computation. The journal aims to promote the exploration of all fundamental issues underlying the creative tension among mathematics, computer science and application areas unencumbered by any external criteria such as the pressure for applications. The journal will thus serve an increasingly important and applicable area of mathematics. The journal hopes to further the understanding of the deep relationships between mathematical theory: analysis, topology, geometry and algebra, and the computational processes as they are evolving in tandem with the modern computer. With its distinguished editorial board selecting papers of the highest quality and interest from the international community, FoCM hopes to influence both mathematics and computation. Relevance to applications will not constitute a requirement for the publication of articles. The journal does not accept code for review however authors who have code/data related to the submission should include a weblink to the repository where the data/code is stored.
期刊最新文献
Non-parametric Learning of Stochastic Differential Equations with Non-asymptotic Fast Rates of Convergence Sums of Squares Certificates for Polynomial Moment Inequalities An Unfiltered Low-Regularity Integrator for the KdV Equation with Solutions Below $$\mathbf{H^1}$$ Restarts Subject to Approximate Sharpness: A Parameter-Free and Optimal Scheme For First-Order Methods Multilinear Hyperquiver Representations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1