相关论文: Random walks and random fixed-point free involutio…

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enables the fastest spread of information? In this paper, we assume the dynamics of spread is…

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,…

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

We study three different random walk models on several two-dimensional lattices by Monte Carlo simulations. One is the usual nearest neighbor random walk. Another is the nearest neighbor random walk which is not allowed to backtrack. The…

We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

We show that random walk in uniformly elliptic i.i.d. environment in dimension $\geq5$ has at most one non zero limiting velocity. In particular this proves a law of large numbers in the distributionally symmetric case and establishes…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

Let $W$ be a finite Weyl group and $\widetilde W$ the corresponding affine Weyl group. A random element of $\widetilde W$ can be obtained as a reduced random walk on the alcoves of $\widetilde W$. By a theorem of Lam (Ann. Prob. 2015), such…

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

We consider the edge-reinforced random walk with multiple (but finitely many) walkers which influence the edge weights together. The walker which moves at a given time step is chosen uniformly at random, or according to a fixed order.…

We prove Gaussian concentration inequalities for maximal displacement of compactly supported random walks on a compactly generated locally compact group with polynomial growth. Concentration inequalities with different exponents hold for…

In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median,…

Using the results obtained by the non commutative geometry techniques applied to the Harper equation, we derive the areas distribution of random walks of length $ N $ on a two-dimensional square lattice for large $ N $, taking into account…

In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…