The Library
Local limit theorems for sequences of simple random walks on graphs
Tools
Croydon, David A. and Hambly, Ben M. (2008) Local limit theorems for sequences of simple random walks on graphs. Potential Analysis, Vol.29 (No.4). pp. 351-389. doi:10.1007/s11118-008-9101-9 ISSN 0926-2601.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/s11118-008-9101-9
Abstract
In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to supercritical percolation clusters, graph trees converging to the continuum random tree and the homogenisation problem for nested fractals. A subsequential local limit theorem for the simple random walks on generalised Sierpinski carpet graphs is also presented.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Statistics | ||||
Library of Congress Subject Headings (LCSH): | Limit theorems (Probability theory), Random walks (Mathematics), Inequalities (Mathematics) | ||||
Journal or Publication Title: | Potential Analysis | ||||
Publisher: | Springer Netherlands | ||||
ISSN: | 0926-2601 | ||||
Official Date: | December 2008 | ||||
Dates: |
|
||||
Volume: | Vol.29 | ||||
Number: | No.4 | ||||
Number of Pages: | 39 | ||||
Page Range: | pp. 351-389 | ||||
DOI: | 10.1007/s11118-008-9101-9 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |