Related papers: Unique continuation on planar graphs
The continuum Kardar-Parisi-Zhang equation in one dimension is lattice discretized in such a way that the drift part is divergence free. This allows to determine explicitly the stationary measures. We map the lattice KPZ equation to a…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
In this expository paper, we prove strong unique continuation for J-holomorphic curves by first giving a simple proof of Aronszajn's theorem in the special case of the two-dimensional flat Laplacian.
We consider the system of stochastic differential equations dX_t=A(X_{t-}) dZ_t, where Z_t^1, ..., Z^d_t are independent one-dimensional symmetric stable processes of order \alpha, and the matrix-valued function A is bounded, continuous and…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
We study the Dirichlet problem of the following discrete infinity Laplace equation on unbounded subgraphs \begin{equation*} \Delta_{\infty}u(x):=\inf_{y\sim x}u(y)+\sup_{y\sim x}u(y)-2u(x)=f(x). \end{equation*} For the homogeneous case…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
We prove that for a homogeneous linear partial differential operator $\mathcal A$ of order $k \le 2$ and an integrable map $f$ taking values in the essential range of that operator, there exists a function $u$ of special bounded variation…
We present a new, short and independent proof of the Liouville-type theorem for entire and subharmonic functions of finite order bounded outside some set of zero planar density.
We prove the invariance of scalar Feynman graphs of any planar topology under the Yangian level-one momentum symmetry given certain constraints on the propagator powers. The proof relies on relating this symmetry to a planarized version of…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…
We construct a H\"older continuous function on the unit interval which coincides in uncountably (in fact continuum) many points with every function of total variation smaller than 1 passing through the origin. We say that a function with…
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph…
If we perturb a completely integrable Hamiltonian system with two degrees of freedom, the perturbed flow might display, on every energy level, invariant sets that are laminations over Aubry-Mather sets of a Poincar\'e section of the flow.…
We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…
We prove that each discrete set in the Euclidean space that has bounded changes under every translation is a bounded perturbation of a square lattice, i.e., a uniformly spread set in the sense of Laszkovich. In particular, the support of…