# Self-avoiding walk

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- 2012

We prove that self-avoiding walk on Z is sub-ballistic in any dimension d â‰¥ 2. That is, writing ||u|| for the Euclidean norm of uâ€¦Â (More)

Is this relevant?

2010

2010

- J. Comb. Theory, Ser. A
- 2010

A self-avoiding walk on the square lattice is prudent, if it never takes a step towards a vertex it has already visited. PrÃ©a wasâ€¦Â (More)

Is this relevant?

Review

2009

Review

2009

- 2009

Abstract: We give a survey and unified treatment of functional integral representations for both simple random walk and some selfâ€¦Â (More)

Is this relevant?

2008

2008

- 2008

We consider a long-range version of self-avoiding walk in dimension d > 2(Î± âˆ§ 2), where d denotes dimension and Î± the power-lawâ€¦Â (More)

Is this relevant?

2007

2007

- 2007

We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce anâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. Aâ€¦Â (More)

Is this relevant?

2002

2002

- 2002

A self-avoiding walk with small attractive interactions is described here. The existence of the connective constant isâ€¦Â (More)

Is this relevant?

2001

2001

- 2001

We have developed a transfer matrix algorithm for the enumeration of compact self-avoiding walks on rectangular strips of theâ€¦Â (More)

Is this relevant?

1994

1994

- SODA
- 1994

We present a polynomial time Monte Carlo algorithm for almost uniformly generating and approximately counting self-avoiding walksâ€¦Â (More)

Is this relevant?

1993

1993

- 1993

We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on theâ€¦Â (More)

Is this relevant?