arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.08697math.APcs.NAmath.DSmath.NA
收藏

图上$p$发展问题的连续极限:$L^q$图子和稀疏图

Continuum limit of $p$-Laplacian evolution problems on graphs:$L^q$ graphons and sparse graphs

Imad El Bouchairi, Jalal Fadili, Abderrahim Elmoataz

摘要:

本文研究了稀疏图上具有齐次Neumann边界条件的离散$p$ -Laplacian发展问题的连续极限。这将[24]的结果扩展到更一般的一类核(可能是奇异的)和图序列,其极限是所谓的$L^q$ -图子。更确切地说,我们推导出由两个不同的演化系统(即具有不同的内核,第二成员和初始数据)定义的两个连续时间轨迹之间的距离上的界限。同样,我们提供了一个边界的情况下,其中一个轨迹是离散的时间和其他是连续的。反过来,这些结果导致我们建立稀疏随机图上的$p$ -拉普拉斯问题的完全离散化的误差估计。特别是,我们提供了收敛速率的解决方案的离散模型的解决方案的连续问题的顶点数的增长。

英文摘要:

In this paper we study continuum limits of the discretized $p$-Laplacian evolution problem on sparse graphs with homogeneous Neumann boundary conditions. This extends the results of [24] to a far more general class of kernels, possibly singular, and graph sequences whose limit are the so-called $L^q$-graphons. More precisely, we derive a bound on the distance between two continuous-in-time trajectories defined by two different evolution systems (i.e. with different kernels, second member and initial data). Similarly, we provide a bound in the case that one of the trajectories is discrete-in-time and the other is continuous. In turn, these results lead us to establish error estimates of the full discretization of the $p$-Laplacian problem on sparse random graphs. In particular, we provide rate of convergence of solutions for the discrete models to the solution of the continuous problem as the number of vertices grows.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