The trees, respectively unicyclic graphs, on n vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the n-vertex trees of given bipartition having the second and third smallest Laplacian permanent are identified. Similarly, the n-vertex bipartite unicyclic graphs of given bipartition having the first, second and third smallest Laplacian pe...

Let G be a graph of order n such that ∑n i=0(−1)iaiλn−i and ∑n i=0(−1)ibiλn−i are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that ai ≥ bi for i = 0,1, . . . , n. As a consequence, we prove that for any α, 0 < α ≤ 1, if q1, . . . , qn and μ1, . . . ,μn are the signless Laplacian and the Laplacian eigenvalues of G, respectively,...

Laplacian eigenmap algorithm is a typical nonlinear model for dimensionality reduction in classical machine learning. We propose an efficient quantum Laplacian eigenmap algorithm to exponentially speed up the original counterparts. In our work, we demonstrate that the Hermitian chain product proposed in quantum linear discriminant analysis (arXiv:1510.00113,2015) can be applied to implement qua...

Let (M,ρ, μ) be an RD-space satisfying the non-collapsing condition. In this paper, the authors introduce Besov-type spaces B p,q (M) and Triebel–Lizorkin-type spaces F s,τ p,q (M) associated to a non-negative self-adjoint operator L whose heat kernels satisfy some Gaussian upper bound estimate, Hölder continuity, and the stochastic completeness property. Characterizations of these spaces via P...

In this paper, we present a novel volumetric mesh representation suited for parallel computing on modern GPU architectures. The data structure is based on a compact, ternary sparse matrix storage of boundary operators. Boundary operators correspond to the first-order top-down relations of k-faces to their (k−1)-face facets. The compact, ternary matrix storage format is based on compressed spars...

Let Ω be the upper half plane {(x, y) ∈ R, x > 0, y ∈ R}. Define the Laplacian on Ω to be ∆D = ∂ 2 x + (1 + x)∂ 2 y , together with Dirichlet boundary conditions on ∂Ω: one may easily see that Ω, with the metric inherited from ∆D, is a strictly convex domain. We shall prove that, in such a domain Ω, Strichartz estimates for the wave equation suffer losses when compared to the usual case Ω = R, ...

In this paper, we study the multiplicity of positive solutions for the Laplacian systems with sign-changing weight functions. Using the decomposition of the Nehari manifold, we prove that an elliptic system has at least two positive solutions.

Let G = (V,E) be an undirected graph, LG ∈ R ×V be the associated Laplacian matrix, and b ∈ R V be a vector. Solving the Laplacian system LGx = b has numerous applications in theoretical computer science, machine learning, and network analysis. Recently, the notion of the Laplacian operator LF : R V → 2 V for a submodular transformation F : 2 → RE+ was introduced, which can handle undirected gr...

The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and the structure of ‘local’ subgraphs of the network. We call a subgraph local when it is induced by the set of nodes obtained from a breath-first search (BFS)...

We investigate notions of network centrality in terms the underlying coupling graph network, structure exogenous uncertainties, and communication time-delay. Our focus is on time-delay linear consensus networks, where uncertainty modeled by structured additive noise dynamics agents. The measures are defined using H2-norm network. quantify as functions time-delay, Laplacian, covariance matrix in...