Related papers: Intrinsic metrics on graphs: A survey
This chapter reviews some past and recent developments in shape comparison and analysis of curves based on the computation of intrinsic Riemannian metrics on the space of curves modulo shape-preserving transformations. We summarize the…
We show that the deficiency indices of the minimal Gaffney Laplacian on an infinite locally finite metric graph are equal to the number of finite volume graph ends. Moreover, we provide criteria, formulated in terms of finite volume graph…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
Recently, Le Donne and the author introduce a notion of intrinsically Lipschitz graphs in metric spaces. The idea of this paper is to investigate about the properties of the intrinsically Lipschitz constants. More precisely, we give the…
We construct a family of self-adjoint operators on the prime numbers whose entries depend on pairwise arithmetic divergences, replacing geometric distance with number-theoretic dissimilarity. The resulting spectra encode how coherence…
We present a study of what may be called an intrinsic metric for a general regular Dirichlet form. For such forms we then prove a Rademacher type theorem. For strongly local forms we show existence of a maximal intrinsic metric (under a…
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…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…
In this paper, we study the average size of independent (vertex) sets of a graph. This invariant can be regarded as the logarithmic derivative of the independence polynomial evaluated at $1$. We are specifically concerned with extremal…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
We study the connection between the dimension of certain spaces of harmonic functions on a group and its geometric and algebraic properties. Our main result shows that (for sufficiently "nice" random walk measures) a connected, compactly…
In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…
The purpose of this paper is to explore the asymptotics of the eigenvalue spectrum of the Laplacian on 2 dimensional spaces of constant curvature, giving strong experimental evidence for a conjecture of the second author…
In the paper we are dealing with metric measure spaces of diameter at most one and of total measure one. Gromov introduced the sampling compactification of the set of these spaces. He asked whether the metric measure space invariants extend…
In this paper we derive a Large Deviation Principle (LDP) for inhomogeneous U/V-statistics of a general order. Using this, we derive a LDP for two types of statistics: random multilinear forms, and number of monochromatic copies of a…
We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…
It is by now well established that, by means of the integration by part identities, all the integrals occurring in the evaluation of a Feynman graph of given topology can be expressed in terms of a few independent master integrals. It is…
Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal…