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

We discuss 2-cocycles of the Lie algebra $\Map(M^3;\g)$ of smooth, compactly supported maps on 3-dimensional manifolds $M^3$ with values in a compact, semi-simple Lie algebra $\g$. We show by explicit calculation that the…

This paper considers space homogenous Boltzmann kinetic equations in dimension $d$ with Maxwell collisions (and without Grad's cut-off). An explicit Markov coupling of the associated conservative (Nanbu) stochastic $N$-particle system is…

In this paper we study acyclic colouring in the random subgraph $\mathit{G}$ of the complete graph $\mathit{K}_n$ on $\mathit{n}$ vertices where each edge is present with probability $\mathit{p}$; independent of the other edges. We show…

We prove that, up to homeomorphism, any graph subject to natural necessary conditions on orientation and the cycle rank can be realized as the Reeb graph of a Morse function on a given closed manifold $M$. Along the way, we show that the…

The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for $2\leq k\in \mathbb{N}$, any colouring of the edges of $K_n$ with $n$ sufficiently large gives a copy of $C_{2k}$ which has one of three canonical colour…

The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer $h$, the proper $h$-conflict-free chromatic number of a graph $G$, denoted $\chi_{pcf}^h(G)$, is the minimum $k$ such that $G$…

For piecewise expanding one-dimensional maps without periodic turning points we prove that isolated eigenvalues of small (random) perturbations of these maps are close to isolated eigenvalues of the unperturbed system. (Here ``eigenvalue''…

We establish quantitative bounds for rates of convergence and asymptotic variances for iterated conditional sequential Monte Carlo (i-cSMC) Markov chains and associated particle Gibbs samplers. Our main findings are that the essential…

We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…

Markov categories are a recent categorical approach to the mathematical foundations of probability and statistics. Here, this approach is advanced by stating and proving equivalent conditions for second-order stochastic dominance, a widely…

We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test…

For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings,…

Let (k1,k2,k3,k4) be a quartet of cyclic cubic number fields sharing a common conductor c=pqr divisible by exactly three prime(power)s p,q,r. For those components k of the quartet whose 3-class group Cl(3,k) = Z/3Z x Z/3Z is elementary…

In this paper, we consider mutations of skew-symmetrizable matrices of rank 3. Every skew-symmetrizable matrix corresponds to a weighted quiver, and we study the conditions when this quiver is always cyclic after applying mutations. In this…

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

We consider the irreducibility of switch-based Markov chains for the approximate uniform sampling of Hamiltonian cycles in a given undirected dense graph on $n$ vertices. As our main result, we show that every pair of Hamiltonian cycles in…

We study Khovanov homology classes which have state cycle representatives, and examine how they interact with Jacobsson homomorphisms and Lee's map $\Phi$. As an application, we describe a general procedure, quasipositive modification, for…

Markov chain Monte Carlo (MCMC) algorithms are simple and extremely powerful techniques to sample from almost arbitrary distributions. The flaw in practice is that it can take a large and/or unknown amount of time to converge to the…

We generalize Iskovskih's theorem about surfaces without irregularity and bigenus from the smooth case to regular surfaces over arbitrary fields, with special focus on the case of imperfect fields. This includes surfaces that are…

We consider the continuous-time presentation of the strand symmetric phylogenetic substitution model (in which rate parameters are unchanged under nucleotide permutations given by Watson-Crick base conjugation). Algebraic analysis of the…