Related papers: Extremal metrics on graphs I
We investigate properties of the sequences of extremal values that could be achieved by the eigenvalues of the Laplacian on Euclidean domains of unit volume, under Dirichlet and Neumann boundary conditions, respectively. In a second part,…
We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…
It is known that up to certain pathologies, a compact metric graph with standard vertex conditions has a Baire-generic set of choices of edge lengths such that all Laplacian eigenvalues are simple and have eigenfunctions that do not vanish…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…
We explicitly construct parameter transformations between gradient flows in metric spaces, called curves of maximal slope, having different exponents when the associated function satisfies a suitable convexity condition. These…
We consider probability measure preserving discrete groupoids, group actions and equivalence relations in the context of general probability spaces. We study for these objects the notions of cost, $\beta$-invariant and some…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
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…
The extremum value theorem for function spaces plays the central role in optimal control. It is known that computation of optimal control actions and policies is often prone to numerical errors which may be related to computability issues.…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
In the contest of optimal control problems, regularity results for optima are known when addressing fiber-strictly convex Lagrangian. For infinite time horizons, or for settings with infinite dimensional dynamics, the equivalence between…
We introduce a notion of a sheaf of vector spaces on a graph, and develop the foundations of homology theories for such sheaves. One sheaf invariant, its "maximum excess," has a number of remarkable properties. It has a simple definition,…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Let $G$ be a compact connected Lie group of dimension $m$. Once a bi-invariant metric on $G$ is fixed, left-invariant metrics on $G$ are in correspondence with $m\times m$ positive definite symmetric matrices. We estimate the diameter and…
We consider a family of manifolds with a class of degenerating warped product metrics $g_\epsilon=\rho(\epsilon,t)^{2a}dt^2 +\rho(\epsilon,t)^{2b}ds_M^2$, with $M$ compact, $\rho$ homogeneous degree one, $a \le -1$ and $b > 0$. We study the…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…
We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…