Related papers: Reverse juggling processes
This paper consists of $3$ parts. The first part only considers classical processes and introduces two different extensions of the notion of hidden Markov process. In the second part, the notion of quantum hidden process is introduced. In…
We show that two tensor permutation matrices permutate tensor product of rectangle matrices. Some examples, in the particular case of tensor commutation matrices, for studying some linear matrix equations are given.
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
Reversible jump Markov chain Monte Carlo (RJMCMC) proposals that achieve reasonable acceptance rates and mixing are notoriously difficult to design in most applications. Inspired by recent advances in deep neural network-based normalizing…
In this paper, we develop an in-depth analysis of non-reversible Markov chains on denumerable state space from a similarity orbit perspective. In particular, we study the class of Markov chains whose transition kernel is in the similarity…
In this paper we develop randomized Krylov subspace methods for efficiently computing regularized solutions to large-scale linear inverse problems. Building on the recently developed randomized Gram-Schmidt process, where sketched inner…
We extend the Markov chain tree theorem to general commutative semirings, and we generalize the state reduction algorithm to commutative semifields. This leads to a new universal algorithm, whose prototype is the state reduction algorithm…
A class of discrete distributions can be derived from stationary renewal processes. They have the useful property that the mean is a simple function of the model parameters. Thus regressions of the distribution mean on covariates can be…
We introduce a novel class of generative models based on piecewise deterministic Markov processes (PDMPs), a family of non-diffusive stochastic processes consisting of deterministic motion and random jumps at random times. Similarly to…
A generalization of the quantum inverse scattering method is proposed replacing the quantum group $RLL$ commutation relations of Lax operators by reflection equation type $RLRL$ commutation relations. Under some natural assumptions the most…
Matrix Dirichlet processes, in reference to their reversible measure, appear in a natural way in many different models in probability. Applying the language of diffusion operators and the method of boundary equations, we describe Dirichlet…
This paper continues the study of Fourier transforms on finite inverse semigroups, with a focus on Fourier inversion theorems and FFTs for new classes of inverse semigroups. We begin by introducing four inverse semigroup generalizations of…
The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the…
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
V.I. Arnold [Russian Math. Surveys, 26 (no. 2), 1971, pp. 29-43] gave a miniversal deformation of matrices of linear operators; that is, a simple canonical form, to which not only a given square matrix A, but also the family of all matrices…
In the past we have considered Gaussian random matrix ensembles in the presence of an external matrix source. The reason was that it allowed, through an appropriate tuning of the eigenvalues of the source, to obtain results on non-trivial…
In this work we define two kinds of crested product for reversible Markov chains, which naturally appear as a generalization of the case of crossed and nested product, as in association schemes theory, even if we do a construction that…
We consider weighted particle systems in which new generations are re-sampled from current particles with probabilities proportional to their weights. This covers a broad class of sequential Monte Carlo methods, widely used in applied…
We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…
We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to two edges between any pair of nodes. We introduce global, and ordered…