Title :
Global information from local observation
Author :
Benjamini, Itai ; Lovász, László
Author_Institution :
Microsoft Res., Redmond, WA, USA
Abstract :
We observe a certain random process on a graph "locally", i.e., in the neighborhood of a node, and would like to derive information about "global" properties of the graph. For example, what can we know about a graph based on observing the returns of a random walk to a given node? Our main result concerns a graph embedded in an orientable surface with genus g, and a process, consisting of random excitations of edges and random balancing around nodes and faces. It is shown how to obtain the genus of the surface in polynomial time from local observations of the process restricted to a connected subgraph whose size is (essentially) O(g2).
Keywords :
computational complexity; graph theory; random processes; connected subgraph; faces; genus; global information; graph; local observation; nodes; orientable surface; polynomial time; random balancing; random edge excitation; random process; random walk returns; Algorithm design and analysis; Birds; Computer science; Distributed algorithms; Information retrieval; Physics computing; Polynomials; Random processes; Sampling methods;
Conference_Titel :
Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on
Print_ISBN :
0-7695-1822-2
DOI :
10.1109/SFCS.2002.1181995