UNIVERSITÄTSBIBLIOTHEK
  • search hit 1 of 3
Back to Result List

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

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Heinrich von Weizsäcker
URN (permanent link):urn:nbn:de:hbz:386-kluedo-7436
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of Publication:1999
Publishing Institute: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:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011