Weakly directed self-avoiding walks (Q640847): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Random self-avoiding walks on one-dimensional lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4591313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating functions for generating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of prudent self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear recurrences with constant coefficients: The multivariate case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Culminating paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalisation group analysis of weakly self-avoiding walk in dimensions four and higher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prudent self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noncommutative version of the matrix inversion formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the connective constants for two-dimensional self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-avoiding polygons on the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster implementation of the pivot algorithm for self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Self-Avoiding Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel method: a collection of examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Monte Carlo determination of the connective constant of self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500968 / rank
 
Normal rank

Latest revision as of 14:02, 4 July 2024

scientific article
Language Label Description Also known as
English
Weakly directed self-avoiding walks
scientific article

    Statements

    Weakly directed self-avoiding walks (English)
    0 references
    0 references
    21 October 2011
    0 references
    0 references
    enumeration
    0 references
    self-avoiding walks
    0 references
    partially directed bridges
    0 references
    non-D-finite series
    0 references
    random generation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references