scientific article; zbMATH DE number 1024108

zbMath0872.60076MaRDI QIDQ4341806

Gordon Slade, Neal Madras

Publication date: 18 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

critical exponentsMonte Carlo methodsstatistical mechanicslace expansionself-avoiding walkpolymer scienceratio limit theoremsKesten's pattern theorem

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Statistical mechanics of polymers (82D60) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)

Related Items (43)

Long proteins with unique optimal foldings in the H-P model ⋮ Spatial mixing and the connective constant: optimal bounds ⋮ Exact solution of weighted partially directed walks crossing a square ⋮ Self-avoiding walks and multiple context-free languages ⋮ Random state transitions of knots: a first step towards modeling unknotting by type II topoisomerases ⋮ The exit distribution for smart kinetic walk with symmetric and asymmetric transition probability ⋮ Interacting self-avoiding polygons ⋮ Unwrapped two-point functions on high-dimensional tori ⋮ Site monotonicity and uniform positivity for interacting random walks and the spin \(O(N)\) model with arbitrary \(N\) ⋮ A formula for crossing probabilities of critical systems inside polygons ⋮ Probability distributions for Markov chain based quantum walks ⋮ The self-avoiding walk spanning a strip ⋮ On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model ⋮ The \(O(n)\) loop model on a three-dimensional lattice ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ The role of entropy in topological quantum error correction ⋮ Computing and counting longest paths on circular-arc graphs in polynomial time ⋮ Shifted critical threshold in the loop \(O(n)\) model at arbitrarily small \(n\) ⋮ A non-intersecting random walk on the Manhattan lattice and \(\mathrm{SLE}_{6}\) ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018 ⋮ Transforming fixed-length self-avoiding walks into radial \(\text{SLE}_{8/3}\) ⋮ How large is large? Estimating the critical disorder for the Anderson model ⋮ The distribution of first hitting times of random walks on directed Erdős–Rényi networks ⋮ The length of self-avoiding walks on the complete graph ⋮ Semiflexible crossing-avoiding trails on plane-filling fractals ⋮ The smart kinetic self-avoiding walk and Schramm Loewner evolution ⋮ A model of self‐avoiding random walks for searching complex networks ⋮ The complexity of flood filling games ⋮ Exact solution of two classes of prudent polygons ⋮ The generation of random equilateral polygons ⋮ Tree-based models for random distribution of mass ⋮ A solution space for a system of null-state partial differential equations. I ⋮ A solution space for a system of null-state partial differential equations. II ⋮ A solution space for a system of null-state partial differential equations. III ⋮ A solution space for a system of null-state partial differential equations. IV ⋮ Scaling limit of ballistic self-avoiding walk interacting with spatial random permutations ⋮ Whole-plane self-avoiding walks and radial Schramm-Loewner evolution: a numerical study ⋮ Positive speed self-avoiding walks on graphs with more than one end ⋮ Lower bounds on the localisation length of balanced random quantum walks ⋮ Counting Method for Multi-party Computation over Non-abelian Groups ⋮ Conformal invariance predictions for the three-dimensional self-avoiding walk ⋮ The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks ⋮ Bounds for minimum step number of knots confined to tubes in the simple cubic lattice

This page was built for publication: