Related papers: Localization in simple multiparticle catalytic abs…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
We study transport within a spatially heterogeneous one-dimensional quantum walk with a combination of hierarchical and random barriers. Recent renormalization group calculations for a spatially disordered quantum walk with a regular…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
We investigate the growth of the total number of particles in a symmetric exclusion process driven by a localized source. The average total number of particles entering an initially empty system grows with time as t^{1/2} in one dimension,…
We consider a branching-selection particle system on the real line. In this model the total size of the population at time $n$ is limited by $\exp\left(a n^{1/3}\right)$. At each step $n$, every individual dies while reproducing…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…
We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRW). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the…
This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
We consider one-dimensional random walks in random environment which are transient to the right. Our main interest is in the study of the sub-ballistic regime, where at time $n$ the particle is typically at a distance of order $O(n^\kappa)$…
We consider a system of clusters made of elementary building blocks, monomers, and evolving via collisions between diffusing monomers and immobile composite clusters. In our model, the cluster-monomer collision can lead to the attachment of…