On Continuous-Time Self-Avoiding Random Walk in Dimension Four

We study the distribution of the end-to-end distance of continuous-time self-avoiding random walks (CTRW) in dimension four from two viewpoints. From a real-space renormalization-group map on probabilities, we conjecture the asymptotic behavior of the end-to-end distance of a weakly self-avoiding random walk (SARW) that penalizes two-body interactions of random walks in dimension four on a hierarchical lattice. Then we perform the Monte Carlo computer simulations of CTRW on the four-dimensional integer lattice, paying special attention to the difference in statistical behavior of the CTRW compared with the discrete-time random walks. In this framework, we verify the result already predicted by the renormalization-group method and provide new results related to enumeration of self-avoiding random walks and calculation of the mean square end-to-end distance and gyration radius of continous-time self-avoiding random walks.     

A General Random Walk Model of Molecular Motor

A general random walk model framework is presented which can be used to statistically describe the internaldynamics and external mechanical movement of molecular motors along filament track. The motion of molecular motorin a periodic potential and a constant force is considered. We show that the molecular motor‘s movement becomesslower with the potential barrier increasing, but if the forceis increased, the molecular motor‘s movement becomesfaster. The relation between the effective rate constant and the potential barrier‘s height, and that between the effectiverate constant and the value of the force are discussed. Our results are consistent with the experiments and relevanttheoretical consideration, and can be used to explain some physiological phenomena.     

Random Walk on the Range of Random Walk

We study the random walk X on the range of a simple random walk on ℤ ^d in dimensions d≥4. When d≥5 we establish quenched and annealed scaling limits for the process X, which show that the intersections of the original simple random walk path are essentially unimportant. For d=4 our results are less precise, but we are able to show that any scaling limit for X will require logarithmic corrections to the polynomial scaling factors seen in higher dimensions. Furthermore, we demonstrate that when d=4 similar logarithmic corrections are necessary in describing the asymptotic behavior of the return probability of X to the origin.     

A General Random Walk Model of Molecular Motor

A general random walk model framework is presented which can be used to statistically describe the internal dynamics and external mechanical movement of molecular motors along filament track. The motion of molecular motor in a periodic potential and a constant force is considered. We show that the molecular motor‘s movement becomes slower with the potential barrier increasing, but if the force is increased, the molecular motor‘‘s movement becomes faster. The relation between the effective rate constant and the potential battler‘s height, and that between the effective rate constant and the value of the force are discussed. Our results are consistent with the experiments and relevant theoretical consideration, and can be used to explain some physiological phenomena.     

Velocity and Dispersion for a Two-Dimensional Random Walk

In the paper, we consider the transport of a two-dimensional random walk. The velocity and the dispersion of this two-dimensional random walk are derived. It mainly show that： （i） by controlling the values of the transition rates, the direction of the random walk can be reversed; （ii） for some suitably selected transition rates, our two-dimensional random walk can be efficient in comparison with the one-dimensional random walk. Our work is motivated in part by the challenge to explain the unidirectional transport of motor proteins. When the motor proteins move at the turn points of their tracks （i.e., the cytoskeleton filaments and the DNA molecular tubes）, some of our results in this paper can be used to deal with the problem.     

Stationary Probability and First-Passage Time of Biased Random Walk

In this paper, we consider the stationary probability and first-passage time of biased random walk on 1D chain, where at each step the walker moves to the left and right with probabilities p and q respectively (0≤p, q≤1, p+q=1). We derive exact analytical results for the stationary probability and first-passage time as a function of p and q for the first time. Our results suggest that the first-passage time shows a double power-law F~(N-1)^γ, where the exponent γ=2 for N<|p-q|^-1 and γ=1 for N>|p-q|^-1. Our study sheds useful insights into the biased random-walk process.     

The Random Average Process and Random Walk in a Space-Time Random Environment in One Dimension

We study space-time fluctuations around a characteristic line for a one-dimensional interacting system known as the random average process. The state of this system is a real-valued function on the integers. New values of the function are created by averaging previous values with random weights. The fluctuations analyzed occur on the scale n ^1/4, where n is the ratio of macroscopic and microscopic scales in the system. The limits of the fluctuations are described by a family of Gaussian processes. In cases of known product-form invariant distributions, this limit is a two-parameter process whose time marginals are fractional Brownian motions with Hurst parameter 1/4. Along the way we study the limits of quenched mean processes for a random walk in a space-time random environment. These limits also happen at scale n ^1/4 and are described by certain Gaussian processes that we identify. In particular, when we look at a backward quenched mean process, the limit process is the solution of a stochastic heat equation.     

