Results 61 to 70 of about 18,314 (299)

JLMC: A clustering method based on Jordan-Form of Laplacian-Matrix [PDF]

open access: yes, 2014
Among the current clustering algorithms of complex networks, Laplacian-based spectral clustering algorithms have the advantage of rigorous mathematical basis and high accuracy.
J Niu (13383387)   +2 more
core  

On some properties of the Laplacian matrix revealed by the RCM algorithm [PDF]

open access: yes, 2016
summary:In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a
Palomares Chust, Alberto   +7 more
core   +1 more source

STAID: A Self‐Refining Deep Learning Framework for Spatial Cell‐Type Deconvolution with Biologically Informed Modeling

open access: yesAdvanced Science, EarlyView.
STAID is a unified deep learning framework that couples iterative pseudo‐spot refinement with neural network training through a feedback loop and exploits gene co‐expression information to model higher‐order interactions, achieving accurate and robust cell‐type deconvolution in spatial transcriptomics.
Jixin Liu   +5 more
wiley   +1 more source

Beyond Electrostatics: Anion‐π+ Orbital Hybridization Underpins High‐Performance Chloride Storage in Poly(arylamine) Organic Cathodes

open access: yesAdvanced Science, EarlyView.
The fundamental nature of anion storage in p‐type organic cathodes is elucidated using rigid poly(arylamine) frameworks. This study reveals a hybrid covalent‐ionic mechanism for anion‐π+ interactions, driven by synergistic orbital hybridization and electrostatic attraction.
Tiantian She   +7 more
wiley   +1 more source

The Adjacency Matrix and the Discrete Laplacian Acting on Forms [PDF]

open access: yesMathematical Physics, Analysis and Geometry, 2019
We study the relationship between the adjacency matrix and the discrete Laplacian acting on 1-forms. We also prove that if the adjacency matrix is bounded from below it is not necessarily essentially self-adjoint. We discuss the question of essential self-adjointness and the notion of completeness.
Hatem Baloudi   +2 more
openaire   +3 more sources

Eigenvalues of the Laplacian matrix. [PDF]

open access: yes, 2014
First eigenvalues in ascending order of the normalized Laplacian matrix relative to the alignment of 2880 H. sapiens promoters. The method used is the Needleman–Wunsch with GAPOPEN and GAPEXTEND for panel A, GAPEXTEND for panel B.
Lucia Pettinato (512883)   +4 more
core   +1 more source

Group inverse matrix of the normalized Laplacian on subdivision networks [PDF]

open access: yes, 2020
In this paper we consider a subdivision of a given network and we show how the group inverse matrix of the normalized laplacian of the subdivision network is related to the group inverse matrix of the normalized laplacian of the initial given network ...
Mitjana Riera, Margarida   +2 more
core   +1 more source

Strain Tuning the Occupation of Candidate Topological Weyl States in W‐Doped MoTe2

open access: yesAdvanced Science, EarlyView.
The present study investigates strain‐induced modifications of the electronic structure in the Weyl semimetal Td${\rm T}_d$‐Mo0.91W0.09Te2${\mathrm{Mo}}_{0.91}{\mathrm{W}}_{0.09}{\mathrm{Te}}_{2}$ using hard X‐ray angle‐resolved photoemission spectroscopy.
Amon Lanz   +21 more
wiley   +1 more source

Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Preserving population diversity and providing knowledge, which are two core tasks in the dynamic multi‐objective optimisation (DMO), are challenging since the sampling space is time‐ and space‐varying. Therefore, the spatiotemporal property of evolutionary information needs to be considered in the DMO.
Qinqin Fan   +3 more
wiley   +1 more source

The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs

open access: yesCommunications in Advanced Mathematical Sciences, 2018
The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$.
Rao Li
doaj   +1 more source

Home - About - Disclaimer - Privacy