Related papers: The hyperbolic geometry of random transpositions

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

We consider the harmonic measure on the Gromov boundary of a nonamenable hyperbolic group defined by a finite range random walk on the group, and study the corresponding orbit equivalence relation on the boundary. It is known to be always…

The main results in this paper concern large and moderate deviations for the radial component of a $n$-dimensional hyperbolic Brownian motion (for $n\geq 2$) on the Poincar\'{e} half-space. We also investigate the asymptotic behavior of the…

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

Let $X_1,..., X_n$ be independent, uniformly random points from $[0,1]^2$. We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points $n$…

Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and…

Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-L\"of, Karp and Aldous to give a simple proof of the asymptotic normality of the size of the giant component in the random graph $G(n,p)$ above the phase…

We study boundaries arising from limits of ratios of transition probabilities for random walks on relatively hyperbolic groups. We extend, as well as determine significant limitations of, a strategy employed by Woess for computing…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Let $X_1,X_2$ be independent random walks on $\mathbf{Z}_n^d$, $d\geq3$, each starting from the uniform distribution. Initially, each site of $\mathbf{Z}_n^d$ is unmarked, and, whenever $X_i$ visits such a site, it is set irreversibly to…

We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…

Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…

We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…

Motivated by a problem arising from pharmaceutical science [B. Baeumer et al., Discr. Contin. Dyn. Sys. B 12], we study random walks on the contact graph of a bidisperse random sphere packing. For a random walk on the unweighted graph that…

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

In this note, we present examples of non-quasi-geodesic metric spaces which are hyperbolic (i.e., satisfying the Gromov's $4$-point condition) while the intersection of any two metric balls therein does not either "look like" a ball or has…