General Asymptotics of the Density of a Restricted Coalescing Random Walk System

These results explore the asymptotic behavior of the density of a system of coalescing random walks where particles begin from only a subspace of the integer lattice and are allowed to walk anywhere on the lattice. They generalize results by Bramson and Griffeath from 1980.⁽¹⁾ Since the probability that a given site is occupied depends on how far that site is from the originating subspace, the density of the system at a given time must be re-defined. However, the general idea is still that if the density is larger than we expect at a given time, more coalescing events will occur, and the density will correct itself over time.     

Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs

In this paper we define direct product of graphs and give a recipe for obtaining probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph is obtained by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determining probability of walk on compficated graphs. Using this method, we calculate the probability of Continuous-time classical and quantum random walks on many of finite direct product Cayley graphs （complete cycle, complete Kn, charter and n-cube）. Also, we inquire that the classical state the stationary uniform distribution is reached as t→∞ but for quantum state is not always satisfied.     

The Critical Attractive Random Polymer in Dimension One

A polymer chain with attractive and repulsive forces between the building blocks is modeled by attaching a weight e ^– for every self-intersection and e ^/(2d) for every self-contact to the probability of an n-step simple random walk on ^d , where , >0 are parameters. It is known that for d=1 and > the chain collapses down to finitely many sites, while for d=1 and < it spreads out ballistically. Here we study for d=1 the critical case = corresponding to the collapse transition and show that the end-to-end distance runs on the scale _n = (log n)^–1/4. We describe the asymptotic shape of the accordingly scaled local times in terms of an explicit variational formula and prove that the scaled polymer chain occupies a region of size _n times a constant. Moreover, we derive the asymptotics of the partition function.     

A Semi-Deterministic Random Walk with Resetting

We consider a discrete-time random walk (xt) which, at random times, is reset to the starting position and performs a deterministic motion between them. We show that the quantity determines if the system is averse, neutral or inclined towards resetting. It also classifies the stationary distribution. Double barrier probabilities, first passage times and the distribution of the escape time from intervals are determined.     

Wavefunction Collapse and Random Walk

Wavefunction collapse models modify Schrödinger's equation so that it describes the rapid evolution of a superposition of macroscopically distinguishable states to one of them. This provides a phenomenological basis for a physical resolution to the so-called measurement problem. Such models have experimentally testable differences from standard quantum theory. The most well developed such model at present is the Continuous Spontaneous Localization (CSL) model in which a universal fluctuating classical field interacts with particles to cause collapse. One side effect of this interaction is that the field imparts energy to the particles: experimental evidence on this has led to restrictions on the parameters of the model, suggesting that the coupling of the classical field to the particles must be mass-proportional. Another side effect is that the field imparts momentum to particles, causing a small blob of matter to undergo random walk. Here we explore this in order to supply predictions which could be experimentally tested. We examine the translational diffusion of a sphere and a disc, and the rotational diffusion of a disc, according to CSL. For example, we find that the rms distance an isolated 10^–5 cm radius sphere diffuses is (its diameter, 5 cm) in (20 sec, a day), and that a disc of radius 2 10^–5 cm and thickness 0.5 10^–5 cm diffuses through 2rad in about 70 sec (this assumes the standard CSL parameter values). The comparable rms diffusions of standard quantum theory are smaller than these by a factor 10^–3±1. It is shown that the CSL diffusion in air at STP is much reduced and, indeed, is swamped by the ordinary Brownian motion. It is also shown that the sphere's diffusion in a thermal radiation bath at room temperature is comparable to the CSL diffusion, but is utterly negligible at liquid He temperature. Thus, in order to observe CSL diffusion, the pressure and temperature must be low. At the low reported pressure of 5 10^–17 Torr, achieved at 4.2°K, the mean time between air molecule collisions with the (sphere, disc) is (80, 45)min. This is ample time for observation of the putative CSL diffusion with the standard parameters and, it is pointed out, with any parameters in the range over which the theory may be considered viable. This encourages consideration of how such an experiment may actually be performed, and the paper closes with some thoughts on this subject.     

A Note on Transience Versus Recurrence for a Branching Random Walk in Random Environment

We consider a branching random walk in random environment on ^d where particles perform independent simple random walks and branch, according to a given offspring distribution, at a random subset of sites whose density tends to zero at infinity. Given that initially one particle starts at the origin, we identify the critical rate of decay of the density of the branching sites separating transience from recurrence, i.e., the progeny hits the origin with probability <1 resp. =1. We show that for d3 there is a dichotomy in the critical rate of decay, depending on whether the mean offspring at a branching site is above or below a certain value related to the return probability of the simple random walk. The dichotomy marks a transition from local to global behavior in the progeny that hits the origin. We also consider the situation where the branching sites occur in two or more types, with different offspring distributions, and show that the classification is more subtle due to a possible interplay between the types. This note is part of a series of papers by the second author and various co-authors investigating the problem of transience versus recurrence for random motions in random media.     

Scaling Argument of Anisotropic Random Walk

In this paper, we analytically discuss the scaling properties of the average square end-to-end distance 〈R²〉for anisotropic random walk in D-dimensional space (D≥2), and the returning probability P_n( r₀) for the walker into a certain neighborhood of the origin. We will not only give the calculating formula for 〈R²〉and P_n(r₀), but also point out that if there is a symmetric axis for the distribution of the probability density of a single step displacement, we always obtain 〈R²_⊥n〉～n, where ⊥ refers to the projections of the displacement perpendicular to each symmetric axes of the walk; in D-dimensional space with D symmetric axes perpendicular to each other, we always have 〈R_n²〉～n and the random walk will be like a purely random motion; if the number of inter-perpendicular symmetric axis is smaller than the dimensions of the space, we must have 〈R_n²〉～n² for very large n and the walk will be like a ballistic motion. It is worth while to point out that unlike the isotropic random walk in one and two dimensions, which is certain to return into the neighborhood of the origin, generally there is only a nonzero probability for the anisotropic random walker in two dimensions to return to the neighborhood.     

On Origin of Power-Law Distributions in Self-Organized Criticality from Random Walk Treatment

The origin of power-law distributions in self-organized criticality is investigated by treating the variation of the number of active sites in the system as a stochastic process. An avalanche is then regarded as a first-return random walk process in a one-dimensional lattice. We assume that the variation of the number of active sites has three possibilities in each update： to increase by 1 with probability f1, to decrease by 1 with probability f2, or remain unchanged with probability 1 - f1 - f2. This mimics the dynamics in the system. Power-law distributions of the lifetime are found when the random walk is unbiased with equal probability to move in opposite directions. This shows that power-law distributions in self-organized criticality may be caused by the balance of competitive interactions.     

Cryptanalysis of an Image Encryption Algorithm Based on Random Walk and Hyperchaotic Systems

Recently, an image encryption algorithm based on random walk and hyperchaotic systems has been proposed. The main idea of the original paper is to scramble the plain image by means of random walk matrix and then to append diffusion. In this paper, the encryption method with security holes is analyzed by chosen plaintext attack. In addition, this paper improves the original encryption algorithm. The experimental and simulation results show that the improved algorithm has the advantages of the original and can improve the ability to resist attack.     

Discrete Green's Function for Lattice Random Walk

１　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｏｐｔｉｃａｌｔｏｍｏｇｒａｐｈｙｐｒｏｖｉｄｅｓａｎａｌｔｅｒｎａｔｉｖｅｔｅｃｈｎｏｌｏｇｙｔｏｐｒｏｂｅｂｒｅａｓｔｃａｎｃｅｒａｎｄｍｏｎｉｔｏｒｈｕｍａｎｔｉｓｓｕｅ’ｓｆｕｎｃｔｉｏｎａｌｐａｒａｍｅｔｅｒｎｏｎｉｎｖａｓｉｖｅｌｙ［１,２］．Ｐｈｏｔｏｎｍｉｇｒａｔｉｏｎｉｎｔｉｓｓｕｅｐｌａｙｓａｋｅｙｒｏｌｅｉｎｏｐｔｉｃａｌｔｏｍｏｇｒａｐｈｙ．Ｒｅｃｅｎｔｌｙ,ａｌａｔｔｉｃｅｒａｎｄｏｍｗａｌｋｍｏｄｅｌ［３,４］ｉｓｅｍｐｌｏｙｅｄｔｏｄ…     

Discrete Green's Function for Lattice Random Walk

A lattice random walk model based on particles scattering on discrete lattice of homogenous space is introduced. The discrete Green's function (DFG) for two-dimensional and three-dimensional lattice random walk of photon is found and proved by mathematical induction. The convolution theorem of photon lattice random walk is presented. They can be used with the method of images to calculate the photon density distribution in semi-infinite and finite slab homogenous turbid media such as tissue.     

Escape of a Uniform Random Walk from an Interval

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [−a,a]. For a of the order of one, the exit probabilities to each edge of the interval and the exit time from the interval exhibit anomalous properties stemming from the change in the minimum number of steps to escape the interval as a function of the starting point. As a decreases, first-passage properties approach those of continuum diffusion, but non-diffusive effects remain because of residual discreteness effects. PACS: 02.50.C2, 05.40.Fb