Related papers: Pattern Avoiding Permutations as Walks

We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

We give tight bounds for the Stanley depth of the quotient ring of the path ideal of a cycle graph. In particular, we prove that it satisfies the Stanley inequality.

We define a new ensemble for self-avoiding walks in the upper half-plane, the fixed irredicible bridge ensemble, by considering self-avoiding walks in the upper half-plane up to their $n$-th bridge height, $Y_n$, and scaling the walk by…

We conjecture a relationship between the scaling limit of the fixed-length ensemble of self-avoiding walks in the upper half plane and radial SLE with kappa=8/3 in this half plane from 0 to i. The relationship is that if we take a curve…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

We consider simple random walk on Z^d, d bigger or equal to 3. Motivated by the work of A.-S. Sznitman and the author in arXiv:1304.7477 and arXiv:1310.2177, we investigate the asymptotic behaviour of the probability that a large body gets…

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

In this paper, we study pattern avoidance for stabilized-interval-free (SIF) permutations. These permutations are contained in the set of indecomposable permutations and in the set of derangements. We enumerate pattern-avoiding SIF…

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by…

We numerically test the correspondence between the scaling limit of self-avoiding walks (SAW) in the plane and Schramm-Loewner evolution (SLE) with k=8/3. We introduce a discrete-time process approximating SLE in the exterior of the unit…

We consider families of non-colliding random walks above a hard wall, which are subject to a self-potential of tilted area type. We view such ensembles as effective models for the level lines of a class of $2+1$-dimensional discrete-height…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

We consider loop-erased random walk (LERW) running between two boundary points of a square grid approximation of a planar simply connected domain. The LERW Green's function is the probability that the LERW passes through a given edge in the…

The parametric maximum likelihood estimation problem is addressed in the context of quantum walk theory for quantum walks on the lattice of integers. A coin action is presented, with the real parameter $\theta$ to be estimated identified…

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…

We enumerate the numbers $Av_n^k(1324)$ of 1324-avoiding $n$-permutations with exactly $k$ inversions for all $k$ and $n \geq (k+7)/2$. The result depends on a structural characterization of such permutations in terms of a new notion of…

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…