Related papers: Lipschitz regularity of graph Laplacians on random…
We prove that $m$-dimensional Lipschitz graphs with anisotropic mean curvature bounded in $L^p$, $p>m$, are regular almost everywhere in every dimension and codimension. This provides partial or full answers to multiple open questions…
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other…
Probabilistic integration of a continuous dynamical system is a way of systematically introducing model error, at scales no larger than errors introduced by standard numerical discretisation, in order to enable thorough exploration of…
We investigate the paramater of the average range of $M$-Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this…
We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and…
We consider the Dirichlet problem for elliptic systems with periodically distributed inclusions whose conduction parameter exhibits a significant contrast compared to the background media. We develop a unified method to quantify the…
In Hilbert space setting we prove local lipchitzness of projections onto parametric polyhedral sets represented as solutions to systems of inequalities and equations with parameters appearing both in left-hand-sides and right-hand-sides of…
The purpose of this article is to study Lipschitz CR mappings from an $h$-extendible (or semi-regular) hypersurface in $\mbb C^n$. Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A…
In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…
We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…
Several data analysis techniques employ similarity relationships between data points to uncover the intrinsic dimension and geometric structure of the underlying data-generating mechanism. In this paper we work under the model assumption…
In this paper, we investigate eigenvalues of the Dirichlet problem and the closed eigenvalue problem of drifting Laplacian on the complete metric measure spaces and establish the corresponding general formulas. By using those general…
For all $1\leq m\leq n-1$, we investigate the interaction of locally finite measures in $\mathbb{R}^n$ with the family of $m$-dimensional Lipschitz graphs. For instance, we characterize Radon measures $\mu$, which are carried by Lipschitz…
This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…
We prove that $m$-dimensional Lipschitz graphs in any codimension with $C^{1,\alpha}$ boundary and anisotropic mean curvature bounded in $L^p$, $p > m$, are regular at every boundary point with density bounded above by $1/2 +\sigma$,…
The Lipschitz constant is an important quantity that arises in analysing the convergence of gradient-based optimization methods. It is generally unclear how to estimate the Lipschitz constant of a complex model. Thus, this paper studies an…
We consider the linear elliptic systems or equations in divergence form with periodically oscillating coefficients. We prove the large-scale boundary Lipschitz estimate for the weak solutions in domains satisfying the so-called…
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes, which allow a random walker to {\textquotedblleft jump\textquotedblright} to non-neighborhood nodes, most notably the transformed path…
We give dimension-free regularity conditions for a class of possibly degenerate sub-elliptic equations in the Heisenberg group exhibiting super-quadratic growth in the horizontal gradient; this solves an issue raised by Manfredi & Mingione…
Benjamini, Yadin, and Yehudayoff (2007) showed that if the maximum degree of a graph $G$ is 'sub-logarithmic,' then the typical range of random $\mathbb Z$-homomorphisms is super-constant. Furthermore, they showed that there is a sharp…