Results 71 to 80 of about 1,624,240 (288)
Laplacian versus adjacency matrix in quantum walk search [PDF]
Quantum Information Processing, 2016 A quantum particle evolving by Schrödinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk.
Thomas G. Wong +2 more
openaire +3 more sources
Robust Representation Learning for Clean Feature Discovery in Incomplete Multi‐View Clustering
Advanced Intelligent Systems, EarlyView.Robust feature discovery in incomplete multi‐view clustering is achieved by coupling RPCA‐based clean representation recovery with neural‐network‐assisted graph learning. The resulting RIMVC framework constructs cleaner and more discriminative graph‐structured representations from incomplete and noisy multi‐view data, improving clustering robustness ...
Ping Hu +4 more
wiley +1 more source
Permanent of the laplacian matrix of trees with a given matching
Discrete Mathematics, 1986 Let \(G=(V,E)\) be an arbitrary graph, and \(d_ i>0\) be the degree of the vertex \(v_ i\in V\). D(G) denotes the diagonal matrix whose (i,i)-entry is \(d_ i\), and A(G) denotes the adjacency matrix of the graph G. The matrix \(L(G)=D(G)-A(G)\) will be called the Laplacian matrix of the graph G.
openaire +2 more sources
Advanced Intelligent Systems, EarlyView.A scalable distributed observer framework for LiDAR sensor networks is presented for robust tracking and pose estimation of mobile robots. By combining adaptable 3D detection, clustering‐based communication reduction, and intermittent inertial fusion, accurate and efficient estimation is achieved under occlusions and sensing constraints, with formally ...
Isabella Luppi, Ehsan Hashemi
wiley +1 more source
On the Eigenvalues and Energy of the Seidel and Seidel Laplacian Matrices of Graphs
Discrete Dynamics in Nature and SocietyLet SΓ be a Seidel matrix of a graph Γ of order n and let DΓ=diagn−1−2d1,n−1−2d2,…,n−1−2dn be a diagonal matrix with di denoting the degree of a vertex vi in Γ. The Seidel Laplacian matrix of Γ is defined as SLΓ=DΓ−SΓ.
J. Askari +2 more
doaj +1 more source
Laplacian matrix learning for smooth graph signal representation [PDF]
2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2015 The construction of a meaningful graph plays a crucial role in the emerging field of signal processing on graphs. In this paper, we address the problem of learning graph Laplacians, which is similar to learning graph topologies, such that the input data form graph signals with smooth variations on the resulting topology.
Dong, Xiaowen +3 more
openaire +3 more sources
Resonant nonlinear periodic problems with the scalar p-Laplacian and a nonsmooth potential [PDF]
, 2006 We study periodic problems driven by the scalar p-Laplacian with a nonsmooth potential. Using the nonsmooth critical point theory for locally Lipsctiz functions,we prove two existence theorems under conditions of resonance at infinity with respect to ...
Staicu, Vasile +6 more
core
On the signless Laplacian and normalized signless Laplacian spreads of graphs
, 2023 summary:Let $G=(V,E)$, $V=\{v_1,v_2,\ldots ,v_n\}$, be a simple connected graph with $n$ vertices, $m$ edges and a sequence of vertex degrees $d_1\geq d_2\geq \cdots \geq d_n$.
Milovanović, Emina +3 more
core +1 more source
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
Journal of New Theory, 2018 We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph.
Shridhar Chandrakant Patekar +1 more
doaj
مجلة بغداد للعلومFor a commutative ring, a cross monic zero divisor graph is discussed, whose vertices are nonzero zero divisors of the commutative ring, then the two vertices x and y are adjacent if and only if xy = 0.
Sarathy Raja, Ravi Sankar Jeyaraj
doaj +1 more source