Determining the Genus of a Map by Local Observation of a Simple Random Process (2002)
| Venue: | In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Benjamini02determiningthe,
author = {Itai Benjamini and László Lovász},
title = {Determining the Genus of a Map by Local Observation of a Simple Random Process},
booktitle = {In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS},
year = {2002},
pages = {701--710}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Given a graph embedded in an orientable surface, a process with stationary increments, consisting of random excitations and random node and face balancing, is constructed and analyzed. It is shown that, given a priori bounds g on the genus and n on the number of nodes, one can determine the genus of the surface from local observations of the process, restricted to any connected subgraph which cannot be separated from the rest of the graph by fewer than 16g nodes. The observation time and the computation time are polynomial in n .
Citations
| 161 | Graphs on Surfaces - Mohar, Thomassen - 2001 |
| 143 | Geometry and Spectra of Compact Riemann Surfaces (Birkhäuser - Buser - 1992 |
| 69 | Finite Markov Chains and Algorithmic Applications - Häggström - 2002 |
| 50 | Tutte, The dissection of rectangles into squares - Brooks, Smith, et al. - 1940 |
| 44 | Discrete Riemann Surfaces and the Ising Model - MERCAT |
| 30 | Mixing times, Microsurveys in discrete probability - Lovász, Winkler - 1997 |
| 20 | Basic properties of discrete analytic functions - Duffin |
| 14 | Fonctions préharmoniques et fonctions préholomorphes - Ferrand - 1944 |
| 8 | Distinguishing and reconstructing sceneries from observations along random walk paths. Microsurveys in discrete probability - Kesten - 1997 |
| 4 | My favorite 6 open problems in mathematical probability - Aldous - 2001 |
| 4 | Volume estimates and rapid mixing, Flavors of Geometry - Bollobás - 1997 |
