Solving linear system of equations stemming from Laplacian operators is at the heart a wide range applications. Due to sparsity systems, iterative solvers such as Conjugate Gradient and Multigrid are usually employed when solution has large number degrees freedom. These can be seen sparse approximations Green’s function for operator. In this paper we propose machine learning approach that regre...

A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...

in this paper, we try to find a particular combination of wavelet shrinkage and nonlinear diffusion for noise removal in dental images. we selected the wavelet diffusion and modified its automatic threshold selection by proposing new models for speckle related modulus. the laplacian mixture model and circular symmetric laplacian mixture models were evaluated and as it could be expected, the lat...

‎Let $G$ be a graph without an isolated vertex‎, ‎the normalized Laplacian matrix $tilde{mathcal{L}}(G)$‎ ‎is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$‎, where ‎$mathcal{D}$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎G‎$‎‎. ‎The eigenvalues of‎ $tilde{mathcal{L}}(G)$ are ‎called as ‎the ‎normalized Laplacian eigenva...

EXTENDED ABSTRACT. In recent years, networked multi-agent systems have attracted much research attention from various disciplines of engineering and science due to their interdisciplinary nature and broad potential applications. Collective behaviors arise from simple local interaction rules in complex networked systems. Graph Laplacian plays a very important role in analysis of networked multi-...

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

‎let $g$ be a graph without an isolated vertex‎, ‎the normalized laplacian matrix $tilde{mathcal{l}}(g)$‎‎is defined as $tilde{mathcal{l}}(g)=mathcal{d}^{-frac{1}{2}}mathcal{l}(g) mathcal{d}^{-frac{1}{2}}$‎, where ‎$‎mathcal{‎d}‎$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎g‎$‎‎. ‎the eigenvalues of‎‎$tilde{mathcal{l}}(g)$ are ‎called ‎ ‎ as ‎the ‎normalized laplacian ...

We study 22 systems of variational inequalities which are only weakly elliptic; in particular, these systems are not necessarily monotone. The prototype diierential operator is the (vector-valued) p-Laplacian. We prove, under certain conditions, the existence of solutions to the unilateral obstacle problem. In addition, we address the question of determining function spaces on which the p-Lapla...