Loop-erased walks and total positivity

Transactions of the American Mathematical Society

Volumn 353, Issue 9, 2001, Pages 3563-3583

  Fomin, Sergey ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Hitting probability; Loop erased walk; Resistor network; Total positivity

Indexed keywords

EID: 23044526437     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0002-9947-01-02824-0     Document Type: Article

References (22)

1. I. Benjamini, R. Lyons, Y. Peres, and O. Schramm, Uniform spanning forests, Ann. Probab., to appear.
2. W. Böhm and S. G. Mohanty, On the Karlin-McGregor theorem and applications, Ann. Appl. Probab. 7 (1997), 314-325. MR 98g:60131
3. B. Bollobás, Modem graph theory, Springer-Verlag, New York, 1998. MR 99h:05001
4. J. M. Borwein, D. M. Bradley, D. J. Broadhurst, and P. Lisoněl, Special values of multiple polylogarithms, Thins. Amer. Math. Soc., to appear.
5. Y. Colin de Verdière, Réseaux électriques planaires, Prépublications de l'Institut Fourier 225 (1992), 1-20.
6. E. Curtis, D. V. Ingerman, and J. Morrow. Circular planar graphs and resistor networks, Linear Algebra Appl. 283 (1998), 115-150. MR 99k:05096
7. E. Curtis, E. Mooers, and J. Morrow, Finding the conductors in circular networks from boundary measurements, RAIRO Model. Math. Anal. Numér. 28 (1994), 781-814. MR 96i:65110
8. P. G. Doyle and J. L. Snell, Random walks and electric networks, Math. Assoc. of America, 1984. MR 89a:94023
9. R. Durrett, Brownian motion and martingales in analysis, Wadsworth, 1984. MR 87a:60054
10. S. Fomin and A. Zelevinsky, Total positivity: tests and parametrizations, Math. Intelligencer 22 (2000), no. 1, 23-33. MR 2001b:22014
11. F. R. Gantmachcr and M. G. Krein, Oszillationsmatrizen, Oszillationskerne und kleine Schwingungen mechanischer Systeme, Akademie-Verlag, Berlin, 1960. MR 22:5161 (Russian edition: Moscow-Leningrad, 1950. MR 14:178)
12. D. V. Ingerman, Discrete and continuous inverse boundary problems on a disk, Ph.D. thesis, University of Washington, 1997.
13. S. Karlin, Total positivity, Stanford University Press, 1968. MR 37:5667
14. S. Karlin and G. McGregor, Coincidence probabilities, Pacific J. Math. 9 (1959), 1141-1164. MR 22:5072
15. G. Lawler, Intersections of random walks, Birkhäuser, 1991. MR 92f:60122
16. B. Lindström, On the vector representations of induced matroids, Bull. London Math. Soc. 5 (1973), 85-90. MR 49:95
17. A. A. Milne, The house at Pooh corner, E. P. Dutton & Co., 1928 ff.
18. R. Pemantle, Choosing a spanning tree for the integer lattice uniformly, Ann. Probab. 19 (1991), 1559-1574. MR 92g:60014
19. J. G. Propp and D. B. Wilson, How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph, J. Algorithms 27 (1998), 170-217. MR 99g:60116
20. F. Spitzer, Principles of random walk, Van Nostrand, 1964. MR 30:1521
21. R. P. Stanley, Enumerative combinatorics, vol. l, 2d ed., Cambridge Univ. Press, 1997. MR 98a:05001
22. D B. Wilson, Generating random spanning trees more quickly than the cover time, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 296-303, 1996. MR 97g:68005