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

This paper features a Cram\'er's theorem for finite-state Markov chains indexed by rooted $d$-trees, obtained via the method of types in the classical analysis of large deviations. Along with the theorem comes two applications: an…

This paper is our first step in establishing a de Rham model for equivariant twisted $K$-theory using machinery from noncommutative geometry. Let $G$ be a compact Lie group, $M$ a compact manifold on which $G$ acts smoothly. For any $\alpha…

The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore,…

We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,n}$ with $2n/3 + o(n)$ colors such that each $4$-cycle…

We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to two edges between any pair of nodes. We introduce global, and ordered…

As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs made reference to…

Understanding and predicting how complex systems respond to external perturbations is a central challenge in nonequilibrium statistical physics. Here we consider continuous-time Markov networks, which we subject to perturbations along a…

In this paper we develop the theory of {\it polymorphisms} of measure spaces, which is a generalization of the theory of measure-preserving transformations; we describe the main notions and discuss relations to the theory of Markov…

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

We use strong sub-additivity of entanglement entropy, Lorentz invariance, and the Markov property of the vacuum state of a conformal field theory to give a new proof of the irreversibility of the renormalization group in d=4 space-time…

Let $H$ be an edge colored hypergraph. We say that $H$ contains a \emph{rainbow} copy of a hypergraph $S$ if it contains an isomorphic copy of $S$ with all edges of distinct colors. We consider the following setting. A randomly edge colored…

Markov's equation x^2 + y^2 + z^2 = 3xyz is a widely studied topic in number theory, and the structure of its solutions has profound connections with mathematical fields such as combinatorics, hyperbolic geometry, approximation theory, and…

Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…

We show that the vanishing of certain cohomology groups of polyhedral complexes imply upper bounds on Ramsey numbers. Lovasz bounded the chromatic numbers of graphs using Hom complexes. Babson and Kozlov proved Lovasz conjecture and…

In this paper, we propose a class of quantum Markov fields QMF on a graphs $G= (V,E)$. The Markov structure of the considered QMF is investigated in the finer structure of a quasi-local algebrav $\mathcal{A}_V$ of observables based over a…

In this work, we prove three types of results with the strategy that, together, the author believes these should imply the local version of Hilbert's Fifth problem. In a separate development, we construct a nontrivial topology for rings of…

We study random walks on contingency tables with fixed marginals, corresponding to a (log-linear) hierarchical model. If the set of allowed moves is not a Markov basis, then there exist tables with the same marginals that are not connected.…

We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…

Continuous-time discrete-state random Markov chains generated by a random linear differential equation with a random tridiagonal matrix are shown to have a random attractor consisting of singleton subsets, essentially a random path, in the…