相关论文: Matching with shift for one-dimensional Gibbs meas…
The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the…
We prove the existence of a successful coupling for $n$ particles in the symmetric inclusion process. As a consequence we characterize the ergodic measures with finite moments, and obtain sufficient conditions for a measure to converge in…
Determining the mixing time of Kac's random walk on the sphere $\mathrm{S}^{n-1}$ is a long-standing open problem. We show that the total variation mixing time of Kac's walk on $\mathrm{S}^{n-1}$ is between $\frac{1}{2} \, n \log(n)$ and…
Estimating the size of the maximum matching is a canonical problem in graph algorithms, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating…
We consider the shift transformation on the space of infinite sequences over a finite alphabet endowed with the invariant product measure, and examine the presence of a \emph{hole} on the space. The holes we study are specified by the…
We consider models of Bayesian inference of signals with vectorial components of finite dimensionality. We show that, under a proper perturbation, these models are replica symmetric in the sense that the overlap matrix concentrates. The…
It is well known that the Gibbs inequality, which says that the Gibbs ratio is bounded above and below by positive constants, holds for the unique equilibrium states of H\"older continuous potentials on shift spaces, but it can fail for…
In [8] we found a class of overlapping asymmetric self-similar measures on the real line, which are generically absolutely continuous with respect to the Lebesgue measure. Here we construct exceptional measures in this class being singular.
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two new graph parameters that measure how far a graph is from…
An ideal system of $n$ qubits has $2^n$ dimensions. This exponential grants power, but also hinders characterizing the system's state and dynamics. We study a new problem: the qubits in a physical system might not be independent. They can…
Gibbs samplers are preeminent Markov chain Monte Carlo algorithms used in computational physics and statistical computing. Yet, their most fundamental properties, such as relations between convergence characteristics of their various…
Alspach [ Bull. Inst. Combin. Appl., 52 (2008), pp. 7-20] defined the maximal matching sequencibility of a graph $G$, denoted $ms(G)$, to be the largest integer $s$ for which there is an ordering of the edges of $G$ such that every $s$…
Let $\Sigma_{A}$ be a topologically mixing shift of finite type, let $\sigma:\Sigma_{A}\to\Sigma_{A}$ be the usual left-shift, and let $\mu$ be the Gibbs measure for a H\"{o}lder continuous potential that is not cohomologous to a constant.…
We consider infinite-dimensional diffusions where the interaction between the coordinates has a finite extent both in space and time. In particular, it is not supposed to be smooth or Markov. The initial state of the system is Gibbs, given…
In this paper we present a new approach to studying g-measures which is based upon local absolute continuity. We extend the result in [11] that square summability of variations of g-functions ensures uniqueness of g-measures. The first…
Graph matching is the process of computing the similarity between two graphs. Depending on the requirement, it can be exact or inexact. Exact graph matching requires a strict correspondence between nodes of two graphs, whereas inexact…
We exhibit Lipschitz (and hence H\"older) potentials on the full shift $\{0,1\}^{\mathbb{N}}$ such that the associated Gibbs measures fail to converge as the temperature goes to zero. Thus there are "exponentially decaying" interactions on…
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or…
We study a stationary Gibbs particle process with deterministically bounded particles on Euclidean space defined in terms of an activity parameter and non-negative interaction potentials of finite range. Using disagreement percolation we…