In this paper we study numerical approximations of the evolution problem for the nonlocal p-Laplacian with homogeneous Neumann boundary conditions. First, we derive a bound on the distance between two continuous-in-time trajectories defined by two different evolution systems (i.e. with different kernels and initial data). We then provide a similar bound for the case when one of the trajectories is discrete-in-time and the other is continuous. In turn, these results allow us to establish error estimates of the discretized p-Laplacian problem on graphs. More precisely, for networks on convergent graph sequences (simple and weighted graphs), we prove convergence and provide rate of convergence of solutions for the discrete models to the solution of the continuous problem as the number of vertices grows. We finally touch on the limit as p → ∞ in these approximations and get uniform convergence results.

In this paper we study numerical approximations of the evolution problem governed by the nonlocal p-Laplacian operator with a given kernel and homogeneous Neumann boundary conditions. More precisely, we consider discretized versions on inhomogeneous random graph sequences, establish their continuum limits and provide error bounds with nonasymptotic rate of convergence of solutions of the discrete problems to their continuum counterparts as the number of vertices grows. Our bounds reveal the role of the different parameters that come into play, and in particular that of p and of the geometry/regularity of the initial data and the kernel.

In this paper, we study a nonlocal variational problem which consists of minimizing in L 2 the sum of a quadratic data fidelity and a regularization term corresponding to the L p -norm of the nonlocal gradient. In particular, we study convergence of the numerical solution to a discrete version of this nonlocal variational problem to the unique solution of the continuum one. To do so, we derive an error bound and highlight the role of the initial data and the kernel governing the nonlocal interactions. When applied to variational problem on graphs, this error bound allows us to show the consistency of the discretized variational problem as the number of vertices goes to infinity. More precisely, for networks in convergent graph sequences (simple and weighted deterministic dense graphs as well as random inhomogeneous graphs), we prove convergence and provide rate of convergence of solutions for the discrete models to the solution of the continuum problem as the number of vertices grows.

No abstract