Related papers: The weighted hook length formula

We give alternate proofs of the classical branching rules for highest weight representations of a complex reductive group $G$ restricted to a closed regular reductive subgroup $H$, where $(G,H)$ consist of the pairs $(GL(n+1),GL(n))$, $…

We define the hitting time for a model of continuous-time open quantum walks in terms of quantum jumps. Our starting point is a master equation in Lindblad form, which can be taken as the quantum analogue of the rate equation for a…

We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…

We introduce a set of tools which simplify and streamline the proofs of limit theorems concerning near-critical particles in branching random walks under optimal assumptions. We exemplify our method by giving another proof of the…

Matrices over a finite field having fixed rank and restricted support are a natural $q$-analogue of rook placements on a board. We develop this $q$-rook theory by defining a corresponding analogue of the hit numbers. Using tools from coding…

In the paper, we find exact asymptotics of the left tail of renewal measure for a broad class of two-sided random walks. We only require that an exponential moment of the left tail is finite. Through a simple change of measure approach, our…

A branching random walk algorithm for the many-body Wigner equation and its numerical applications for quantum dynamics in phase space are proposed and analyzed. After introducing an auxiliary function, the (truncated) Wigner equation is…

Continuous-time quantum walks have proven to be an extremely useful framework for the design of several quantum algorithms. Often, the running time of quantum algorithms in this framework is characterized by the quantum hitting time: the…

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…

In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A…

We derive the weak limit theorem for a class of long range type quantum walks. To do it, we analyze spectral properties of a time evolution operator and prove that modified wave operators exist and are complete.

Let $G$ be a finite group. Let $H, K$ be subgroups of $G$ and $H \backslash G / K$ the double coset space. Let $Q$ be a probability on $G$ which is constant on conjugacy classes ($Q(s^{-1} t s) = Q(t)$). The random walk driven by $Q$ on $G$…

We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…

In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…

The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…

We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the…