相关论文: Markov Random Fields, Markov Cocycles and The 3-co…

We use a non-Markovian coupling and small modifications of techniques from the theory of finite Markov chains to analyze some Markov chains on continuous state spaces. The first is a Gibbs sampler on narrow contingency tables, the second a…

We extend the theory of circular game chromatic numbers to signed graphs by defining the invariant $\chi_c^g(G,\sigma)$ for signed graphs $(G,\sigma)$. Our analysis establishes tight bounds dependent on the structural properties of the…

We construct an infinite family of homology theories of framed links in thickened surfaces, as well as a homology theory whose graded Euler characteristic is exactly the Kauffman bracket of the link in the surface. Both theories are based…

It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…

A long-standing conjecture of Berge suggests that every bridgeless cubic graph can be expressed as a union of at most five perfect matchings. This conjecture trivially holds for $3$-edge-colourable cubic graphs, but remains widely open for…

A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…

We exhibit two three-parameter families of locally conformal symplectic forms on the solvmanifold $M_{n,k}$ considered in [1], and show, using the Hodge-de Rham theory for the Lichnerowicz cohomology that that they are not $d_{\omega}$…

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…

We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…

We give a comprehensive self-contained review on the rigorous analysis of the thermodynamics of a class of random spin systems of mean field type whose most prominent example is the Hopfield model. We focus on the low temperature phase and…

In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $c$ such that there exists a…

We introduce a new algebraic structure called \textit{local biquandles} and show how colorings of oriented classical link diagrams and of broken surface diagrams are related to tribracket colorings. We define a (co)homology theory for local…

A general expansion scheme based on the concept of linked cluster expansion from the theory of classical spin systems is constructed for models of interacting electrons. It is shown that with a suitable variational formulation of mean-field…

In this paper, we show that the methods of mathematical statistical physics can be successfully applied to random fields in finite volumes. As a result, we obtain simple necessary and sufficient conditions for the existence and uniqueness…

A graph $H$ is common if its Ramsey multiplicity, i.e., the minimum number of monochromatic copies of $H$ contained in any $2$-edge-coloring of $K_n$, is asymptotically the same as the number of monochromatic copies in the random…

We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…

Coboundary expansion (with $\mathbb{F}_2$ coefficients), and variations on it, have been the focus of intensive research in the last two decades. It was used to study random complexes, property testing, and above all Gromov's topological…

Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear…

With a sequence of regressions, one may generate joint probability distributions. One starts with a joint, marginal distribution of context variables having possibly a concentration graph structure and continues with an ordered sequence of…

A new object of the probability theory, two-sided chain of events (symbols), is introduced. A theory of multi-steps Markov chains with long-range memory, proposed earlier in Phys. Rev. E 68, 06117 (2003), is developed and used to establish…