Related papers: Saturation of Markov Polynomials
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…
In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…
We study in this article the stochastic Zakharov-Kuznetsov equation driven by a multiplicative noise. We establish, in space dimensions two and three the global existence of martingale solutions, and in space dimension two the global…
We study the optimization of the expected long-term reward in finite partially observable Markov decision processes over the set of stationary stochastic policies. In the case of deterministic observations, also known as state aggregation,…
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
In this paper we investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model very large networks. We show that under some conditions, a sequence of Markov chains…
The decimal expansion real numbers, familiar to us all, has a dramatic generalization to representation of dynamical system orbits by symbolic sequences. The natural way to associate a symbolic sequence with an orbit is to track its history…
In this work, we characterise the statistics of Markov chains by constructing an associated sequence of periodic differential operators. Studying the density of states of these operators reveals the absolutely continuous invariant measure…
We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
This is a survey of old and new problems and results in additive number theory.
Kerov's polynomials give irreducible character values in term of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method,…
We revisit the classical problem of approximating a stochastic differential equation by a discrete-time and discrete-space Markov chain. Our construction iterates Caratheodory's theorem over time to match the moments of the increments…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
In this paper, we exhibit an irreducible Markov chain $M$ on the edge $k$-colorings of bipartite graphs based on certain properties of the solution space. We show that diameter of this Markov chain grows linearly with the number of edges in…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…