Related papers: Graphs of multifunctions
In the present paper we will introduce a new approach to multivariate interpolation by employing polyharmonic functions as interpolants, i.e. by solutions of higher order elliptic equations. We assume that the data arise from $C^{\infty}$…
We study the Laplacian on a metrized graph, and its eigenfunctions.
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to…
Our previous multiscale graph basis dictionaries/graph signal transforms -- Generalized Haar-Walsh Transform (GHWT); Hierarchical Graph Laplacian Eigen Transform (HGLET); Natural Graph Wavelet Packets (NGWPs); and their relatives -- were…
Generalized analytic functions over generalized analytic manifolds are build from sums of convergent real power series with non-negative real exponents (and some well-ordering condition on the support). In a paper by Mart\'in-Villaverde,…
We prove that every locally pluripolar set on a compact complex manifold is pluripolar. This extends similar results in K\"ahler case.
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
We show how to extrapolate an analytic function (or a smooth signal) by multiplying and dividing its values on geometric sequences that collapse to a point.
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
We extend certain classical theorems in pluripotential theory to a class of functions defined on the support of a $(1,1)$-closed positive current $T$, analogous to plurisubharmonic functions, called $T$-plurisubharmonic functions. These…
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
We show that a function is real analytic at the origin iff it is arc-analytic, has a subanalytic graph, and its restriction to every monomial curve is analytic. This complements recent results of Kucharz and Kurdyka.
In this note, we present a simple directed graph proof of Sharkovsky's theorem.
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…
Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…