PageRank computation via a distributed randomized approach with lossy communication
type: Item
instance of: scholarly article
title: PageRank computation via a distributed randomized approach with lossy communication
zbMATH Open document ID: 1256.93122
author: Hideaki Ishii
author: Roberto Tempo
author: Er-wei Bai
published in: Systems \& Control Letters
publication date: 2013-01-21T00:00:00Z
Mathematics Subject Classification ID: 93E25
Mathematics Subject Classification ID: 93A14
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 6127758
zbMATH Keywords: distributed computation
zbMATH Keywords: multi-agent consensus
zbMATH Keywords: PageRank algorithm
zbMATH Keywords: randomization
zbMATH Keywords: search engines
zbMATH Keywords: stochastic matrices
zbMATH Keywords: communication for ranking web
zbMATH Keywords: lossy communication
zbMATH Keywords: random data losses
zbMATH Keywords: measure of importance
zbMATH Keywords: effects of unreliability
zbMATH Keywords: convergence properties
zbMATH Keywords: communication channels
zbMATH Keywords: randomized approach
zbMATH Keywords: Markov chain
zbMATH Keywords: web structure
MaRDI profile type: Publication
full work available at URL: j.sysconle.2012.09.004
OpenAlex ID: W2023681133
cites work: Adaptive methods for the computation of PageRank
cites work: Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
cites work: Maximizing PageRank via outlinks
cites work: Ergodic Control and Polyhedral Approaches to PageRank Optimization
cites work: PageRank optimization applied to spam detection
cites work: Q5491464
cites work: Distributed Randomized Algorithms for the PageRank Computation
cites work: A Web Aggregation Approach for Distributed Randomized PageRank Algorithms
cites work: Q3546603
cites work: Quantized Consensus and Averaging on Gossip Digraphs
cites work: Communication constraints in the average consensus problem
cites work: A Necessary and Sufficient Condition for Consensus Over Random Networks
cites work: Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
cites work: Stochastic consensus over noisy networks with Markovian and arbitrary switches
cites work: Distributed PageRank Computation with Link Failures
cites work: Matrix Analysis
cites work: Q4651858
cites work: Q3711411
cites work: Non-negative matrices and Markov chains. 2nd ed
DOI: 10.1016/J.SYSCONLE.2012.09.004
description: scientific article; zbMATH DE number 6127758