Lower bounds for distributed markov chain problems
نویسندگان
چکیده
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat that G is also the communication network. The problem is a natural generalization of shortest path lengths to expected path lengths, and represents a model used in many practical applications such as pagerank and eigentrust as well as other problems involving Markov chains defined by networks. For the problem of computing a single stationary probability, we prove an Ω(n log n) bits lower bound; the trivial centralized algorithm costs O(n) bits and no known algorithm beats this. We also prove lower bounds for the related problems of approximately computing the stationary probabilities, computing only the ranking of the nodes, and computing the node with maximal rank. As a corollary, we obtain lower bounds for labelling schemes for the hitting time between two nodes.
منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملLower and Upper Bounds for the Survival of Infinite Absorbing Markov Chains
A wide variety of problems in the domain of directed percolation theory, contact process, voter models rely on the analysis of a infinite absorbing Markov chain. Although results for these problems have been obtained through other approaches, reasoning about the Markov chain gives rise to elegant results that are often explicit functions of the chain parameters. This allows results to be reused...
متن کاملSome Specialized Comparison Techniques for Doubly Stochastic Finite Markov Chains
This paper considers certain comparison techniques involving Markov chains with transition matrices Pa = aI+(1?a)P where P is the transition matrix of a doubly stochastic Markov chain. This paper provides upper bounds for how far the Markov chain with transition matrix Pb is from uniformly distributed after n steps. These upper bounds involve how far the Markov chain with transition matrix Pa i...
متن کاملModerate Deviations for Time-varying Dynamic Systems Driven by Nonhomogeneous Markov Chains with Two-time Scales∗
Motivated by problems arising in time-dependent queues and dynamic systems with random environment, this work develops moderate deviations principles for dynamic systems driven by a fast-varying nonhomogeneous Markov chain in continuous time. A distinct feature is that the Markov chain is time dependent or inhomogeneous so are the dynamic systems. Under irreducibility of the nonhomogeneous Mark...
متن کاملDetecting Markov Random Fields Hidden in White Noise
Motivated by change point problems in time series and the detection of textured objects in images, we consider the problem of detecting a piece of a Gaussian Markov random field hidden in white Gaussian noise. We derive minimax lower bounds and propose near-optimal tests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0810.5263 شماره
صفحات -
تاریخ انتشار 2008