Results 101 to 110 of about 14,787 (152)
Ars Mathematica Contemporanea, 2016 While discussing his spectral bound on the independence number of a graph, Herbert Wilf asked back in 1986 what kind of a graph admits an eigenvector consisting solely of ± 1 entries? We prove that Wilf’s problem is NP-complete, but also that the set of graphs having a ± 1 eigenvector is quite rich, being closed under a number of different graph ...
openaire +2 more sources
Robust Eigenvector of a Stochastic Matrix with Application to PageRank
, 2012 International audienceWe discuss a definition of robust dominant eigenvector of a family of stochastic matrices. Our focus is on application to ranking problems, where the proposed approach can be seen as a robust alternative to the standard PageRank ...
Anatoli Juditsky +3 more
core +1 more source
Covariance Blind Detection Method Based on Eigenvector in Cognitive Radio Network
Dianxin kexue, 2015 As the blind detection algorithm has the shortcoming that they need information about the channel and more than two cognitive users to detect the primary user,a new blind detection algorithm based on eigenvector using the difference of correlation ...
Yingxue Li +4 more
doaj
Percentage of variance captured by each eigenvector.
, 2015 Percentage of variance captured by each eigenvector.
Vaideesh Parasaram (710709) +4 more
core +1 more source
The subgraph eigenvector centrality of graphs
Let $G$ be a connected graph and let $F$ be a connected subgraph of $G$ with a given structure. We consider that the centrality of a vertex $i$ of $G$ is determined by the centrality of other vertices in all subgraphs contain $i$ and isomorphic to $F ...
Bu, Changjiang +2 more
core
The approximation of an eigenvector by ritzvectors [PDF]
Eigenvalue algorithms belonging to the class of the Rayleigh-Ritz methods (Krylov-space methods for example) use `projections' on subspaces to produce approximations to eigenvalues and eigenvectors of a matrix. This paper focuses on the eigenvectors. Two
Smit, P.
core
On derivatives of eigenvalues, eigenvectors and generalized eigenvectors of matrices
International Journal of Algebra, 2023 openaire +1 more source
Perron-Frobenius and Krein-Rutman theorems for tangentially positive operators
Open Mathematics, 2012 Kanigowski Adam, Kryszewski Wojciech
doaj +1 more source
Some New Results on the Eigenvector Centrality
Journal of Mathematical Sociology, 2007 In this article we establish new results on the components of the principal eigenvector in an undirected graph. Those results are particularly significant in relation to the concept of centrality in social networks.
Rosanna Grassi, Anna Torriero
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the construction of p-eigenvectors
Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio computatorica, 2020Summary: Recent investigations led to the definition of \(p\)-eigenvectors: such vectors for a matrix, that the fraction of the vector norms of the matrix-vector product and the nonzero vector (as in defining a natural matrix norm) is independent of the applied \(p\)-norm. This paper elaborates this concept further, presenting general results, proof of
Lócsi, Levente, Németh, Zsolt
openaire +2 more sources