Related papers: Matrix geometric approach for random walks: stabil…
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…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…
Quantum counterparts of certain simple classical systems can exhibit chaotic behaviour through the statistics of their energy levels and the irregular spectra of chaotic systems are modelled by eigenvalues of infinite random matrices. We…
This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite…
Our objective is to explore random walks on the general linear group, constrained to a specific domain, with a primary focus on establishing the conditioned local limit theorem. This paper marks the initial stride toward achieving this…
In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in terms of stationary…
We consider the continuous-time random walk of a particle in a two-dimensional self-affine quenched random potential of Hurst exponent $H>0$. The corresponding master equation is studied via the strong disorder renormalization procedure…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…
We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…
We consider a random walk on a second countable locally compact topological space endowed with an invariant Radon measure. We show that if the walk is symmetric and if every subset which is invariant by the walk has zero or infinite…
An irreversible Markov-chain Monte Carlo (MCMC) algorithm with skew detailed balance conditions originally proposed by Turitsyn et al. is extended to general discrete systems on the basis of the Metropolis-Hastings scheme. To evaluate the…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
We consider nonintersecting random walks satisfying the condition that the increments have a finite moment generating function. We prove that in a certain limiting regime where the number of walks and the number of time steps grow to…
We study an infinite system of independent symmetric random walks on a hierarchical group, in particular, the c-random walks. Such walks are used, e.g., in population genetics. The number variance problem consists in investigating if the…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…