Results 81 to 90 of about 121,348 (314)
On the Eigenvalues of General Sum-Connectivity Laplacian Matrix [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Hanyuan, Huang, He, Zhang, Jie
openaire +3 more sources
Abstract Aims Population pharmacokinetic (popPK) and pharmacokinetic‐pharmacodynamic (PK/PD) models were developed to support clinical development of nemolizumab, a humanized monoclonal antibody targeting the IL‐31 receptor α, in adolescents and adults with moderate‐to‐severe atopic dermatitis (AD).
Floris Fauchet +17 more
wiley +1 more source
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph.
Shridhar Chandrakant Patekar +1 more
doaj
Degree theory for 4‐dimensional asymptotically conical gradient expanding solitons
Abstract We develop a new degree theory for 4‐dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over S3$S^3$ with non‐negative scalar curvature. We also obtain a similar existence result for cones whose link is diffeomorphic to S3/Γ$S^3/\
Richard H. Bamler, Eric Chen
wiley +1 more source
Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph
Given a signed graph Ġ, let AĠ and DG˙±D_{\dot G}^ \pm denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of Ġ is defined to be NG˙=DG˙±-AG˙{N_{\dot G}} = D_{\dot G}^ \pm - {A_{\dot
Stanić Zoran
doaj +1 more source
Bipartite subgraphs and the signless Laplacian matrix
For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue. We investigate how vectors yielding small values of the Rayleigh quotient for the signless Laplacian matrix can be used to identify bipartite subgraphs.
Steve Kirkland, Debdas Paul
openaire +2 more sources
Abstract Background Cell migration and invasion are well‐coordinated in development and disease but remain poorly understood. We previously showed that the neural crest (NC) cell migratory wavefront shares a 45‐gene panel with other cell invasion phenomena.
J. C. Kasemeier‐Kulesa +3 more
wiley +1 more source
A hybrid RANS‐LES turbulence model adapted for the Moving Particle Semi‐implicit method is employed to investigate a turbulent free surface flow. A method based on the cell‐linked list is proposed to speed up the nearest wall search for the turbulence model.
Fabio Kenji Motezuki +3 more
wiley +1 more source
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Haemers, W.H., Omidi, G.R.
core +1 more source
Forecasting With Machine Learning Shadow‐Rate VARs
ABSTRACT Interest rates are fundamental in macroeconomic modeling. Recent studies integrate the effective lower bound (ELB) into vector autoregressions (VARs). This paper studies shadow‐rate VARs by using interest rates as a latent variable near the ELB to estimate their shadow‐rate values.
Michael Grammatikopoulos
wiley +1 more source

