In this paper, we describe a methodology for comparing networks represented as weighted graphs. The key idea is to associate a probability density function derived from the graph Laplacian, and then compute the Wasserstein distance between the derived densities of the respective graphs. This has wide applications to various networks including biological and financial.

We study partitions of the two-dimensional flat torus (R/Z) × (R/bZ) into k domains, with b a real parameter in (0, 1] and k an integer. We look for partitions which minimize the energy, defined as the largest first eigenvalue of the Dirichlet Laplacian on the domains of the partition. We are in particular interested in the way these minimal partitions change when b is varied. We present here a...

Laplacian and D’Alembertian operators on functions are very important tools for several branches of Mathematics and Physics. In addition to their relevance, both operators are very used in vector calculus. In this paper, we show a relationship between the Laplacian and the D’Alembertian operators, not only on functions but also on vector fields defined on hypersurfaces in the m-dimensional Lore...

It is well-known that the second smallest eigenvalue 22 of the difference Laplacian matrix of a graph G is related to the expansion properties of G. A more detailed analysis of this relation is given. Upper and lower bounds on the diameter and the mean distance in G in terms of 22 are derived.

Motion editing requires the preservation of spatial and temporal information of the motion. During editing, this information should be preserved at best. We propose a new representation of the motion based on the Laplacian expression of a 3D+t graph: the set of connected graphs given by the skeleton over time. Through this Laplacian representation of the motion, we propose an application which ...

In this paper we discuss compactness of the canonical solution operator to ∂ on weigthed L spaces on C. For this purpose we apply ideas which were used for the Witten Laplacian in the real case and various methods of spectral theory of these operators. We also point out connections to the theory of Dirac and Pauli operators.

We developed a procedure of reducing the number of vertices and edges of a given tree, which we call the " tree simplification procedure, " without changing its topological information. Our motivation for developing this procedure was to reduce computational costs of graph Laplacian eigenvalues of such trees. When we applied this procedure to a set of trees representing dendritic structures of ...

LetB(n, r) be the set of all bicyclic graphs with n vertices and r cut edges. In this paper we determine the unique graph with maximal adjacency spectral radius or signless Laplacian spectral radius among all graphs in B(n, r).

We show that the conformally invariant fractional powers of the sub-Laplacian on the Heisenberg group are given in terms of the scattering operator for an extension problem to the Siegel upper halfspace. Remarkably, this extension problem is different from the one studied, among others, by Caffarelli and Silvestre.