Related papers: A Graph Spectral Flow for Computing Nodal Deficien…
We use the time real analyticity of Ricci flow proved by Kotschwar to extend a result in ~\cite{B}, namely, we prove that the Laplace spectra of negatively curved compact surfaces having same genus $\gamma \geq 2$, same area and same…
For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…
The models that are based of fractional derivatives should be highlighted among promising new models to describe turbulent fluid flows. In the present work, a steady-state flow in a duct is considered under the condition that the turbulent…
In this paper, we consider the interpretability of the foundational Laplacian-based semi-supervised learning approaches on graphs. We introduce a novel flow-based learning framework that subsumes the foundational approaches and additionally…
This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…
We are interested in existence of gradient flows for shape functionals especially for first Laplacian eigenvalues. We introduce different techniques to prove existence and use different formulations for gradient flows. We apply a…
The purpose of these notes is to provide an introduction to those who want to learn more about translating solitons for the mean curvature flow in $\mathbb{R}^3$, particularly those which are complete graphs over domains in $\mathbb{R}^2$.…
We adapt modulus of continuity estimates to the study of spectra of combinatorial graph Laplacians, as well as the Dirichlet spectra of certain weighted Laplacians. The latter case is equivalent to stoquastic Hamiltonians and is of current…
We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of…
We consider the sequence of nodal counts for eigenfunctions of the Laplace-Beltrami operator in two dimensional domains. It was conjectured recently that this sequence stores some information pertaining to the geometry of the domain, and we…
We propose a method to detect outliers in empirically observed trajectories on a discrete or discretized manifold modeled by a simplicial complex. Our approach is similar to spectral embeddings such as diffusion-maps and Laplacian…
We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
We study the asymptotic behavior of the solutions of a spectral problem for the Laplacian in a domain with rapidly oscillating boundary. We consider the case where the eigenvalue of the limit problem is multiple. We construct the leading…
In this paper, we propose a proof-of-concept Graph Neural Network model that can successfully predict network flow-level traffic (NetFlow) by accurately modelling the graph structure and the connection features. We use sliding-windows to…
In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…
It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…