Results 121 to 130 of about 249,692 (322)
On generalized common quasi-eigenvector problems [PDF]
Ali Farajzadeh +58 more
openalex +1 more source
Three Hypergraph Eigenvector Centralities
Eigenvector centrality is a standard network analysis tool for determining the importance of (or ranking of) entities in a connected system that is represented by a graph. However, many complex systems and datasets have natural multi-way interactions that are more faithfully modeled by a hypergraph.
openaire +3 more sources
ABSTRACT Background Appropriate medical therapy (AMT) is first‐line treatment for patients with chronic rhinosinusitis (CRS). We evaluated inflammatory structure, treatment‐induced changes, and biomarker‐outcome associations in AMT‐managed patients. Methods Fifty‐one CRS patients were evaluated before and after AMT which included a combination of oral ...
Asher C. Park +9 more
wiley +1 more source
Asymptotic Inference for Eigenvectors
Abstract : Asymptotic procedures are given for testing certain hypotheses concerning eigenvectors and for constructing confidence regions for eigenvectors. These asymptotic procedures are derived under fairly general conditions on the estimates of the matrix whose eigenvectors are of interest. Applications of the general results to principal components
openaire +3 more sources
Morphology, mechanical properties and vibration damping properties of polyurea/GNP nanocomposites. ABSTRACT Studying structural dynamics of polyurea (PU) is pivotal to analyze its vibration‐damping features. In this study, a graphene‐reinforced PU coating with enhanced mechanical and damping properties was developed.
Haochen Yuan +4 more
wiley +1 more source
Feedback stabilisation of switched systems via iterative approximate eigenvector assignment [PDF]
Hernan Haimovich, Julio H. Braslavsky
openalex +1 more source
Quantum Carnot Bound from Petz Recovery Maps
A quantum bound (ηP$\eta_P$, the Petz Limit) is derived for the efficiency (η$\eta$) of a heat engine utilizing two‐level quantum systems (qubits) as the working substance. This limit, based on Petz recovery maps, is stricter than the classical Carnot limit (ηC$\eta_C$) for irreversible cycles.
Douglas Mundarain +2 more
wiley +1 more source
Eigenvectors in bottleneck algebra
The paper deals with a characterization of the eigenvectors in terms of the associated graph and with an alternative way of computing them. Upper and lower bounds for all eigenvectors are given. The approach is illustrated by several numerical examples.
openaire +2 more sources
Efficient Dynamics: Reduced‐Order Modeling of the Time‐Dependent Schrödinger Equation
Reduced‐order modeling (ROM) approaches for the time‐dependent Schrödinger equation are investigated, highlighting their ability to simulate quantum dynamics efficiently. Proper Orthogonal Decomposition, Dynamic Mode Decomposition, and Reduced Basis Methods are compared across canonical systems and extended to higher dimensions.
Kolade M. Owolabi
wiley +1 more source
Limitations in the spectral method for graph partitioning: Detectability threshold and localization of eigenvectors [PDF]
Tatsuro Kawamoto, Yoshiyuki Kabashima
openalex +1 more source

