We continue the study of a particle (atom, molecule) undergoing an unbiased random walk on the Sierpinski gasket, and obtain for the gasket and tower the eigenvalue spectrum of the associated stochastic master equation. Analytic expressions for recurrence relations among the eigenvalues are derived. The recurrence relations obtained are compared with those determined for two Euclidean lattices, the closed chain with an absorbing site and a finite chain with an absorbing site at one end. We check and confirm the internal consistency between the smallest eigenvalue and the mean walklength in each of the cases studied. Attention is drawn to the relevance of the results obtained to a problem of electron transfer in proteins.
8 November 2000 in The Journal of Chemical Physics
Numerically-exact values of the mean walk length before first encounter for reactants diffusing on a lattice are calculated by generalizing a Markovian method introduced previously. The approach developed is illustrated by presenting results for two random walkers diffusing simultaneously on a square-planar lattice; the results obtained are compared with those calculated assuming one of the reactant partners is stationary. In almost all cases, it is found that the former process is the more efficient. Analytic arguments are presented and Monte Carlo studies are carried out to support the results obtained.
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly self-similar as one goes from one generation of the family to the next. Under these circumstances, the total probability that the walker hits a trap is determined exactly as a function of the single-step survival probability of the mortal walker. On the generation graph of the family, this probability is shown to be given by the iterate of a certain scaling function or map . The properties of the map then determine, in each case, the behavior of the trapping probability, the mean time to trapping, the temporal scaling factor governing the random walk dimension on the graph, and other related properties. The formalism is illustrated for the cases of a linear hierarchical lattice and the Sierpinski graphs in two and three Euclidean dimensions. We find an effective reduction of the random walk dimensionality due to the ballistic behavior of the surviving particles induced by the mortality constraint. The relevance of this finding for experiments involving travel times of particles in diffusion-decay systems is discussed.
We present exact, analytic results for the mean time to trapping of a random walker on the class of deterministic Sierpinski graphs embedded in $d\phantom{\rule{0.16em}{0ex}}$\ge${}2$ Euclidean dimensions, when both nearest-neighbor (NN) and next-nearest-neighbor (NNN) jumps are included. Mean first-passage times are shown to be modified significantly as a consequence of the fact that NNN transitions connect fractals of two consecutive generations.
A geometrical model has been developed to study the unfolding of iso-1 cytochrome c. The model draws on the crystallographic data reported for this protein. These data were used to calculate the distance between specific residues in the folded state, and in a sequence of extended states defined by n = 3, 5, 7, 9, 11, 13, and 15 residue units. Exact calculations carried out for each of the 103 residues in the polypeptide chain demonstrate that different regions of the chain have different unfolding histories. Regions where there is a persistence of compact structures can be identified, and this geometrical characterization is fully consistent with analyses of time-resolved fluorescence energy-transfer (TrFET) data using dansyl-derivatized cysteine side-chain probes at positions 39, 50, 66, 85, and 99. The calculations were carried out assuming that different regions of the polypeptide chain unfold synchronously. To test this assumption, lattice Monte Carlo simulations were performed to study systematically the possible importance of asynchronicity. Calculations show that small departures from synchronous dynamics can arise if displacements of residues in the main body of the chain are much more sluggish than near-terminal residues.