Related papers: Carries, shuffling, and symmetric functions
This paper models games where the strategies are nodes of a graph G (we denote them as G-games) and in presence of coalition structures. The cases of one-shot and repeated games are presented. In the latter situation, coalitions are assumed…
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…
The recently established spectral Favard theorem for bounded banded matrices admitting a positive bidiagonal factorization is applied to a broader class of Markov chains with bounded banded transition matrices, extending beyond the…
There are many Markov chains on infinite dimensional spaces whose one-step transition kernels are mutually singular when starting from different initial conditions. We give results which prove unique ergodicity under minimal assumptions on…
A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
The upper extremes of a Markov chain with regulary varying stationary marginal distribution are known to exhibit under general conditions a multiplicative random walk structure called the tail chain. More generally, if the Markov chain is…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
In this paper, we present a result similar to the shift-coupling result of Thorisson (1996) in the context of random graphs and networks. The result is that a given random rooted network can be obtained by changing the root of another given…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name…
We provide an explicit description of the recurrent configurations of the sandpile model on a family of graphs $\widehat{G}_{\mu,\nu}$, which we call clique-independent graphs, indexed by two compositions $\mu$ and $\nu$. Moreover, we…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
For a Markov chain both the detailed balance condition and the cycle Kolmogorov condition are algebraic binomials. This remark suggests to study reversible Markov chains with the tool of Algebraic Statistics, such as toric statistical…
We consider a multidimensional Markov Chain $X$ converging to a multidimensional Brownian Motion. We construct a positive harmonic function for $X$ killed on exiting the cone. We show that its asymptotic behavior is similar to that of to…
Markov chains arising from random iteration of functions $S_{\theta}:X\to X$, $\theta \in \Theta$, where $X$ is a Polish space and $\Theta$ is arbitrary set of indices are considerd. At $x\in X$, $\theta$ is sampled from distribution…
We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…
We extend the general stochastic matching model on graphs introduced in (Mairesse and Moyal, 2016), to matching models on multigraphs, that is, graphs with self-loops. The evolution of the model can be described by a discrete time Markov…
At high levels, the asymptotic distribution of a stationary, regularly varying Markov chain is conveniently given by its tail process. The latter takes the form of a geometric random walk, the increment distribution depending on the sign of…
It has been well known for some time that for strictly stationary Markov chains that are ``reversible'', that special symmetry provides special extra features in the mathematical theory. This paper here is primarily a purely expository…