Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Abstract : 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.
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02969862
Contributor : Imad El Bouchairi <>
Submitted on : Friday, October 16, 2020 - 11:10:26 PM
Last modification on : Tuesday, October 20, 2020 - 11:04:08 AM

File

p-Laplaciansparse.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02969862, version 1

Citation

Imad Bouchairi, Jalal Fadili, Abderrahim Elmoataz. Continuum limit of p-Laplacian evolution problems on graphs: $L^q$ graphons and sparse graphs. 2020. ⟨hal-02969862⟩

Share

Metrics

Record views

31

Files downloads

35