Growing self avoiding walk trees

被引:2
作者
Padmanabhan, A. S. [1 ,2 ]
机构
[1] Mahatma Gandhi Univ, Sch Chem Sci, Kottayam 686560, Kerala, India
[2] Mahatma Gandhi Univ, Ctr High Performance Comp, Kottayam 686560, Kerala, India
关键词
Growing self avoiding walk; Depth first search trees; Condensation polymerization; Growth process in polymerization; CARLO SERIES ANALYSIS; GROWTH; PERCOLATION;
D O I
10.1007/s10910-013-0267-z
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The Growing self avoiding walk model (GSAW) was proposed to explain statistical mechanics of the growth process in polymerization. Close examination of the model reveals that it is suited only for addition polymerization where only one monomer unit is added to the growing polymer chain. In this paper we propose a model for step growth or condensation polymerisation, where all of the monomer is converted first to dimer, all dimers are converted to tetramer etc. In the calculation of probabilities of the walker taking a step in a specified direction in the GSAW model the probability is the reciprocal of the number of steps available if the walker looks one step ahead. It is seen that our model for condensation polymerization GSAW can be generalized to the walker looking a finite number of steps ahead (instead of one only) for the purpose of calculation of probabilities. This is explained in detail in the first section of the paper. In the second section of the paper we explain the use of the Depth first search (DFS) algorithm in the calculation of probabilities and moments for the generalized growing self avoiding walk model. In the third section of the paper we report the exact values of the mean square end to end distances and relevant survival probabilities for the model. When GSAW was first proposed there was a controversy over whether it belonged to the same universality class as the True self avoiding walk or that of the self avoiding walk . At that time it was conclusively shown that the GSAW model cannot belong to the same universality class as the true self avoiding walk model. However it was never conclusively shown that for GSAW. In this paper we propose two methods of studying this problem. One method is rigorous analysis of the DFS algorithm. We explain how this algorithm can be used to study restricted random walks with finite memory and self avoiding walks. The second method proposed by us is a detailed analysis of the generalised GSAW model proposed by us. This paper is to be viewed as an introductory paper on a new model that should be of interest to both chemists and mathematicians.
引用
收藏
页码:355 / 367
页数:13
相关论文
共 19 条
  • [1] ASYMPTOTIC-BEHAVIOR OF THE TRUE SELF-AVOIDING WALK
    AMIT, DJ
    PARISI, G
    PELITI, L
    [J]. PHYSICAL REVIEW B, 1983, 27 (03) : 1635 - 1645
  • [2] [Anonymous], 1993, The Self-Avoiding Walk
  • [3] Bondy J. A., 2008, GRADUATE TEXTS MATH
  • [4] Bradley M.R., 1992, PHYS REV A, V45, P8513
  • [5] Clisby N.J., 2010, STAT PHYS, V140, P49
  • [6] Calculation of the connective constant for self-avoiding walks via the pivot algorithm
    Clisby, Nathan
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2013, 46 (24)
  • [7] Accurate Estimate of the Critical Exponent ν for Self-Avoiding Walks via a Fast Implementation of the Pivot Algorithm
    Clisby, Nathan
    [J]. PHYSICAL REVIEW LETTERS, 2010, 104 (05)
  • [8] EXPERIMENTAL REALIZATION OF TRUE SELF-AVOIDING WALKS
    FAMILY, F
    DAOUD, M
    [J]. PHYSICAL REVIEW B, 1984, 29 (03): : 1506 - 1507
  • [9] MONTE-CARLO SERIES ANALYSIS OF IRREVERSIBLE SELF-AVOIDING WALKS .1. THE INDEFINITELY-GROWING SELF-AVOIDING WALK (IGSAW)
    KREMER, K
    LYKLEMA, JW
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1985, 18 (09): : 1515 - 1531
  • [10] KINETIC GROWTH-MODELS
    KREMER, K
    LYKLEMA, JW
    [J]. PHYSICAL REVIEW LETTERS, 1985, 55 (19) : 2091 - 2091