scientific article; zbMATH DE number 5060846

From MaRDI portal
Publication:5491464

zbMath1104.68042MaRDI QIDQ5491464

Amy N. Langville, Carl D. jun. Meyer

Publication date: 5 October 2006


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Analysis of Relaxation Time in Random Walk with JumpsUsing principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraphEfficient numerical methods to solve sparse linear equations with application to PageRankMultilinear PageRankA Search for Champion BoxersIdentifying influential nodes in complex networks: A node information dimension approachThe modified matrix splitting iteration method for computing PageRank problemHITS Can Converge Slowly, but Not Too Slowly, in Score and RankA measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relationsPageRank in Scale-Free Random GraphsIntroduction to Complex Networks: Structure and DynamicsCentrality Analysis for Modified LatticesMatrix functions in network analysisNetwork Capacity Bound for Personalized PageRank in Multimodal NetworksSeeded PageRank solution pathsMulti-linear pseudo-PageRank for hypergraph partitioningSpectral properties of Google matrix of Wikipedia and other networksTruncated and sparse power methods with partially updating for large and sparse higher-order PageRank problemsAxiomatic characterization of PageRankThe Computational Complexity of Link BuildingDiscrete-time semiclassical Szegedy quantum walksImproved uniqueness conditions of solution for multilinear pagerank and its applicationOn computing HITS ExpertRank via lumping the hub matrixLocalization in Matrix Computations: Theory and ApplicationsPinning control of directed dynamical networks based on ControlRankHow to improve a team's position in the FIFA ranking? A simulation studyThe efficacy of league formats in ranking teamsRandom walk centrality for temporal networksTunable Eigenvector-Based Centralities for Multiplex and Temporal NetworksDynamic analysis of influential stocks based on conserved networksA Google-like model of road network dynamics and its application to regulation and controlAnalysis of node2vec random walks on networksRational extrapolation for the PageRank vectorAsymptotic analysis for personalized Web searchEigenvector-Based Centrality Measures for Temporal NetworksThe Spacey Random Walk: A Stochastic Process for Higher-Order DataTraffic modelling framework for electric vehiclesOn the edges’ PageRank and line graphsUnnamed ItemDistribution of PageRank Mass Among Principle Components of the WebAggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graphSymmetric Rank-One Updates from Partial Spectrum with an Application to Out-of-Sample ExtensionA Dynamical System for PageRank with Time-Dependent TeleportationProof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov ChainsA MODEL TO CLASSIFY USERS OF SOCIAL NETWORKS BASED ON PAGERANKAn Automatic User-Recognition Approach Within a Reputation System Using a Nonlinear Hausdorff-Derived MetricOn the Limiting Behavior of Parameter-Dependent Network Centrality MeasuresNew Fixed Point Theorems via Contraction Mappings in Complete Intuitionistic Fuzzy Normed Linear SpaceModels of latent consensusOpinion formation driven by PageRank node influence on directed networksOn the convergence of the minimally irreducible Markov chain method with applications to PageRankRanking in evolving complex networksEnriched line graph: a new structure for searching language collocationsOn graph combinatorics to improve eigenvector-based measures of centrality in directed networksOff-diagonal low-rank preconditioner for difficult PageRank problemsAcceleration of an adaptive generalized Arnoldi method for computing PageRankFinding the stationary states of Markov chains by iterative methodsAn iterative aggregation and disaggregation method for the steady state solution of large scale continuous systemsAn Arnoldi-Inout algorithm for computing PageRank problemsEfficient initials for computing maximal eigenpairAlleviating road network congestion: traffic pattern optimization using Markov chain traffic assignmentThe projection method for reaching consensus and the regularized power limit of a stochastic matrixA relaxed two-step splitting iteration method for computing PageRankRegularization-based solution of the PageRank problem for large matricesA new method (K-method) of calculating the mutual influence of nodes indirected weight complex networksFuzzy random walkers with second order bounds: an asymmetric analysisAccelerating the Arnoldi method via Chebyshev polynomials for computing PageRankAn Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRankA bag-of-paths framework for network data analysisMulti-cultural Wikipedia mining of geopolitics interactions leveraging reduced Google matrix analysisConvergence of the Nelder-Mead methodUlam method and fractal Weyl law for Perron-Frobenius operatorsAccelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problemRed light green light method for solving large Markov chainsPageRank computation via a distributed randomized approach with lossy communicationOn perturbations of principal eigenvectors of substochastic matricesGraphs with absorption: numerical methods for the absorption inverse and the computation of centrality measuresRandom walks and diffusion on networksAn adaptively preconditioned multi-step matrix splitting iteration for computing PageRankClusters in Markov chains via singular vectors of Laplacian matricesCompetitivity groups on social network sitesFrom senses to texts: an all-in-one graph-based approach for measuring semantic similarityRanking hubs and authorities using matrix functionsA variant of the Power-Arnoldi algorithm for computing PageRankA matrix-based ranking method with application to tennisA flexible and adaptive simpler GMRES with deflated restarting for shifted linear systemsThe intellectual influence of economic journals: quality versus quantityOn the localization of the personalized PageRank of complex networksBlock-accelerated aggregation multigrid for Markov chains with application to PageRank problemsExtending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walksPractical acceleration for computing the HITS expertrank vectorsWeb page importance rankingA new multivariate Markov chain model for adding a new categorical data sequenceModelling the navigation potential of a web pagePerron vector optimization applied to search enginesPageRank optimization by edge selectionOn some analytical properties of a general PageRank algorithmA fixed point approach to the steady state for stochastic matricesCharacteristic polynomials of some perturbed matricesThe extrapolation-accelerated multilevel aggregation method in PageRank computationSeveral relaxed iteration methods for computing PageRankA two-step matrix splitting iteration for computing PageRankThe sensitivity of a quantum PageRankParallel multisplitting iteration methods based on M-splitting for the PageRank problemPageRank model of opinion formation on Ulam networksMaximizing PageRank via outlinksA note on certain ergodicity coefficientsLinear neural networks revisited: from PageRank to family happinessHitting times in Markov chains with restart and their application to network centralityLearning and teaching ``what is mathematicsRanking nodes in general networks: a Markov multi-chain approachOn algebraic multi-level methods for non-symmetric systems --- comparison resultsA centrality measure in dense networks based on two-way random walk betweennessPageRank computation with MAAOR and lumping methodsThe power method and beyondTackling information asymmetry in networks: a new entropy-based ranking indexThe jump start power method: a new approach for computing the ergodic projector of a finite Markov chainDynamic models of informational control in social networksRandomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problemThe general inner-outer iteration method based on regular splittings for the PageRank problemChoose the damping, choose the ranking?A preconditioning approach to the pagerank computation problemOn the eigenvalues of specially low-rank perturbed matricesQuasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graphAn Arnoldi-extrapolation algorithm for computing pagerankNew models for multi-class networksThe NIRS brain AnalyzIR toolboxA note on the two-step matrix splitting iteration for computing PageRankThe PageRank model of minimal irreducible adjustment and its lumping methodOn computing PageRank via lumping the Google matrixThe randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRankEdge Modification Criteria for Enhancing the Communicability of DigraphsSoft computing methods for multiobjective location of garbage accumulation points in smart citiesPageRank Beyond the WebThe mathematics of internet search enginesLocal dependency in networksKrylov and steady-state techniques for the solution of the chemical master equation for the mitogen-activated protein kinase cascadeAdaptive algebraic smoothersAssessment and optimization of e-commerce websites of fish culture sectorA general multi-splitting iteration method for computing PageRankAn extrapolation iteration and its lumped type iteration for computing PageRankOn the exponential ranking and its linear counterpartA preprocessed multi-step splitting iteration for computing PageRankA preconditioned and extrapolation-accelerated GMRES method for pagerankA positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrixOn efficient randomized algorithms for finding the PageRank vectorThe coupled iteration algorithms for computing PageRankA Hessenberg-type algorithm for computing PageRank problems


Uses Software