Results 61 to 70 of about 121,870 (266)

Eigenvector-based identification of bipartite subgraphs

, 2018
We report our experiments in identifying large bipartite subgraphs of simple connected graphs which are based on the sign pattern of eigenvectors belonging to the extremal eigenvalues of different graph matrices: adjacency, signless Laplacian, Laplacian,
Asratian, Baker, Barabási, Bylka, Chao, Chung, Dall, Debdas Paul, de la Peña, Dragan Stevanović, Edwards, Erds, Erdös, Erdös, Estrada, Estrada, Estrada, Gilbert, Goemans, Grone, Guillaume, Guillaume, Holme, Håstad, Michael, Mitzenmacher, Moon, Moon, Motwani, Newman, Newman, Pavlopoulos, Pavlopoulos, Penrose, Perron, Pillai, Platig, Pržulj, Roth, Roy, Sachs, Schweitzer, Watts   +42 more
core   +1 more source

The p-spectral radius of the Laplacian matrix

Applicable Analysis and Discrete Mathematics, 2018
The p-spectral radius of a graph G=(V,E) with adjacency matrix A is defined as ?(p)(G) = max||x||p=1 xT Ax. This parameter shows connections with graph invariants, and has been used to generalize some extremal problems. In this work, we define the p-spectral radius of the Laplacian matrix L as ?(p)(G) = max||x||p=1 xT Lx.
Borba, Elizandro Max, Fritscher, Eliseu, Hoppen, Carlos, Richter, Sebastian   +3 more
openaire   +2 more sources

From Cell‐Free Transcriptomes to Single‐Cell Landscapes: Biomarker Discovery and Originating Cell Alteration Analysis via Graph Matrix Factorization

Advanced Science, EarlyView.
CellFreeGMF traces plasma cfRNA to likely originating cell types by integrating single‐cell atlases with graph‐regularized matrix factorization. The method decomposes cfRNA profiles into sample–cell contributions to reconstruct pseudo single‐cell expression.
Wenxiang Zhang, Wenjing Zhang, Hang Wei, Shiyan Liu, Junliang Shang, Weijie Gong, Hanwen Cheng, Xiujuan Lei, Yuhui Kou, Baoguo Jiang   +9 more
wiley   +1 more source

A Note on the Laplacian Energy of the Power Graph of a Finite Cyclic Group

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi
In this study, the Laplacian matrix concept for the power graph of a finite cyclic group is redefined by considering the block matrix structure. Then, with the help of the eigenvalues of the Laplacian matrix in question, the concept of Laplacian energy ...
Şerife Büyükköse, Nurşah Mutlu Varlıoğlu   +1 more
doaj   +1 more source

Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs

IEEE Access, 2017
This paper investigates the spectra of the adjacency matrix and Laplacian matrix for an artificial complex network model-the generalized random graph. We deduce explicit expressions for the first four asymptotic spectral moments of the adjacency matrix ...
Qun Liu, Zhishan Dong, En Wang
doaj   +1 more source

Strongly Regular Graphs as Laplacian Extremal Graphs [PDF]

, 2014
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph.
Lin, Fan-Hsuan, Weng, Chih-wen
core  

On the Spectral Gap of a Quantum Graph

, 2015
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and combinatorial ...
Kennedy, James B., Kurasov, Pavel, Malenova, Gabriela, Mugnolo, Delio   +3 more
core   +1 more source

Deep Learning Prediction of Surface Roughness in Multi‐Stage Microneedle Fabrication: A Long Short‐Term Memory‐Recurrent Neural Network Approach

Advanced Intelligent Discovery, EarlyView.
A sequential deep learning framework is developed to model surface roughness progression in multi‐stage microneedle fabrication. Using real‐world experimental data from 3D printing, molding, and casting stages, an long short‐term memory‐based recurrent neural network captures the cumulative influence of geometric parameters and intermediate outputs ...
Abdollah Ahmadpour, Sara Soltanabadi Farshi, Tuanna Ozcan, Amir Mohammad Ketabchi, Alper Kiraz, Savas Tasoglu   +5 more
wiley   +1 more source

A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws

Advanced Intelligent Discovery, EarlyView.
The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows, G. Zhang, S. Anand, Z. Chen, J. Lin, A. Desai, S. Martiniani, F. Caravelli   +7 more
wiley   +1 more source

Clustering Vertex-Weighted Graphs by Spectral Methods

Mathematics, 2021
Spectral techniques are often used to partition the set of vertices of a graph, or to form clusters. They are based on the Laplacian matrix. These techniques allow easily to integrate weights on the edges.
Juan-Luis García-Zapata, Clara Grácio
doaj   +1 more source