Related papers: Pattern Avoiding Permutations as Walks

The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…

The Levy Walk is the process with continuous sample paths which arises from consecutive linear motions of i.i.d. lengths with i.i.d. directions. Assuming speed 1 and motions in the domain of beta-stable attraction, we prove functional limit…

By modifying the automaton used by P{\"o}nitz and Tittman [4], and considering loops of length up to 26, we obtain 2.662343 as an upper bound for the connective constant in the lattice Z 2 .

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…

A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…

We construct an exact expression for the site percolation threshold p_c on a quasi-regular tree, and a related exact lower bound for a quasi-regular graph. Both are given by the inverse spectral radius of the appropriate Hashimoto matrix…

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

We reconsider the problem of even-visiting random walks in one dimension. This problem is mapped onto a non-Hermitian Anderson model with binary disorder. We develop very efficient numerical tools to enumerate and characterize even-visiting…

Consider an expander graph in which a $\mu$ fraction of the vertices are marked. A random walk starts at a uniform vertex and at each step continues to a random neighbor. Gillman showed in 1993 that the number of marked vertices seen in a…

We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…

Recently, a generalized Bernoulli process (GBP) was developed as a stationary binary sequence that can have long-range dependence. In this paper, we find the scaling limit of a random walk that follows GBP. The result is a new class of…

In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…

The scaling limit of the two-dimensional self-avoiding walk (SAW) is believed to be given by the Schramm-Loewner evolution (SLE) with the parameter kappa equal to 8/3. The scaling limit of the SAW has a natural parameterization and SLE has…

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

Let $S_n$ be the set of permutations on $\{1,\,\dots,\,n\}$ and $\pi\in S_n$. Let $\mathrm{d}(\pi)$ be the arithmetic average of $\{|i-\pi(i)|;\;1\le i\le n\}$. Then $\mathrm{d}(\pi)/n\in[0,\,1/2]$, the expected value of $\mathrm{d}(\pi)/n$…

The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…

A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…

We consider random walks on ``balanced multislices'' of any ``grid'' that respects the ``symmetries'' of the grid, and show that a broad class of such walks are good spectral expanders. (A grid is a set of points of the form $\mathcal{S}^n$…

We study the distribution of the area and perimeter of the convex hull of the "true" self-avoiding random walk in a plane. Using a Markov chain Monte Carlo sampling method, we obtain the distributions also in their far tails, down to…

We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…