Self-Avoiding Walks and Connective Constants-Reference-Cited by-同舟云学术

Self-Avoiding Walks and Connective Constants

Published:2019 Issue: Volume: Page:215-241
ISSN:2194-1009
Container-title:Springer Proceedings in Mathematics & Statistics
language:
Short-container-title:

Author:

Grimmett Geoffrey R.,Li Zhongyang

Publisher

Springer Singapore

Link

http://link.springer.com/content/pdf/10.1007/978-981-15-0302-3_8

Reference73 articles.

1. Aizenman, M., Grimmett, G.R.: Strict monotonicity of critical points in percolation and ferromagnetic models. J. Stat. Phys. 63, 817–835 (1991)

2. Alm, S.E., Janson, S.: Random self-avoiding walks on one-dimensional lattices. Commun. Stat. Stoch. Models 6, 169–212 (1990)

3. Babai, L.: Vertex-transitive graphs and vertex-transitive maps. J. Graph Theory 15, 587–627 (1991)

4. Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. II, pp. 1447–1540. Elsevier, Amsterdam (1995)

5. Balister, P., Bollobás, B., Riordan, O.: Essential enhancements revisited (2014). https://arxiv.org/abs/1402.0834

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Note on locality of volume growth rate of graphs;Statistics & Probability Letters;2024-03

2. Self‐avoiding walk on the hypercube;Random Structures & Algorithms;2022-09-02

3. Selected Problems in Probability Theory;Lecture Notes in Mathematics;2022-08-03

4. Positive speed self-avoiding walks on graphs with more than one end;Journal of Combinatorial Theory, Series A;2020-10

5. Trapping in self-avoiding walks with nearest-neighbor attraction;Physical Review E;2020-09-18