PageRank computation via a distributed randomized approach with lossy communication
Publication:1932740
DOI10.1016/j.sysconle.2012.09.004zbMath1256.93122OpenAlexW2023681133MaRDI QIDQ1932740
Hideaki Ishii, Roberto Tempo, Er-wei Bai
Publication date: 21 January 2013
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2012.09.004
randomizationMarkov chainconvergence propertiesstochastic matricessearch enginesPageRank algorithmcommunication channelsdistributed computationmulti-agent consensusweb structurecommunication for ranking webeffects of unreliabilitylossy communicationmeasure of importancerandom data lossesrandomized approach
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Decentralized systems (93A14) Agent technology and artificial intelligence (68T42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic consensus over noisy networks with Markovian and arbitrary switches
- Maximizing PageRank via outlinks
- Non-negative matrices and Markov chains. 2nd ed
- Adaptive methods for the computation of PageRank
- Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
- Communication constraints in the average consensus problem
- Matrix Analysis
- PageRank optimization applied to spam detection
- Distributed PageRank Computation with Link Failures
- A Necessary and Sufficient Condition for Consensus Over Random Networks
- Distributed Randomized Algorithms for the PageRank Computation
- Quantized Consensus and Averaging on Gossip Digraphs
- A Web Aggregation Approach for Distributed Randomized PageRank Algorithms
- Ergodic Control and Polyhedral Approaches to PageRank Optimization
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient