Identifying a finite graph by its random walk
- In the following we illustrate by two examples and simplify the statement of the main result of a joint paper with Peter Scheffel
Author: | Heinrich von Weizsäcker |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-7436 |
Document Type: | Preprint |
Language of publication: | English |
Year of Completion: | 1999 |
Year of first Publication: | 1999 |
Publishing Institution: | Technische Universität Kaiserslautern |
Date of the Publication (Server): | 2000/04/03 |
Source: | Asympt. Methods in Prob. and Math. Stat., Conference Proceedings St. Petersburg, 1998, 4 Seiten |
Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |