The following pages link to (Q5491464):
Displaying 50 items.
- On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (Q286157) (← links)
- Finding the stationary states of Markov chains by iterative methods (Q299414) (← links)
- An iterative aggregation and disaggregation method for the steady state solution of large scale continuous systems (Q311819) (← links)
- An Arnoldi-Inout algorithm for computing PageRank problems (Q313604) (← links)
- Efficient initials for computing maximal eigenpair (Q335562) (← links)
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem (Q395333) (← links)
- A matrix-based ranking method with application to tennis (Q417556) (← links)
- Practical acceleration for computing the HITS expertrank vectors (Q442725) (← links)
- A fixed point approach to the steady state for stochastic matrices (Q470404) (← links)
- The extrapolation-accelerated multilevel aggregation method in PageRank computation (Q473754) (← links)
- A two-step matrix splitting iteration for computing PageRank (Q475634) (← links)
- PageRank model of opinion formation on Ulam networks (Q482988) (← links)
- A note on certain ergodicity coefficients (Q491790) (← links)
- Learning and teaching ``what is mathematics'' (Q507005) (← links)
- Dynamic models of informational control in social networks (Q544733) (← links)
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem (Q544781) (← links)
- A preconditioning approach to the pagerank computation problem (Q551350) (← links)
- On the eigenvalues of specially low-rank perturbed matrices (Q555470) (← links)
- Ulam method and fractal Weyl law for Perron-Frobenius operators (Q614574) (← links)
- Competitivity groups on social network sites (Q622978) (← links)
- A note on the two-step matrix splitting iteration for computing PageRank (Q729852) (← links)
- The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (Q736033) (← links)
- Local dependency in networks (Q747482) (← links)
- Adaptive algebraic smoothers (Q765278) (← links)
- On perturbations of principal eigenvectors of substochastic matrices (Q891303) (← links)
- From senses to texts: an all-in-one graph-based approach for measuring semantic similarity (Q896432) (← links)
- Modelling the navigation potential of a web page (Q924137) (← links)
- Characteristic polynomials of some perturbed matrices (Q928087) (← links)
- Maximizing PageRank via outlinks (Q935395) (← links)
- On algebraic multi-level methods for non-symmetric systems --- comparison results (Q952047) (← links)
- Choose the damping, choose the ranking? (Q972362) (← links)
- Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph (Q989118) (← links)
- An Arnoldi-extrapolation algorithm for computing pagerank (Q989127) (← links)
- On computing PageRank via lumping the Google matrix (Q1002214) (← links)
- The mathematics of internet search engines (Q1014846) (← links)
- Krylov and steady-state techniques for the solution of the chemical master equation for the mitogen-activated protein kinase cascade (Q1027792) (← links)
- Assessment and optimization of e-commerce websites of fish culture sector (Q1035010) (← links)
- Opinion formation driven by PageRank node influence on directed networks (Q1618669) (← links)
- Off-diagonal low-rank preconditioner for difficult PageRank problems (Q1624665) (← links)
- Alleviating road network congestion: traffic pattern optimization using Markov chain traffic assignment (Q1654365) (← links)
- A relaxed two-step splitting iteration method for computing PageRank (Q1655370) (← links)
- Fuzzy random walkers with second order bounds: an asymmetric analysis (Q1662703) (← links)
- An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank (Q1675429) (← links)
- Multi-cultural Wikipedia mining of geopolitics interactions leveraging reduced Google matrix analysis (Q1681641) (← links)
- Random walks and diffusion on networks (Q1687598) (← links)
- A new multivariate Markov chain model for adding a new categorical data sequence (Q1718556) (← links)
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem (Q1732194) (← links)
- Hitting times in Markov chains with restart and their application to network centrality (Q1739335) (← links)
- Ranking nodes in general networks: a Markov multi-chain approach (Q1745939) (← links)
- Tackling information asymmetry in networks: a new entropy-based ranking index (Q1756553) (← links)
