Related papers: An insertion algorithm over staircase tableaux com…
Estimating probabilistic deformable template models is a new approach in the fields of computer vision and probabilistic atlases in computational anatomy. A first coherent statistical framework modelling the variability as a hidden random…
Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes of logical variables. We found that the current state-of-the-art algorithm to construct…
We describe some recently discovered connections between one-dimensional interacting particle models and Macdonald polynomials. The first such model is the multispecies asymmetric simple exclusion process (ASEP) on a ring, linked to the…
The Asymmetric Simple Inclusion Process (ASIP), a lattice-gas model of unidirectional transport and aggregation, was recently proposed as an `inclusion' counterpart of the Asymmetric Simple Exclusion Process (ASEP). In this paper we present…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
We study the steady state of the two-species Asymmetric Simple Exclusion Process (ASEP) with open boundary conditions. The matrix product method works for the determination of the stationary probability distribution. Several physical…
Matrix completion tackles the task of predicting missing values in a low-rank matrix based on a sparse set of observed entries. It is often assumed that the observation pattern is generated uniformly at random or has a very specific…
Ensembles of random stochastic and bistochastic matrices are investigated. While all columns of a random stochastic matrix can be chosen independently, the rows and columns of a bistochastic matrix have to be correlated. We evaluate the…
We introduce a q-weighted version of the Robinson-Schensted (column insertion) algorithm which is closely connected to q-Whittaker functions (or Macdonald polynomials with t=0) and reduces to the usual Robinson-Schensted algorithm when q=0.…
We derive a new adaptive leverage score sampling strategy for solving the Column Subset Selection Problem (CSSP). The resulting algorithm, called Adaptive Randomized Pivoting, can be viewed as a randomization of Osinsky's recently proposed…
In the asymmetric simple exclusion process on the integers each particle waits exponential time, then with probability p it moves one step to the right if the site is unoccupied, otherwise it stays put; and with probability q=1-p it moves…
We derive, using the algebraic Bethe Ansatz, a generalized Matrix Product Ansatz for the asymmetric exclusion process (ASEP) on a one-dimensional periodic lattice. In this Matrix Product Ansatz, the components of the eigenvectors of the…
The Type D asymmetric simple exclusion process (ASEP) is a particle system involving two classes of particles that can be viewed from both a probabilistic and an algebraic perspective (arXiv:2011.13473). From a probabilistic perspective, we…
This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary…
In this article we give a combinatorial formula for a certain class of Koornwinder polynomials, also known as Macdonald polynomials of type $\tilde{C}$. In particular, we give a combinatorial formula for the Koornwinder polynomials…
In this paper, a well-conditioned collocation method is constructed for solving general $p$-th order linear differential equations with various types of boundary conditions. Based on a suitable Birkhoff interpolation, we obtain a new set of…
We identify the algorithm for constructing steady states of the $n$-species totally asymmetric simple exclusion process (TASEP) on $L$ site periodic chain by Ferrari and Martin with a composition of combinatorial $R$ for the quantum affine…