This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
We consider the nearest-neighbor simple random walk on Zd, d 2, driven by a field of bounded random conductances xy [0, 1]. The conductance law is i.i.d. subject to the condition...
Noam Berger, Marek Biskup, Christopher E. Hoffman,...