Related papers: Constants and heat flow on graphs
We consider graph diffusion processes constructed from finite i.i.d. samples drawn from an unknown manifold embedded in ambient Euclidean space, where the graph affinity is defined by an ambient Gaussian kernel matrix. We show that the…
In this paper, we introduce Cheeger type constants via isocapacitary constants introduced by Maz'ya to estimate first Dirichlet, Neumann and Steklov eigenvalues on a finite subgraph of a graph. Moreover, we estimate the bottom of the…
This paper deals with the large-scale behaviour of nonlinear minimum-cost flow problems on random graphs. In such problems, a random nonlinear cost functional is minimised among all flows (discrete vector-fields) with a prescribed net flux…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
We consider a shear flow of a scale invariant homogeneous Gaussian random velocity field which does not depend on coordinates in the direction of the flow. We investigate a heat advection coming from a Gaussian random homogeneous source. We…
We present an analysis on the convergence properties of the so-called geometric heat flow equation for computing geodesics (extremal curves) on Riemannian manifolds. Computing geodesics numerically in real time has become an important…
For each $t \in \mathbf{R}$, define the entire function $$ H_t(z) := \int_0^\infty e^{tu^2} \Phi(u) \cos(zu)\ du$$ where $\Phi$ is the super-exponentially decaying function $$ \Phi(u) := \sum_{n=1}^\infty (2\pi^2 n^4 e^{9u} - 3\pi n^2…
By the method of discrete Morse flows, we construct an energy reducing multiple-valued function flow. The flow we get is Holder continuous with respect to the L-2 norm. We also give another way of constructing flows in some special cases,…
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
The error estimation for eigenvalues and eigenvectors of a small positive symmetric perturbation on the spectrum of a graph Laplacian is related to Gau{\ss} hypergeometric functions. Based on this, a heuristic polynomial-time algorithm for…
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 study mean curvature flows in a warped product manifold defined by a closed Riemannian manifold and $\mathbb{R}$. In such a warped product manifold, we can define the notion of a graph, called a geodesic graph. We prove that the curve…
The main objective of the present work is to study the negative spectrum of (differential) Laplace operators on metric graphs as well as their resolvents and associated heat semigroups. We prove an upper bound on the number of negative…
This work studies the spectral convergence of graph Laplacian to the Laplace-Beltrami operator when the graph affinity matrix is constructed from $N$ random samples on a $d$-dimensional manifold embedded in a possibly high dimensional…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
In this note we consider a more general version of local sparsity introduced recently by Anderson, Kuchukova, and the author. In particular, we say a graph $G = (V, E)$ is $(k, r)$-locally-sparse if for each vertex $v \in V(G)$, the…
We present an experimental study on steady gravity currents advancing along a heated wall. The current is generated by a mixture of air and carbon dioxide continuously supplied at the channel inlet. To have a complete point-wise…
Motivated by the search for sharp bounds on turbulent heat transfer as well as the design of optimal heat exchangers, we consider incompressible flows that most efficiently cool an internally heated disc. Heat enters via a distributed…
We consider a dual Cheeger constant $\overline h$ for finite graphs with edge weights from an arbitrary real-closed ordered field. We obtain estimates of $\overline h$ in terms of number of vertices in graph. Further, we estimate the…
The second eigenvalue of the Laplacian matrix and its associated eigenvector are fundamental features of an undirected graph, and as such they have found widespread use in scientific computing, machine learning, and data analysis. In many…