Results 131 to 140 of about 249,692 (322)
Universality of eigenvector delocalization and the nature of the SIS phase transition in multiplex networks [PDF]
Guilherme Ferraz de Arruda +3 more
openalex +1 more source
Abstract Muscle architecture is a major determinant of muscle performance and, in mammalian lineages, has been correlated with both feeding ecology and locomotor behaviors. Over the past decade, contrast‐enhanced micro‐CT (DiceCT) has emerged as an alternative to traditional dissection‐based measurement.
Aleksandra Ratkiewicz +5 more
wiley +1 more source
Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications [PDF]
AmirMahdi Ahmadinejad +3 more
openalex +1 more source
Generalizing the calculable
Dong Bai, Zhongzhou Ren
openalex +1 more source
Eigenvectors of Perturbed Operators
The main result of this article constitutes the following theorem: Let \(A:H\rightarrow H\) be a compact selfadjoint operator and \(f\) a strictly increasing differentiable function in the interval \(I.\) For \(z\in H\) form a family of compact selfadjoint operators \(A(t)=A+f(t)\langle\cdot,z \rangle z\).
openaire +1 more source
Patterns of spinal motion, kinematic spaces and the land‐to‐sea transition in carnivorans
Using 3D reconstructions, we quantify intervertebral joint mobility to investigate how cervical, thoracic, and lumbar vertebral regions evolved distinct kinematic roles in pinnipeds. The findings reveal lineage‐specific adaptations for swimming and highlight the functional significance of vertebral joint flexibility in ecological transitions.
Juan Miguel Esteban +3 more
wiley +1 more source
Perturbation expansions for eigenvalues and eigenvectors for a rectangular membrane subject to a restorative force [PDF]
Joyce R. McLaughlin, Arturo Portnoy
openalex +1 more source
Abstract Large swarms often adopt a hierarchical network structure that incorporates information aggregation. Although this approach offers significant advantages in terms of communication efficiency and computational complexity, it can also lead to degradation due to information constraints.
Kento Fujita, Daisuke Tsubakino
wiley +1 more source
Eigenvalues and eigenvectors of tau matrices with applications to Markov processes and economics
Sven‐Erik Ekström +3 more
openalex +1 more source
Graph partitioning by Eigenvectors
Given a graph G on n vertices and \(z\in R^ n\), we say that a vertex of G is positive, nonnegative, null, etc. if the corresponding entry of z has that property. For z such that Az\(\geq \alpha z\) (A is the adjacency matrix of G) the number of components of the subgraph induced by positive vertices is bounded.
openaire +2 more sources

