相关论文: Universal Amplitude Combinations for Self-Avoiding…

Recent breakthroughs in the study of scattering amplitudes have uncovered profound and unexpected connections with combinatorial geometry. These connections range from classical structures -- such as polytopes, matroids, and Grassmannians…

The phenomenon of amplitude death has been explored using a variety of different coupling strategies in the last two decades. In most of the work, the basic coupling arrangement is considered to be static over time, although many realistic…

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

We study the mean and variance of the number of self-intersections of the equilateral isotropic random walk in the plane, as well as the corresponding quantities for isotropic equilateral random polygons (random walks conditioned to return…

Exponential, and not Gaussian, decay of probability density functions was studied by Laplace in the context of his analysis of errors. Such Laplace propagators for the diffusive motion of single particles in disordered media were recently…

Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…

We build upon previous work on the densities of uniform random walks in higher dimensions, exploring some properties of the even moments of these densities and extending a result about their modularity.

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

Returning walks on a lattice are sequences of moves that start at a given lattice site and return to the same site after $n$ steps. Determining the total number of returning walks of a given length $n$ is a typical graph-theoretical problem…

We study the upper tails for the energy of a randomly charged symmetric and transient random walk. We assume that only charges on the same site interact pairwise. We consider annealed estimates, that is when we average over both randomness,…

We consider a self-avoiding walk on the $d$-dimensional hypercubic lattice, terminally attached to an impenetrable hyperplane at which it can adsorb. When a force is applied the walk can be pulled off the surface and we consider the…

We propose an experimental realization of discrete quantum random walks using neutral atoms trapped in optical lattices. The random walk is taking place in position space and experimental implementation with present day technology --even…

Environments with immobile obstacles or void regions that inhibit and alter the motion of individuals within that environment are ubiquitous. Correlation in the location of individuals within such environments arises as a combination of the…

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…

We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…

We study the path behavior of the anisotropic random walk on the two-dimensional lattice Z^2. Simultaneous strong approximations of its components are given.

We consider the optimal paths in a $d$-dimensional lattice, where the bonds have isotropically correlated random weights. These paths can be interpreted as the ground state configuration of a simplified polymer model in a random potential.…

In one-dimensional random walks, the waiting time for each direction transitions is the same, even in the presence of bias, as a consequence of the microscopic-reversibility. We study the symmetry breaking of forward/ backward transition…

We study certain self-interacting walks on the set of integers, that choose to jump to the right or to the left randomly but influenced by the number of times they have previously jumped along the edges in the finite neighbourhood of their…

We consider the Activated Random Walk model in any dimension with any sleep rate and jump distribution and ergodic initial state. We show that the stabilization properties depend only on the average density of particles, regardless of how…