Results 11 to 20 of about 26,406 (246)

Persistent path Laplacian

open access: yesFoundations of Data Science, 2023
30 page, 7 ...
Wang, Rui, Wei, Guo-Wei
openaire   +4 more sources

Multiscale laplacian learning

open access: yesApplied Intelligence, 2022
Machine learning methods have greatly changed science, engineering, finance, business, and other fields. Despite the tremendous accomplishments of machine learning and deep learning methods, many challenges still remain. In particular, the performance of machine learning methods is often severely affected in case of diverse data, usually associated ...
Ekaterina Merkurjev   +2 more
openaire   +3 more sources

Laplacian simplices

open access: yesAdvances in Applied Mathematics, 2020
This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a systematic investigation of $T_G$ for trees, cycles, and complete graphs is provided. Motivated by a conjecture of Hibi
Braun, Benjamin, Meyer, Marie
openaire   +3 more sources

Scaling Laplacian Pyramids [PDF]

open access: yesSIAM Journal on Matrix Analysis and Applications, 2015
Laplacian pyramid based Laurent polynomial (LP$^2$) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate when such matrices are scalable, that is when right multiplication by Laurent polynomial diagonal matrices ...
Hur, Youngmi, Okoudjou, Kasso A.
openaire   +2 more sources

Stochastic Laplacian growth [PDF]

open access: yesPhysical Review E, 2016
A point source on a plane constantly emits particles which rapidly diffuse and then stick to a growing cluster. The growth probability of a cluster is presented as a sum over all possible scenarios leading to the same final shape. The classical point for the action, defined as a minus logarithm of the growth probability, describes the most probable ...
Alekseev, Oleg, Mineev-Weinstein, Mark
openaire   +3 more sources

On Laplacian Equienergetic Signed Graphs

open access: yesJournal of Mathematics, 2021
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj   +1 more source

The Characterizing Properties of (Signless) Laplacian Permanental Polynomials of Almost Complete Graphs

open access: yesJournal of Mathematics, 2021
Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
doaj   +1 more source

Numerical Simulation of Higher-Order Nonlinearity of Human Brain Functional Connectivity Using Hypergraph p-Laplacian

open access: yesMathematics, 2021
Unravelling how the human brain structure gives rise to function is a central question in neuroscience and remains partially answered. Recent studies show that the graph Laplacian of the human brain’s structural connectivity (SC) plays a dominant role in
Jichao Ma   +3 more
doaj   +1 more source

An integrated exploration of heat kernel invariant feature and manifolding technique for 3D object recognition system

open access: yesActa Scientiarum: Technology, 2023
Spectral Graph theory has been utilized frequently in the field of Computer Vision and Pattern Recognition to address challenges in the field of Image Segmentation and Image Classification.
Subramaniam Usha   +3 more
doaj   +1 more source

On graphs with distance Laplacian eigenvalues of multiplicity n−4

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj   +1 more source

Home - About - Disclaimer - Privacy