Related papers: Markov bases for two-way subtable sum problems
In this paper, we present a novel approach to determine the stability of switched linear and nonlinear systems using Sum of Squares optimisation. Particularly, we use Sum of Squares optimisation to search for a Lyapunov function that…
For downward skip-free continuous-time Markov chains on non-negative integers stopped at zero, existence of a quasi-stationary distribution is studied. The scale function for these processes is introduced and the boundary is classified by a…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
We consider a two-node queue modeled as a two-dimensional random walk. In particular, we consider the case that one or both queues have finite buffers. We develop an approximation scheme based on the Markov reward approach to error bounds…
This short piece defines a Markov basis. The aim is to introduce the statistical concept to mathematicians.
A binary contingency table is an m x n array of binary entries with prescribed row sums r=(r_1,...,r_m) and column sums c=(c_1,...,c_n). The configuration model for uniformly sampling binary contingency tables proceeds as follows. First,…
We study mutually unbiased bases (MUBs) in which all the bases are unextendible maximally entangled ones. We first present a necessary and sufficient condition of constructing a pair of MUBs in $C^2 \otimes C^4$. Based on this condition, an…
Recently [Karimipour and Memarzadeh, Phys. Rev. A 73, 012329 (2006)] studied the problem of finding a family of orthonormal bases in a bipartite space each of dimension $D$ with the following properties: (i) The family continuously…
We consider Markov basis arising from fractional factorial designs with three-level factors. Once we have a Markov basis, $p$ values for various conditional tests are estimated by the Markov chain Monte Carlo procedure. For designed…
This paper clarifies the main research methods and ideas of the thesis [1,2,4]. The special calculation process is also realized by corresponding computer algorithm. Finally, we introduce zero rows sum case and give the corresponding…
This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…
It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…
In this article we consider zero and non-zero sum risk-sensitive average criterion games for semi-Markov processes with a finite state space. For the zero-sum case, under suitable assumptions we show that the game has a value. We also…
A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved that a cycle base of a permutation group of degree $n$ can be constructed in polynomial time in~$n$.
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
A well known question of Gromov asks whether every one-ended hyperbolic group $\Gamma$ has a surface subgroup. We give a positive answer when $\Gamma$ is the fundamental group of a graph of free groups with cyclic edge groups. As a result,…
Mutually Unbiased Bases (MUBs) are closely connected with quantum physics, and the structure has a rich mathematical background. We provide equivalent criteria for extending a set of MUBs for $C^n$ by studying real points of a certain…
We present and explore a general method for deriving a Lie-Markov model from a finite semigroup. If the degree of the semigroup is $k$, the resulting model is a continuous-time Markov chain on $k$ states and, as a consequence of the product…
Higher order Bernstein- and Markov-type inequalities are established for trigonometric polynomials on compact subsets of the real line and algebraic polynomials on compact subsets of the unit circle. In the case of Markov-type inequalities…