Related papers: Linearly Bounded Liars, Adaptive Covering Codes, a…
In this paper, we study Grover walks on a line with one and two absorbing boundaries. In particular, we present some results for the absorbing probabilities both in a semi-finite and finite line. Analytical expressions for these absorbing…
Denote by $L_n$ the length of the perimeter of the convex hull of $n$ steps of a planar random walk whose increments have finite second moment and non-zero mean. Snyder and Steele showed that $n^{-1} L_n$ converges almost surely to a…
Error correction codes are a crucial part of the physical communication layer, ensuring the reliable transfer of data over noisy channels. The design of optimal linear block codes capable of being efficiently decoded is of major concern,…
Motivated by the article [M. Takei, Electron. J. Probab. 26 (2021), article no. 104], we study the limit behavior of linearly edge-reinforced random walks on the half-line $\mathbb{Z}_+$ with reinforcement parameter $\delta>0$, and each…
Linear error-correcting codes form the mathematical backbone of modern digital communication and storage systems, but identifying champion linear codes (linear codes achieving or exceeding the best known minimum Hamming distance) remains…
We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…
Search patterns of randomly oriented steps of different lengths have been observed on all scales of the biological world, ranging from the microscopic to the ecological, including in protein motors, bacteria, T-cells, honeybees, marine…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
In this work we consider open quantum random walks on the non-negative integers. By considering orthogonal matrix polynomials we are able to describe transition probability expressions for classes of walks via a matrix version of the…
In this work, we demonstrate robust walking in the bipedal robot Digit on uneven terrains by just learning a single linear policy. In particular, we propose a new control pipeline, wherein the high-level trajectory modulator shapes the…
We establish both the $\limsup$ and the $\liminf$ law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension $d\ge 3$. While for $d \ge 4$, the order of growth in $n$ of such LIL at dimension…
We attempt to analyze a one-dimensional space-inhomogeneous quantum walk (QW) with one defect at the origin, which has two different quantum coins in positive and negative parts. We call the QW "the two-phase QW", which we treated…
We study the absorption time and spreading rate of the discrete-time quantum walk propagating on a line in the presence or absence of an absorber. We analytically establish that in the presence of an absorber, the average absorption time of…
Robustness of huge Transformer-based models for natural language processing is an important issue due to their capabilities and wide adoption. One way to understand and improve robustness of these models is an exploration of an adversarial…
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…
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…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…