1997
DOI: 10.1103/physrevlett.79.857
|View full text |Cite
|
Sign up to set email alerts
|

Paradoxal Diffusion in Chemical Space for Nearest-Neighbor Walks over Polymer Chains

Abstract: We consider random walks over polymer chains (modeled as simple random walks or self-avoiding walks) and allow from each polymer site jumps to all Euclidean (not necessarily chemical) neighboring sites. For frozen chain configurations the distribution of displacements (DD) of a walker along the chain shows a paradoxal behavior: The DD's width (interquartile distance) grows with time as L~t a , with a ഠ 0.5, but the DD displays large power-law tails. For annealed configurations the DD is a Lévy distribution and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

2
131
0

Year Published

2000
2000
2012
2012

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 137 publications
(133 citation statements)
references
References 18 publications
2
131
0
Order By: Relevance
“…In this context it is interesting to recall that Sokolov et al [20] have shown that correlations between jumps in a Lévy flight in a chemical space destroy the Lévy statistics of the walk.…”
Section: Resultsmentioning
confidence: 99%
“…In this context it is interesting to recall that Sokolov et al [20] have shown that correlations between jumps in a Lévy flight in a chemical space destroy the Lévy statistics of the walk.…”
Section: Resultsmentioning
confidence: 99%
“…On the other hand other questions are envisageable over such structures, for example random transport [14]; this requires solving diffusion-type problems, which are mathematically described by the Laplacian on the structure [16] and the corresponding eigenvalues and eigenvectors [17]. Examples of such problems are anomalous transport of charges and of excitations over networks [18]. Most recent SWN-studies center on a one-dimensional chain supplemented with additional links (AL), which connect sites that are arbitrarily far from each other on the underlying lattice.…”
Section: Introductionmentioning
confidence: 99%
“…Most recent SWN-studies center on a one-dimensional chain supplemented with additional links (AL), which connect sites that are arbitrarily far from each other on the underlying lattice. While this being the simplest SWN envisageable, there are situations in which links between distant sites occur naturally; however, their lengths are then not necessarily uniformly distributed: Considering a polymer chain in solution, monomers which are far apart along the backbone can be quite close to each other in real space, so that for instance energy transfer over the structure may take crosscuts along sites near to each other in space [18]. Now the probability of having such close monomer pairs is related to the return to the origin of random walks, possibly under self-avoiding constraints.…”
Section: Introductionmentioning
confidence: 99%
“…It was also recently argued [7] that "wiring-cost" considerations for spatially embedded networks, such as cortical networks [9] or on-chip logic networks [10], can generate such power-law-suppressed link-length distribution. A physical example of such a power-law SW network arises in diffusion on a randomly folded polymer discussed below [11,12].The addition of random long-range links to a regular d-dimensional network, producing a SW network, leads in many cases to a crossover to mean-field-like behavior [13], effectively becoming equivalent to averaging over the long-range links in an annealed fashion. Here we focus on systems where it is not the case, and the contrast between the quenched and annealed systems is strong [5,14].…”
mentioning
confidence: 99%
“…One case in which the diffusion equation arises is a macromolecule randomly moving along a polymer chain jumping over adjacent segments with nonzero probability [11]; if the macromolecule motion is fast compared to rearrangements of the links, then the network may be considered as quenched [11,15], while if the macromolecule motion is slow compared to the link rearrangements then the network is annealed [11,12]. The equation describing random walk processes is…”
mentioning
confidence: 99%