Related papers: Geodesic nets via eigenvalue optimisation
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
In this work, we obtain the first upper bound on the multiplicity of Laplacian eigenvalues for negatively curved surfaces which is sublinear in the genus g. Our proof relies on a trace argument for the heat kernel, and on the idea of…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
Recent advancements in the discipline of quantum algorithms have displayed the importance of the geometry of quantum operators. Given this thrust, this paper develops a rigorous geometric framework to analyze how the Riemannian structure of…
We consider the first eigenvalue of the magnetic Laplacian with zero magnetic field on simply connected compact surfaces and we establish isoperimetric inequalities and upper bounds in terms of a bound on the gaussian curvature. As a…
Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the \emph{geodetic set}, \emph{edge geodetic set}, \emph{strong edge geodetic set}, and \emph{monitoring edge geodetic set}, with…
This paper deals with the numerical optimization of the first three eigenvalues of the Laplace-Beltrami operator of domain in the Euclidean sphere in $\mathbb{R}^3$ with Neumann boundary conditions. We address two approaches : the first one…
Given a Riemannian manifold $M$ and an $L^2$-normalized Laplacian eigenfunction $\psi$ on $M$ with eigenvalue $\lambda^2$, a general problem in analysis is to understand how the mass of $\psi$ distributes around $M$. There are different…
We investigate the motion of test particles in quantum-gravitational backgrounds by introducing the concept of q--desics, quantum-corrected analogs of classical geodesics. Unlike standard approaches that rely solely on the expectation value…
In the present paper we use twistor theory in order to solve two problems related to harmonic maps from surfaces to Euclidean spheres $\mathbb{S}^n$. First, we propose a new approach to isoperimetric inequalities based on energy index.…
We propose a method to obtain optimal protocols for adiabatic ground-state preparation near the adiabatic limit, extending earlier ideas from [D. A. Sivak and G. E. Crooks, Phys. Rev. Lett. 108, 190602 (2012)] to quantum non-dissipative…
We study the geodesics on an invariant surface of a three dimensional Riemannian manifold. The main results are: the characterization of geodesic orbits; a Clairaut's relation and its geometric interpretation in some remarkable three…
In this paper we study fundamental properties of geodesic mappings with respect to the smoothness class of metrics. We show that geodesic mappings preserve the smoothness class of metrics. We study geodesic mappings of Einstein spaces.
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
A network of coupled dynamical systems is represented by a graph whose vertices represent individual cells and whose edges represent couplings between cells. Motivated by the impact of synchronization results of the Kuramoto networks, we…
We discuss the design of interlayer edges in a multiplex network, under a limited budget, with the goal of improving its overall performance. We analyze the following three problems separately; first, we maximize the smallest nonzero…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
The original contributions of this paper are twofold: a new understanding of the influence of noise on the eigenvectors of the graph Laplacian of a set of image patches, and an algorithm to estimate a denoised set of patches from a noisy…
In this note we reduce the problem of geodesic connectedness in a wide class of G\"odel type spacetimes to the search of critical points of a functional naturally involved in the study of geodesics in standard static spacetimes. Then, by…
We consider network structures that optimize the $\mathcal{H}_2$ norm of weighted, time scaled consensus networks, under a minimal representation of such consensus networks described by the edge Laplacian. We show that a greedy algorithm…