Continuum limit of $p$-biharmonic equations on graphs

• URL: http://arxiv.org/abs/2404.19689v1
• Date: Tue, 30 Apr 2024 16:29:44 GMT
• Title: Continuum limit of $p$-biharmonic equations on graphs
• Authors: Kehan Shi, Martin Burger,
• Abstract summary: The behavior of the solution is investigated when the random geometric graph is considered and the number of data points goes to infinity. We show that the continuum limit is an appropriately weighted $p$-biharmonic equation with homogeneous Neumann boundary conditions.
• Score: 3.79830302036482
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper studies the $p$-biharmonic equation on graphs, which arises in point cloud processing and can be interpreted as a natural extension of the graph $p$-Laplacian from the perspective of hypergraph. The asymptotic behavior of the solution is investigated when the random geometric graph is considered and the number of data points goes to infinity. We show that the continuum limit is an appropriately weighted $p$-biharmonic equation with homogeneous Neumann boundary conditions. The result relies on the uniform $L^p$ estimates for solutions and gradients of nonlocal and graph Poisson equations. The $L^\infty$ estimates of solutions are also obtained as a byproduct.

Related papers

• Data subsampling for Poisson regression with pth-root-link [53.63838219437508]
  We develop and analyze data subsampling techniques for Poisson regression. In particular, we consider the Poisson generalized linear model with ID- and square root-link functions.
  arXiv  Detail & Related papers  (2024-10-30T10:09:05Z)
• Convergence rates for Poisson learning to a Poisson equation with measure data [2.7961972519572447]
  We prove discrete to continuum convergence rates for Poisson Learning, a graph-based semi-supervised learning algorithm. We show how to regularize the graph Poisson equation via mollification with the graph heat kernel. We obtain convergence rates that scale up to logarithmic factors, like $O(varepsilonfrac1d+2)$ for general data distributions, and $O(varepsilonfrac2-sigmad+4)$ for uniformly distributed data.
  arXiv  Detail & Related papers  (2024-07-09T11:54:34Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Detection of Dense Subhypergraphs by Low-Degree Polynomials [72.4451045270967]
  Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem. We consider detecting the presence of a planted $Gr(ngamma, n-alpha)$ subhypergraph in a $Gr(n, n-beta) hypergraph. Our results are already new in the graph case $r=2$, as we consider the subtle log-density regime where hardness based on average-case reductions is not known.
  arXiv  Detail & Related papers  (2023-04-17T10:38:08Z)
• Rates of Convergence for Regression with the Graph Poly-Laplacian [3.222802562733786]
  Higher order regularity can be obtained via replacing the Laplacian regulariser with a poly-Laplacian regulariser. We consider graph poly-Laplacian regularisation in a fully supervised, non-parametric, noise corrupted, regression problem.
  arXiv  Detail & Related papers  (2022-09-06T08:59:15Z)
• Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth [1.52292571922932]
  We study a family of Hamilton-Jacobi equations on graphs that we call the $p$-eikonal equation. We show that the $p$-eikonal equation with $p=1$ is a provably robust distance-type function on a graph. We consider applications of the $p$-eikonal equation to data depth and semi-supervised learning, and use the continuum limit to prove consistency results for both applications.
  arXiv  Detail & Related papers  (2022-02-17T17:50:55Z)
• Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields [51.07460861448716]
  This paper presents a convex-analytic framework to learn from data. We show that a triangular convexity decomposition is guaranteed by a transform of the corresponding to its upper part.
  arXiv  Detail & Related papers  (2021-09-17T17:46:12Z)
• Continuum Limit of Lipschitz Learning on Graphs [0.0]
  We prove continuum limits of Lipschitz learning using $Gamma$-convergence. We show compactness of functionals which implies convergence of minimizers.
  arXiv  Detail & Related papers  (2020-12-07T15:10:35Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Rates of Convergence for Laplacian Semi-Supervised Learning with Low Labeling Rates [3.867363075280544]
  We study graph-based Laplacian semi-supervised learning at low labeling rates. At very low label rates, Laplacian learning becomes degenerate and the solution is roughly constant with spikes at each labeled data point.
  arXiv  Detail & Related papers  (2020-06-04T10:46:01Z)
• Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions [84.49087114959872]
  We provide the first non-asymptotic analysis for finding stationary points of nonsmooth, nonsmooth functions. In particular, we study Hadamard semi-differentiable functions, perhaps the largest class of nonsmooth functions.
  arXiv  Detail & Related papers  (2020-02-10T23:23:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.