{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:02Z","timestamp":1725455582059},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024503","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"258-272","source":"Crossref","is-referenced-by-count":0,"title":["A syntactic approach to random walks on graphs"],"prefix":"10.1007","author":[{"given":"M.","family":"Mosbah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Saheb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"issue":"4","key":"22_CR1","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/0403039","volume":"3","author":"D.J. Aldous","year":"1990","unstructured":"D.J. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal on Discrete Mathematics, 3(4):450\u2013465, 1990.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR2","unstructured":"D.J. Aldous and J.A. Fill. Reversible Markov Chains and Random Walks on Graphs. 1996. Book in preparation."},{"key":"22_CR3","first-page":"50","volume-title":"Proceedings of 9th Colloquium on Trees in Algebra and Programming","author":"D. Arqu\u00e8s","year":"1984","unstructured":"D. Arqu\u00e8s and J. Fran\u00e7on. Arbres bien \u00e9tiquet\u00e9s et fractions multicontinues. In B. Courcelle, editor, Proceedings of 9th Colloquium on Trees in Algebra and Programming, pages 50\u201361, Bordeaux, France, March 1984. Cambridge University Press."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"S. Bhatt and J.Y. Cai. Take a walk, grow a tree. In 29th Annunal IEEE Symposium on Foundations of Computer Science, pages 469\u2013478, 1988.","DOI":"10.1109\/SFCS.1988.21963"},{"issue":"5","key":"22_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1002\/jgt.3190140505","volume":"14","author":"G. Brightwell","year":"1990","unstructured":"G. Brightwell and P. Winkler. Extremal cover times for random walks on trees. Journal of Graph Theory, 14(5):547\u2013554, 1990.","journal-title":"Journal of Graph Theory"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"A.Z. Broder. Generating random spanning trees. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 442\u2013453, October 1989.","DOI":"10.1109\/SFCS.1989.63516"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"A.Z. Broder, A.R. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s-t connectivity. In ACM Symposium on Theory of Computing (STOC), pages 543\u2013549, 1989.","DOI":"10.1145\/73007.73059"},{"issue":"3","key":"22_CR8","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/174130.174131","volume":"40","author":"D. Coppersmith","year":"1993","unstructured":"D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir. Random walks on weighted graphs and applications to on-line algorithms. Journal of the ACM, 40(3):421\u2013453, July 1993.","journal-title":"Journal of the ACM"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"M. Dyer, A. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of covex bodies. In ACM Symposium on Theory of Computing (STOC), pages 375\u2013381, 1989.","DOI":"10.1145\/73007.73043"},{"key":"22_CR10","volume-title":"Automata, Languages, and Machines, volume A.","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, Newyork, 1974."},{"key":"22_CR11","volume-title":"An introduction to probability theory and its applications, volume Vol. 1","author":"W. Feller","year":"1957","unstructured":"W. Feller. An introduction to probability theory and its applications, volume Vol. 1. 2nd ed. Wiley, New York, 1957.","edition":"2nd ed."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(80)90050-3","volume":"32","author":"P. Flajolet","year":"1980","unstructured":"P. Flajolet. Combinatorial aspects of continued fractions. Discrete Mathematics, 32:125\u2013161, 1980.","journal-title":"Discrete Mathematics"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In Proc. of the Ninth Annual Symposium on Principles of Distributed Computing, pages 119\u2013131, 1990.","DOI":"10.1145\/93385.93409"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"M. Jerrum and A. Sinclair. Conductance and the rapid mixing property of markov chains: the approximation of the permanent resolved. In ACM Symposium on Theory of Computing (STOC), pages 235\u2013244, 1988.","DOI":"10.1145\/62212.62234"},{"key":"22_CR15","unstructured":"M. Mosbah and N. Saheb. Formal rational fractions and random walks on cycle graphs. Technical Report 1147-96, University of Bordeaux 1, 1996. accept\u00e9 \u00e0 FPSAC 97-Vienne 14\u201318 juillet 97."},{"key":"22_CR16","unstructured":"M. Mosbah and N. Saheb.Non uniform random spanning trees on weighted graphs. Technical Report 1143-96, University of Bordeaux 1, 1996."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"P. Tetali and P. Winkler. On a random walk arising in self-stabilizing token management. In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 273\u2013280, 1991.","DOI":"10.1145\/112600.112623"},{"key":"22_CR18","unstructured":"D.B. Wilson and J.G. Propp. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 448\u2013457, Atlanta, Georgia, 28\u201330 January 1996."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:43Z","timestamp":1586568943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0024503","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}