相关论文: Predicting Optimal Lengths of Random Knots

Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a…

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility,…

Random walks can be used to search a complex networks for a desired resource. To reduce the number of hops necessary to find the resource, we propose a search mechanism based on building random walks connecting together partial walks that…

We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent $\nu$ are obtained. They are in…

In the first part of this work a summary is provided of some recent experiments and theoretical results which are relevant in the research of systems of polymer rings in nontrivial topological conformations. Next, some advances in modeling…

We estimate the probability regarding polymerization of a macromolecule which is made of distinct monomers. The lattice model of the random walk has been used to mimic the conformations of an ideal chain in two and three dimensions. It has…

We study random walks in random environments generated by the two-dimensional Gaussian free field. More specifically, we consider a rescaled lattice with a small mesh size and view it as a random network where each edge is equipped with an…

We study a model of "elastic" lattice polymer in which a fixed number of monomers $m$ is hosted by a self-avoiding walk with fluctuating length $l$. We show that the stored length density $\rho_m = 1 - <l>/m$ scales asymptotically for large…

The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…

We consider random walks on a tree $G=(V,E)$ with stationary distribution $\pi_v = \mathrm{deg}(v)/2|E|$ for $v \in V$. Let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at vertex $v$ to…

Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node…

We investigate the widely-existing short necklace states in random systems. It is found that their peak width and relative height in lnT spectra keep almost constant when the system length increases, which is explained by the…

In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…

Random walks behave very differently for classical and quantum particles. Here we unveil a ubiquitous distinctive behavior of random walks of a photon in a one-dimensional lattice in the presence of a finite number of traps, at which the…

Many experiments have been done to determine the relative strength of different knots, and these show that the break in a knotted rope almost invariably occurs at a point just outside the `entrance' to the knot. The influence of knots on…

We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…