Distributed Randomized Algorithms for the PageRank Computation
From MaRDI portal
Publication:4978926
DOI10.1109/TAC.2010.2042984zbMath1368.68045OpenAlexW2106101949MaRDI QIDQ4978926
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2010.2042984
Eigenvalues, singular values, and eigenvectors (15A18) Statistical ranking and selection procedures (62F07) Randomized algorithms (68W20) Internet topics (68M11)
Related Items (16)
Consensus of high-order multi-agent systems with large input and communication delays ⋮ Optimal design of cyclic pursuit weights in hierarchical multi-agent systems ⋮ Opinion evolution analysis for short-range and long-range Deffuant-Weisbuch models ⋮ Personalized PageRank clustering: a graph clustering algorithm based on random walks ⋮ Sparse and distributed Analytic Hierarchy Process ⋮ Semistability of switched linear systems with application to PageRank algorithms ⋮ PageRank computation via a distributed randomized approach with lossy communication ⋮ Time Averaging Algorithms with Stopping Rules for Multi-Agent Consensus with Noisy Measurements ⋮ Consensus for Quantum Networks: Symmetry From Gossip Interactions ⋮ Opinion influence and evolution in social networks: a Markovian agents model ⋮ Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview ⋮ Probabilistic methods in cancer biology ⋮ Average consensus on general strongly connected digraphs ⋮ Research on probabilistic methods for control system design ⋮ Coalitional games for networked controllers with constraints on semivalues: a randomized design approach ⋮ The robustness of democratic consensus
This page was built for publication: Distributed Randomized Algorithms for the PageRank Computation
