Related papers: Phase Transitions via Complex Extensions of Markov…
In this paper, we unify the Markov theory of a variety of different types of graphs used in graphical Markov models by introducing the class of loopless mixed graphs, and show that all independence models induced by $m$-separation on such…
We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…
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.…
Recent progress in understanding the physics of magnetic reconnection is conveniently summarized in terms of a phase diagram which organizes the essential dynamics for a wide variety of applications in heliophysics, laboratory and…
In this paper, we study a biased version of the nearest-neighbor transposition Markov chain on the set of permutations where neighboring elements $i$ and $j$ are placed in order $(i,j)$ with probability $p_{i,j}$. Our goal is to identify…
We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We…
We study the dynamic phase transition properties for the mixed spin-(1/2, 1) Ising model on a square lattice under a time-dependent magnetic field by means the effective-field theory (EFT) based on the Glauber dynamics. We present the…
We use top-down holography to study the thermodynamics of a one-parameter family of three-dimensional, strongly coupled Yang-Mills-Chern-Simons theories with M-theory duals. For generic values of the parameter, the theories exhibit a mass…
Symmetric independence relations are often studied using graphical representations. Ancestral graphs or acyclic directed mixed graphs with $m$-separation provide classes of symmetric graphical independence models that are closed under…
We investigate the phase diagram of disordered copolymers at the interface between two selective solvents, and in particular its weak-coupling behavior, encoded in the slope $m_c$ of the critical line at the origin. In mathematical terms,…
The steady states of three families of one-dimensional non-equilibrium models with open boundaries, first proposed in [22], are studied using a matrix product formalism. It is shown that their associated quadratic algebras have…
The present paper has two goals. First to present a natural example of a new class of random fields which are the variable neighborhood random fields. The example we consider is a partially observed nearest neighbor binary Markov random…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
We investigate the dynamics following sudden quenches across quantum critical points belonging to different universality classes. Specifically, we use matrix product state methods to study the quantum Ising chain in the presence of two…
We consider Markov chains which are polynomially mixing, in a weak sense expressed in terms of the space of functions on which the mixing speed is controlled. In this context, we prove polynomial large and moderate deviations inequalities.…
Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {P_n} be a sequence of transition matrices on a…
We study joint source-channel coding over Markov channels through the empirical coordination framework. More specifically, we aim at determining the empirical distributions of source and channel symbols that can be induced by a coding…
We define auto- and cross-correlation functions capable to capture dynamical characteristics induced by local phase space structures in a general dynamical system. These correlation functions are calculated in the Standard Map for a range…
We consider stochastic optimization problems where data is drawn from a Markov chain. Existing methods for this setting crucially rely on knowing the mixing time of the chain, which in real-world applications is usually unknown. We propose…
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…