Related papers: Markov Random Fields, Markov Cocycles and The 3-co…
Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space an ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of the…
Discrete-time discrete-state random Markov chains with a tridiagonal generator are shown to have a random attractor consisting of singleton subsets, essentially a random path, in the simplex of probability vectors. The proof uses the…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…
We investigate the entire family of multi-center point interaction Hamiltonians. We show that a large sub-family of these operators do not become either singular or trivial when the positions of two or more scattering centers tend to…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…
The dimension of the Hilbert space of QFT scales exponentially with the volume of the space in which the theory lives, yet in supersymmetric theories, one can define a graded dimension (such as the supersymmetric index) that counts just the…
In probability theory, equalities are much less than inequalities. In this paper, we find a series of equalities which characterize the symmetry of the forming times of a family of similar cycles for discrete-time and continuous-time Markov…
Recently, examples of an index theory for KMS states of circle actions were discovered, \cite{CPR2,CRT}. We show that these examples are not isolated. Rather there is a general framework in which we use KMS states for circle actions on a…
A mixing Markov chain is proved to be realized as a random walk in a directed graph subject to a synchronizing road coloring. The result ensures existence of appropriate random mappings in Propp--Wilson's coupling from the past. The proof…
We introduce generalized quantum Markov states and generalized d-Markov chains which extend the notion quantum Markov chains on spin systems to that on $C^*$-algebras defined by general graphs. As examples of generalized d-Markov chains, we…
The stacking problem is approached by computational mechanics, using an Ising next nearest neighbor model. Computational mechanics allows to treat the stacking arrangement as an information processing system in the light of a symbol…
It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…
A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. Marigliano and Davies conjectured that every linear binomial that appears in…
One of the predictions of the AdS/CFT correspondence is the matching of protected operators between a superconformal field theory and its holographic dual. We review the spectrum of protected operators in quiver gauge theories that flow to…
Takens constructed a residual subset of the state space consisting of initial points with historic behaviour for expanding maps on the circle. We prove that this statistical property of expanding maps on the circle is preserved under small…
The Markov property entails the conditional independence structure inherent in Gibbs distributions for general classical Hamiltonians, a feature that plays a crucial role in inference, mixing time analysis, and algorithm design. However,…
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 define nearest-neighbour point processes on graphs with Euclidean edges and linear networks. They can be seen as the analogues of renewal processes on the real line. We show that the Delaunay neighbourhood relation on a tree satisfies…
New theoretical results are presented here on the recently introduced model called mixed states MRF. Such models were introduced in the context of image motion analysis and are useful to represent information which can take both discrete…
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamical systems. In this paper, we…