Results 101 to 110 of about 13,640 (282)
On the Laplacian eigenvalues of a graph and Laplacian energy
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Pirzada, Hilal A. Ganie
openaire +1 more source
Magnetic resonance imaging (MRI)‐guided dopamine transporter (DAT) radiomics combined with machine learning showed promising performance for predicting 4‐year motor progression in Parkinson's disease. Ensemble voting fusion markedly improved discrimination compared with individual base models, with stable predictive features mainly derived from ...
Xiaoxuan Fan +8 more
wiley +1 more source
On the Laplacian coefficients of signed graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BELARDO, FRANCESCO, SIMIC S. K.
openaire +5 more sources
Weak Solutions for a Class of Nonlocal Singular Problems Over the Nehari Manifold
ABSTRACT In this paper, we consider a nonlocal model of dilatant non‐Newtonian fluid with a Dirichlet boundary condition. By using the Nehari manifold and fibering map methods, we obtain the existence of at least two weak solutions, with sign information.
Zhenfeng Zhang +2 more
wiley +1 more source
Interactive Mesh Segmentation Based On Graph Laplacian
This paper introduces a novel algorithm that decomposes a given shape into meaningful parts requiring only strokes to specify foreground and background regions.
Gao EY(高恩阳) +2 more
core
ABSTRACT The GTPase KRAS executes a conformational switch between a GTP‐bound active state and a GDP‐bound inactive state, a process central to oncogenic signaling. However, the structural basis of this switching at the level of residue‐contact organization remains incompletely characterized by traditional binary structural models.
Fatma Senguler Ciftci, Burak Erman
wiley +1 more source
Let Φ(G,λ)=det(λIn-L(G))=∑k=0n(-1)kck(G)λn-k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we give four transforms on graphs that decrease all Laplacian coefficients ck(G) and investigate a conjecture A.
Xinying Pai, Sanyang Liu
doaj +1 more source
Eigenvectors of Graph Laplacians: A Landscape
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on eigenvectors that have zero components and extend the pioneering results of Merris (1998) on graph transformations that
Caputo, J. -G., Knippel, A.
openaire +2 more sources
Frames and factorization of graph Laplacians
Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite) network. Outside degenerate cases, our Parseval frame is not an orthonormal basis.
Palle Jorgensen, Feng Tian
openaire +3 more sources
Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source

