In this paper, we develop a regularization framework for image deblurring based on a new definition of the normalized graph Laplacian. We apply a fast scaling algorithm to the kernel similarity matrix to derive the symmetric, doubly stochastic filtering matrix from which the normalized Laplacian matrix is built. We use this new definition of the Laplacian to construct a cost function consisting...

This is the third part of our work with a common title. The first [11] and the second part [12] will be also referred in the sequel as Part I and Part II, respectively. This third part was not planned at the beginning, but a lot of recently published papers on the signless Laplacian eigenvalues of graphs and some observations of ours justify its preparation. By a spectral graph theory we unders...

We show here that the problem of maximizing a family of quantitative functions, encompassing both the modularity (Q-measure) and modularity density (D-measure), for community detection can be uniformly understood as a combinatoric optimization involving the trace of a matrix called modularity Laplacian. Instead of using traditional spectral relaxation, we apply additional nonnegative constraint...

We consider a one-phase free boundary problem involving a fractional Laplacian (−∆), 0 < α < 1, and we prove that “flat free boundaries” are C . We thus extend the known result for the case α = 1/2.

Rjk = R̄jk + ∇̄mD jk − ∇̄jD mk −Dn jkD nm −Dn mkD nj . (To see why this is true, just compute in local normal coordinates for ḡ!) From now on all components are tensorial (as opposed to local coordinate components.) The terms involving second covariant derivatives of the metric are: 1 2 g(−∇̄m∇̄lgjk +∇̄m∇̄kgjl +∇̄m∇̄jglk +∇̄j∇̄lgmk−∇̄j∇̄kgml−∇̄j∇̄mglk). The first term is a kind of Laplacian. The third and six...

Let D be a convex planar domain, symmetric about both the xand y-axes, which is strictly contained in (−a, a) × (−b, b) = Γ. It is proved that, unless D is a certain kind of rectangle, the difference (gap) between the first two eigenvalues of the Dirichlet Laplacian in D is strictly larger than the gap for Γ. We show how to give explicit lower bounds for the difference of the gaps.

We show that the zeta function of a regular graph admits a representation as a quotient of a determinant over a L 2-determinant of the combinatorial Laplacian.

We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for developing a spectral theory of graphs based on this matrix. For regular graphs the whole existing theory of spectra of the adjacency matrix and of the Laplacian matrix transfers directly to the signless Laplacian, and so we consider arbitrary graphs with special emphasis on the non-regular case. The ...

This paper is devoted to the study of the eigenpairs of the Dirichlet Laplacian on a family of triangles where two vertices are fixed and the altitude associated with the third vertex goes to zero. We investigate the dependence of the eigenvalues on this altitude. For the first eigenvalues and eigenfunctions, we obtain an asymptotic expansion at any order at the scale cube root of this altitude...

A Hermite type formula is introduced and used to study the zeta function over the real and complex n-projective space. This approach allows to compute the residua at the poles and the value at the origin as well as the value of the derivative at the origin, that gives the regularized determinant of the associated Laplacian operator.