相关论文: Grover Walks on a Line with Absorbing Boundaries
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
Motivated by queueing applications, we consider a certain class of two-dimensional random walks for which their invariant measure is written as a linear combination of a finite number of product-form terms. In this work, we investigate…
Let $G=(V,E)$ be a finite, connected graph. We investigate a notion of boundary $\partial G \subseteq V$ and argue that it is well behaved from the point of view of potential theory. This is done by proving a number of discrete analogous of…
We consider the adsorption of a semiflexible polymer chain onto interfaces and surfaces by using the differential equation of the distribution function $G(R,L)$ of the end-to-end distance $R$, which is associated with the moment expansion…
We establish limiting absorption principles for contractions on a Hilbert space. Our sufficient conditions are based on positive commutator estimates. We discuss the dynamical implications of this principle to the corresponding…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…
Three-dimensional Monte Carlo simulations provide a striking confirmation to a recent theoretical prediction: the Brownian non-Gaussian diffusion of critical self-avoiding walks. Although the mean square displacement of the polymer center…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
This article analyzes directed lattice paths, when a boundary reflecting or absorbing condition is added to the classical models. The lattice paths are characterized by two time-independent sets of rules (also called steps) which have a…
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, computer science). The aim of this paper is to propose a new approach to obtain some…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
Encounters between walkers performing a random motion on an appropriate structure can describe a wide variety of natural phenomena ranging from pharmacokinetics to foraging. On homogeneous structures the asymptotic encounter probability…
We consider the point-to-point half-space log-gamma polymer model in the unbound phase. We prove that the free energy increment process on the anti-diagonal path converges to the top marginal of a two-layer Markov chain with an explicit…
The absorption lines observed in quasar spectra have given us a detailed picture of the intergalactic medium and the metal abundance and kinematics of high redshift galaxies. In this review, we present an introduction to the field, starting…
We analyze a deterministic form of the random walk on the integer line called the {\em liar machine}, similar to the rotor-router model, finding asymptotically tight pointwise and interval discrepancy bounds versus random walk. This…
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability…
The two major discrete time formulations for quantum walks, coined and scattering, are unitarily equivalent for arbitrary position dependent transition amplitudes and any topology (PRA {\bf 80}, 052301 (2009)). Although the proof explicit…