OurBigBook About$ Donate
 Sign in Sign up

Connective constant (κ)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Lattice path Self-avoiding walk
2026-09-28  1 By others on same topic  0 Discussions Create my own version
If bn​ counts the n-step self-avoiding walks from a fixed vertex of a transitive lattice, the connective constant is the exponential growth rate
κ=limn→∞​bn1/n​.
(1)
Submultiplicativity of bn​ and the Fekete lemma applied to logbn​ prove existence of this limit.

 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 / 2021 / iii / Paper 204 / 1 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Connective constant by Wikipedia Bot  1
 View more
The **connective constant** is a term used in statistical physics and combinatorics, particularly in the study of percolation theory and random walks on lattices. It quantifies the growth rate of connected clusters in a random graph or a lattice structure.
 Read the full article
  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