OurBigBook About$ Donate
 Sign in Sign up

Root-moment bound for open self-avoiding walks (E(κn1/n​)≤pcn1/n​)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Lattice path Self-avoiding walk
Created 2026-10-06 Updated 2026-10-07  0 By others on same topic  0 Discussions Create my own version
In independent bond percolation on a graph, let cn​ be the number of n-step self-avoiding walks from a fixed graph vertex and κn​ the number that are open. Then Eκn​=cn​pn. The Jensen inequality for the concave function t1/n gives E(κn1/n​)≤pcn1/n​. No independence between different self-avoiding walk indicators is needed. When cn1/n​→μ, the limit superior is at most pμ.

 Ancestors (6)

  1. Self-avoiding walk
  2. Lattice path
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 204 / 2 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook