incomplete gamma functionphase transitioncomplete graphself-avoiding walksusceptibilitytransition region
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Critical phenomena in equilibrium statistical mechanics (82B27) Incomplete beta and gamma functions (error functions, probability integral, Fresnel integrals) (33B20)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 201032 (Why is no real title available?)
- Asymptotic expansions for the incomplete gamma function in the transition regions
- Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
- Critical behaviour of self-avoiding walks: that cross a square
- Progress in high-dimensional percolation and random graphs
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Self-avoiding walks crossing a square
- Self-avoiding walks on finite graphs of large girth
- Supercritical self-avoiding walks are space-filling
- The broken supersymmetry phase of a self-avoiding random walk
- The length of self-avoiding walks on the complete graph
- Self-avoiding walks on finite graphs of large girth
- A note on mean-field behavior for self-avoiding walk on branching planes.
- The scaling limit of the weakly self-avoiding walk on a high-dimensional torus
- Unwrapped two-point functions on high-dimensional tori
- Weakly self-avoiding walk on a high-dimensional torus
- The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions
- Two-point functions of random-length random walk on high-dimensional boxes
- Mean-field tricritical polymers
- The length of self-avoiding walks on the complete graph
- Relations between connected and self-avoiding hikes in labelled complete digraphs
- Positive speed self-avoiding walks on graphs with more than one end
- Walks on tiled boards
- Self‐avoiding walk on the hypercube
- Self-avoiding walks of specified lengths on rectangular grid graphs
This page was built for publication: Self-avoiding walk on the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826469)