Gordon Slade

According to our database, Gordon Slade authored at least 8 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Self-avoiding walk on the hypercube.

Gordon Slade

Random Struct. Algorithms, May, 2023

2013

Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals.

Yuri Mejía Miranda, Gordon Slade

Comb. Probab. Comput., 2013

2006

Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms.

Remco van der Hofstad, Gordon Slade

Comb. Probab. Comput., 2006

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The <i>n</i>-Cube.

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer

Comb., 2006

2005

Asymptotic expansions in <i>n</i>^-1 for percolation critical values on the <i>n</i>-Cube and Z^<i>n</i>.

Remco van der Hofstad, Gordon Slade

Random Struct. Algorithms, 2005

Random subgraphs of finite graphs: I. The scaling window under the triangle condition.

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer

Random Struct. Algorithms, 2005

2003

The lace expansion on a tree with application to networks of self-avoiding walks.

Remco van der Hofstad, Gordon Slade

Adv. Appl. Math., 2003

1995

The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions.

Takashi Hara, Gordon Slade

Comb. Probab. Comput., 1995