arXiv subjects
Publications and source records attributed to Norbert Peyerimhoff.
In this paper, we introduce the magnetic Steklov operator on differential forms and show that the underlying boundary value problem is well-posed. Moreover, we show that an analogue of the Diamagnetic Inequality does not always hold for this operator, and we present some spectral computations of magnetic Steklov operators for $2$-dimensional and $4$-dimensional balls in Euclidean space.
We consider simply connected Riemannian manifolds without conjugate points for which the horospherical mean curvature function is continuous, reversible and invariant under the geodesic flow. We show under mild additional curvature tensor conditions that rank one manifolds in this family are automatically asymptotically harmonic. In particular, compact rank one manifolds of this kind must be locally symmetric spaces of negative curvature. Moreover, we show under the same conditions that rank one D'Atri spaces without conjugate points are harmonic. An earlier result of this type was proved by Druetta for certain homogeneous D'Atri spaces.
We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we get a sharp estimate for the first non-trivial Steklov eigenvalue via Escobar Cheeger constant. At the end, we extend Hassannezhad and Miclo's convergence result to non-reversible Markov chains via a different method based on resolvent convergence, answering one of their questions.
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete bipartite graphs and suspensions of trees and derive various lower and upper bounds. In particular, we provide a sharp upper bound for regular bipartite graphs and derive a direct relation between the class of graphs assuming this upper bound and the class of unit weighing matrices, which are generalizations of complex Hadamard matrices. Moreover, this class of bipartite graphs has non-negative magnetic Bakry-\'Emery curvature and is preserved under both the Cartesian product and a partial tensor product for bipartite graphs. The study of our invariant for certain pairs of cospectral graphs indicates also that this invariant allows us to distinguish between them. Finally, we discuss the behaviour of this invariant under various graph operations and investigate relations to the spectral gap.
We consider the magnetic Steklov eigenvalue problem on compact Riemannian manifolds with boundary for generic magnetic potentials and establish various results concerning the spectrum. We provide equivalent characterizations of magnetic Steklov operators which are unitarily equivalent to the classical Steklov operator and study bounds for the smallest eigenvalue. We prove a Cheeger-Jammes type lower bound for the first eigenvalue by introducing magnetic Cheeger constants. We also obtain an analogue of an upper bound for the first magnetic Neumann eigenvalue due to Colbois, El Soufi, Ilias and Savo. In addition, we compute the full spectrum in the case of the Euclidean $2$-ball and $4$-ball for a particular choice of magnetic potential given by Killing vector fields, and discuss the behavior. Finally, we establish a comparison result for the magnetic Steklov operator associated with the manifold and the square root of the magnetic Laplacian on the boundary, which generalizes the uniform geometric upper bounds for the difference of the corresponding eigenvalues in the non-magnetic case due to Colbois, Girouard and Hassannezhad.
We present a relation between volumes of certain lower dimensional simplices associated to a full-dimensional primal and polar dual polytope in R^k. We then discuss an application of this relation to a geometric construction of a Colin de Verdiere matrix by Ivan Izmestiev. In the second part of the paper, we introduce a variation of vertex transitive polytopes, translate their associated Colin de Verdiere matrices into random walk matrices, and investigate extremality properties of the spectral gaps of these random walk matrices in two concrete examples - permutahedra of Coxeter groups and polytopes associated to the pure rotational tetrahedral group - where maximal spectral gaps correspond to equilateral polytopes.
The $k$-CombDMR problem is that of determining whether an $n \times n$ distance matrix can be realised by $n$ vertices in some undirected graph with $n + k$ vertices. This problem has a simple solution in the case $k=0$. In this paper we show that this problem is polynomial time solvable for $k=1$ and $k=2$. Moreover, we provide algorithms to construct such graph realisations by solving appropriate 2-SAT instances. In the case where $k \geq 3$, this problem is NP-complete. We show this by a reduction of the $k$-colourability problem to the $k$-CombDMR problem. Finally, we discuss the simpler polynomial time solvable problem of tree realisability for a given distance matrix.
In this note, we provide Steinerberger curvature formulas for block graphs, discuss curvature relations between two graphs and the graph obtained by connecting them via a bridge, and show that self-centered Bonnet-Myers sharp graphs are precisely those which are antipodal. We also discuss similarities and differences between Steinerberger and Ollivier Ricci curvature results.
In this paper we consider global $\theta$-curvatures of finite Markov chains with associated means $\theta$ in the spirit of the entropic curvature (based on the logarithmic mean) by Erbar-Maas and Mielke. As in the case of Bakry-\'Emery curvature, we also allow for a finite dimension parameter by making use of an adapted $\Gamma$ calculus for $\theta$-curvatures. We prove explicit positive lower curvature bounds (both finite- and infinite-dimensional) for finite abelian Cayley graphs. In the case of cycles, we provide also an upper curvature bound which shows that our lower bounds are asymptotically sharp (up to a logarithmic factor). Moreover, we prove new universal lower curvature bounds for finite Markov chains as well as curvature perturbation results (allowing, in particular, to compare entropic and Bakry-\'Emery curvatures). Finally, we present examples where entropic curvature differs significantly from other curvature notions like Bakry-\'Emery curvature or Ollivier Ricci and sectional curvatures.
In this paper, we propose a generalization of Bakry-\'Emery's calculus which allows us to formulate both Bakry-\'Emery and entropic curvature simultaneously. This formulation represents both curvatures as an integral of the Bochner formula against some measure. This leads to a natural optimality criterion of measures, which we investigate in the Bakry-\'Emery setting. Moreover, our approach leads also to a dimension parameter in the framework of entropic curvature. We also present gradient estimate applications, that is, diameter estimates for Markov chains with strictly positive entropic curvature and a spectral gap estimate. The latter implies non-existence of non-negatively curved expanders.
In this article we study two discrete curvature notions, Bakry-\'Emery curvature and Ollivier Ricci curvature, on Cayley graphs. We introduce Right Angled Artin-Coxeter Hybrids (RAACHs) generalizing Right Angled Artin and Coxeter groups (RAAGs and RACGs) and derive the curvatures of Cayley graphs of certain RAACHs. Moreover, we show for general finitely presented groups $\Gamma = \langle S \, \mid\, R \rangle$ that addition of relators does not lead to a decrease the weighted curvatures of their Cayley graphs with adapted weighting schemes.
We show various sharp Hardy-type inequalities for the linear and quasi-linear Laplacian on non-compact harmonic manifolds with a particular focus on the case of Damek-Ricci spaces. Our methods make use of the optimality theory developed by Devyver/Fraas/Pinchover and Devyver/Pinchover and are motivated by corresponding results for hyperbolic spaces by Berchio/Ganguly/Grillo, and Berchio/Ganguly/Grillo/Pinchover.
In this second part of a sequence of two papers, we discuss the implementation of a curvature flow on weighted graphs based on the Bakry-\'Emery calculus. This flow can be adapted to preserve the Markovian property and its limits as time goes to infinity turn out to be curvature sharp weighted graphs. After reviewing some of the main results of the first paper concerned with the theoretical aspects, we present various examples (random graphs, paths, cycles, complete graphs, wedge sums and Cartesian products of complete graphs, hypercubes) and exhibit further properties of this flow. One particular aspect in our investigations is asymptotic stability and instability of curvature flow equilibria. The paper ends with a description of the available Python functions and routines available in the ancillary file. We hope that the explanations of the Python implementation via examples will help users to carry out their own curvature flow experiments.
In this paper we introduce the magnetic Hodge Laplacian, which is a generalization of the magnetic Laplacian on functions to differential forms. We consider various spectral results, which are known for the magnetic Laplacian on functions or for the Hodge Laplacian on differential forms, and discuss similarities and differences of this new ``magnetic-type'' operator.
In this sequence of two papers, we introduce a curvature flow on (mixed) weighted graphs which is based on the Bakry-\'Emery calculus. The flow is described via a time-continuous evolution through the weighting schemes. By adapting this flow to preserve the Markovian property, its limits turn out to be curvature sharp. Our aim is to present the flow in the most general case of not necessarily reversible random walks allowing laziness, including vanishing transition probabilities along some edges ("degenerate" edges). This approach requires to extend all concepts (in particular, the Bakry-\'Emery curvature related notions) to this general case and it leads to a distinction between the underlying topology (a mixed combinatorial graph) and the weighting scheme (given by transition rates). We present various results about curvature sharp vertices and weighted graphs as well as some fundamental properties of this new curvature flow. This paper is accompanied by a second paper discussing the curvature flow implementation in Python for practical use. In this second paper we present examples and exhibit further properties of the flow.
Given a manifold (or, more generally, a developable orbifold) $M_0$ and two closed Riemannian manifolds $M_1$ and $M_2$ with a finite covering map to $M_0$, we give a spectral characterisation of when they are equivalent Riemannian covers (in particular, isometric), assuming a representation-theoretic condition of "homological wideness": if $M$ is a common finite cover of $M_1$ and $M_2$ and $G$ is the covering group of $M$ over $M_0$, the condition involves the action of $G$ on the first homology group of $M$ (it holds, for example, when there exists a rational homology class on $M$ whose orbit under $G$ consists of $|G|$ linearly independent homology classes). We prove that, under this condition, Riemannian covering equivalence is the same as isospectrality of finitely many twisted Laplacians on the manifolds, acting on sections of flat bundles corresponding to specific representations of the fundamental groups of the manifolds involved. Using the same methods, we provide spectral criteria for weak conjugacy and strong isospectrality. In the negative curvature case, we formulate an analogue of our result for the length spectrum. The proofs are inspired by number-theoretical analogues. We study examples where the representation theoretic condition does and does not hold. For example, when $M_1$ and $M_2$ are commensurable non-arithmetic closed Riemann surfaces of negative Euler characteristic, there is always such an $M_0$, and the condition of homological wideness always holds.
We study the problem $\#\mathrm{EdgeSub}(\Phi)$ of counting $k$-edge subgraphs satisfying a given graph property $\Phi$ in a large host graph $G$. Building upon the breakthrough result of Curticapean, Dell and Marx (STOC 17), we express the number of such subgraphs as a finite linear combination of graph homomorphism counts and derive the complexity of computing this number by studying its coefficients. Our approach relies on novel constructions of low-degree Cayley graph expanders of $p$-groups, which might be of independent interest. The properties of those expanders allow us to analyse the coefficients in the aforementioned linear combinations over the field $\mathbb{F}_p$ which gives us significantly more control over the cancellation behaviour of the coefficients. Our main result is an exhaustive and fine-grained complexity classification of $\#\mathrm{EdgeSub}(\Phi)$ for minor-closed properties $\Phi$, closing the missing gap in previous work by Roth, Schmitt and Wellnitz (ICALP 21). Additionally, we observe that our methods also apply to modular counting. Among others, we investigate the problems of modular counting of paths, cycles, forests and matroid bases. In the course of our investigations we also provide an exhaustive parameterized complexity classification for the problem of counting graph homomorphisms modulo a prime $p$.
In this paper, we reformulate the Bakry-\'Emery curvature on a weighted graph in terms of the smallest eigenvalue of a rank one perturbation of the so-called curvature matrix using Schur complement. This new viewpoint allows us to show various curvature function properties in a very conceptual way. We show that the curvature, as a function of the dimension parameter, is analytic, strictly monotone increasing and strictly concave until a certain threshold after which the function is constant. Furthermore, we derive the curvature of the Cartesian product using the crucial observation that the curvature matrix of the product is the direct sum of each component. Our approach of the curvature functions of graphs can be employed to establish analogous results for the curvature functions of weighted Riemannian manifolds. Moreover, as an application, we confirm a conjecture (in a general weighted case) of the fact that the curvature does not decrease under certain graph modifications.