Is this your profile?
Claim your Citation Index profile in order to display more information about you and gain access to Libraries services. Just create or connect your ORCID iD.
Create or connect your ORCID iD
Works (16)
Updated: April 4th, 2024 21:10
2018 journal article
Rank My Update, Please
AMERICAN MATHEMATICAL MONTHLY, 125(1), 61–64.
TL;DR:
This note presents an expression in simply stated terms for the exact rank of a rank-one updated matrix.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2015 journal article
Continuity of the Perron root
LINEAR & MULTILINEAR ALGEBRA, 63(7), 1332–1336.
author keywords: nonnegative matrices; Perron-Frobenius theory; Perron root; 1502; 15B48; 15A18
arxiv.org (repository)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2012 journal article
STOCHASTIC DATA CLUSTERING
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 33(4), 1214–1236.
author keywords: cluster analysis; Markov chains; Simon-Ando theory
TL;DR:
A technique for using the evolution of the system to tell us about its initial structure is developed, and this technique is used to develop an algorithm that takes the varied solutions from multiple data clustering algorithms to arrive at a singleData clustering solution.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2012 article
Who's #1?
Langville, A. N., & Meyer, C. D. (2012, July). SCIENTIFIC AMERICAN, Vol. 307, pp. 21–21.
Source: Web Of Science
Added: August 6, 2018
2006 journal article
A reordering for the PageRank problem
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 27(6), 2112–2120.
author keywords: Markov chains; PageRank; reorderings; power method; convergence; stationary vector; dangling nodes
TL;DR:
Results of an experimental comparison are presented, which demonstrate that the reordered PageRank algorithm can provide a speedup of as much as a factor of 6.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2006 book
Google's PageRank and beyond: The science of search engine rankings
TL;DR:
This talk will survey some of the concepts that have revolutionized Web search to the extent that it has been charged in Federal Court with driving the direction of commerce on the Internet.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education
(OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018
2006 journal article
Updating Markov chains with an eye on Google's PageRank
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 27(4), 968–987.
author keywords: Markov chains; updating; stationary vector; PageRank; stochastic complementation; aggregation/disaggregation; Google
TL;DR:
An iterative algorithm based on aggregation/disaggregation principles is presented for updating the stationary distribution of a finite homogeneous irreducible Markov chain and it is proven that the algorithm is globally convergent.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2005 journal article
A survey of eigenvector methods for Web information retrieval
SIAM REVIEW, 47(1), 135–161.
author keywords: eigenvector; Markov chain; information retrieval; HITS; PageRank; SALSA
TL;DR:
This survey paper focuses on Web information retrieval methods that use eigenvector computations, presenting the three popular methods of HITS, PageRank, and SALSA.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2004 journal article
Deeper Inside PageRank
Internet Mathematics, 1(3), 335–380.
TL;DR:
A comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, and suggested alternatives to the traditional solution methods.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2004 journal article
Injective properties of complex matrices
American Mathematical Monthly, 111(8), 728.
Source: NC State University Libraries
Added: August 6, 2018
2003 journal article
Eudoxus meets Cayley
AMERICAN MATHEMATICAL MONTHLY, 110(10), 912–927.
Source: Web Of Science
Added: August 6, 2018
2001 journal article
Comparison of perturbation bounds for the stationary distribution of a Markov chain
LINEAR ALGEBRA AND ITS APPLICATIONS, 335, 137–150.
author keywords: Markov chains; stationary distribution; stochastic matrix; group inversion; sensitivity analysis; perturbation theory; condition numbers
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2000 journal article
Markov chain sensitivity measured by mean first passage times
LINEAR ALGEBRA AND ITS APPLICATIONS, 316(1-3), 21–28.
author keywords: Markov chains; stationary distribution; mean first passage times; stochastic matrix; sensitivity analysis; perturbation theory; stability of a Markov chain; condition numbers
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2000 book
Matrix analysis and applied linear algebra
Philadelphia: Society for Industrial and Applied Mathematics.
Source: NC State University Libraries
Added: August 6, 2018
1998 journal article
On the structure of stochastic matrices with a subdominant eigenvalue near 1
LINEAR ALGEBRA AND ITS APPLICATIONS, 272, 193–203.
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
1998 journal article
The idea behind Krylov methods
AMERICAN MATHEMATICAL MONTHLY, 105(10), 889–899.
Source: Web Of Science
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.