Related papers: Virasoro action on Schur function expansions, skew…
Sufficient conditions for comparing the convolutions of heterogeneous gamma random variables in terms of the usual stochastic order are established. Such comparisons are characterized by the Schur convexity properties of the cumulative…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
Consider non-homogeneous zero-drift random walks in $\mathbb{R}^d$, $d \geq 2$, with the asymptotic increment covariance matrix $\sigma^2 (\mathbf{u})$ satisfying $\mathbf{u}^\top \sigma^2 (\mathbf{u}) \mathbf{u} = U$ and $\mathrm{tr}\…
We study the asymptotics of Schur polynomials with partitions $\lambda$ which are almost staircase; more precisely, partitions that differ from $((m-1)(N-1),(m-1)(N-2),\ldots,(m-1),0)$ by at most one component at the beginning as…
Lam and Pylyavskyy introduced loop symmetric functions as a generalization of symmetric functions. They defined loop Schur functions as generating functions over semistandard tableaux with respect to a `colored weight,' and they proved a…
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…
A random matrix model definition of a family of ${\cal N}{=}1$ supersymmetric extensions of the Virasoro minimal string of Collier, Eberhardt, M\"{u}hlmann, and Rodriguez is presented. An analysis of the defining string equations shows that…
Khrushchev's formula is the cornerstone of the so called Khrushchev theory, a body of results which has revolutionized the theory of orthogonal polynomials on the unit circle. This formula can be understood as a factorization of the Schur…
In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…
For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…
In this paper we construct uniformly expanding random walks on smooth manifolds. In higher dimensions, our definition of uniform expansion measures the growth of subspaces rather than single vectors. Potrie showed that given any open set…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
In this paper, following the recent paper on Walk/Zeta Correspondence by the first author and his coworkers, we compute the zeta function for the three- and four-state quantum walk and correlated random walk, and the multi-state random walk…
We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type $L^{\frac{\alpha}{2}}$ where $L$ indicates a `simple' Laplacian matrix. We refer such walks to as `Fractional Random Walks' with…
In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…
A one-dimensional system of nonintersecting Brownian particles is constructed as the diffusion scaling limit of Fisher's vicious random walk model. $N$ Brownian particles start from the origin at time $t=0$ and undergo mutually avoiding…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
In enumerative geometry, Virasoro constraints were first conjectured in Gromov-Witten theory with many new recent developments in the sheaf theoretic context. In this paper, we rephrase the sheaf-theoretic Virasoro constraints in terms of…
We establish analogues of the geometric Pitman $2M-X$ theorem of Matsumoto and Yor and of the classical Dufresne identity, for a multiplicative random walk on positive definite matrices with Beta type II distributed increments. The Dufresne…