3 papers
cond-mat.stat-mech2005
Quenched Averages for self-avoiding walks and polygons on deterministic fractals
Sumedha, Deepak Dhar
We study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. Different sites on such lattices are not equivalent,…
cond-mat.stat-mech2004
Efficiency of the Incomplete Enumeration algorithm for Monte-Carlo simulation of linear and branched polymers
Sumedha, Deepak Dhar
We study the efficiency of the incomplete enumeration algorithm for linear and branched polymers. There is a qualitative difference in the efficiency in these two cases. The averag…
cond-mat.stat-mech2003
Distribution of Transverse Distances in Directed Animals
Sumedha, Deepak Dhar
We relate , the average number of sites at a transverse distance in the directed animals with sites in transverse dimensions, to the two-point correla…