Design of on-line algorithms using hitting times

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1232-1246

  Tetali, Prasad ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; MARKOV PROCESSES; ONLINE SYSTEMS; PROBABILITY DISTRIBUTIONS;

COMPETITIVE RATIO; HITTING TIMES; RANDOM WALK; REVERSIBILITY; TRANSITION PROBABILITY MATRIX;

ALGORITHMS;

EID: 0032657667     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798335511     Document Type: Article

References (23)

1. D. ALDOUS, Personal communication, 1993.
2. D. ALDOUS AND J. FILL, Reversible Markov Chains and Random Walks on Graphs, draft of book in preparation.
3. S. BEN-DAVID, A. BORODIN, R. M. KARP, G. TÁRDOS, AND A. WIGDERSON, On the power of randomization in on-line algorithms, Algorithmica, 11 (1994), pp. 2-14.
4. P. BERMAN, H. J. KARLOFF, AND G. TÁRDOS, A competitive 3-server algorithm, in Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, SIAM, Philadelphia, PA, 1990, pp. 280-290.
5. A. BORODIN, N. LINIAL, AND M. SAKS, An Optimal on-line algorithm for metrical task system, J. Amer. Math. Soc., 39 (1992), pp. 745-763.
6. M. CHROBAK AND L. L. LARMORE, An optimal on-line algorithm for k-servers on trees, SIAM J. Comput., 20 (1991), pp. 144-148.
7. A. K. CHANDRA, P. RAGHAVAN, W. L. RUZZO, R. SMOLENSKY, AND P. TIWARI, The electrical resistance of a graph captures its commute and cover times, Comput. Complexity, 6 (1996/97), pp. 312-340.
8. D. COPPERSMITH, P. DOYLE, P. RAGHAVAN, AND M. SNIR, Random walks on weighted graphs, and applications to on-line algorithms, J. Amer. Math. Soc., 40 (1993), pp. 421-453.
9. D. COPPERSMITH, P. TETALI, AND P. WINKLER, Collisions among random walks on a graph, SIAM J. Discrete Math., 6 (1993), pp. 363-374.
10. P. G. DOYLE AND J. L. SNELL, Random Walks and Electric Networks, Carus Mathematical Monographs 22, Mathematical Association of America, Washington, DC, 1984.
11. A. FIAT, Y. RABANI, AND Y. RAVID, Competitive k-server algorithms, J. Comput. System Sci., 48 (1994), pp. 410-428.
12. M. FIEDLER, C. R. JOHNSON, T. L. MARKHAM, AND M. NEUMANN, A trace inequality for M-matrices and the symmetrizability of a real matrix by a positive diagonal matrix, Linear Algebra Appl., 71 (1985), pp. 81-94.
13. R. M. FOSTER, The average impedance of an electrical network, in Contributions to Applied Mechanics (Reissner Anniversary Volume), Edwards Bros., Ann Arbor, MI, 1949, pp. 333-340.
14. R. M. FOSTER, An extension of a network theorem, IRE Trans. Circuit Theory, 8 (1961), pp. 75-76.
15. F. GOBEL AND A. A. JAGERS, Random walks on graphs, Stochastic Process. Appl., 2 (1974), pp. 311-336.
16. E. GROVE, The harmonic online K-server algorithm is competitive, in On-Line Algorithms, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 7, AMS, Providence, RI, 1992, pp. 65-75.
17. E. KOUTSOUPIAS AND C. H. PAPADIMITRIOU, On the k-server conjecture, J. Amer. Math. Soc., 42 (1995), pp. 971-983.
18. J. G. KEMENY AND J. L. SNELL, Finite Markov Chains, Springer-Verlag, New York, 1983.
19. J. G. KEMENY, J. L. SNELL, AND A. W. KNAPP, Denumerable Markov Chains, Springer-Verlag, New York, 1976.
20. M. S. MANASSE, L. A. MCGEOCH, AND D. D. SLEATOR, Competitive algorithms for server problems, J. Algorithms, 11 (1990), pp. 208-230.
21. H. MINC, Nonnegative Matrices, Wiley-Interscience, New York, 1988.
22. P. TETALI, Random walks and the effective resistance of networks, J. Theoret. Probab., 4 (1991), pp. 101-109.
23. P. TETALI, An extension of Foster's network theorem, Combin. Probab. Comput. (special issue in honor of Paul Erdös's 80th birthday), 3 (1994), pp. 421-427.