Related papers: Rapid mixing from spectral independence beyond the…
We consider the problem of sampling a proper $k$-coloring of a graph of maximal degree $\Delta$ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of bounded treewidth if…
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) =…
We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter…
A celebrated result of Johansson in graph theory states that every triangle-free graph of maximum degree $\Delta$ can be properly colored with $O(\Delta/\ln\Delta)$ colors, improving upon the "greedy bound" of $\Delta+1$ coloring in general…
We characterize the uniqueness condition in the hardcore model for bipartite graphs with degree bounds only on one side, and provide a nearly linear time sampling algorithm that works up to the uniqueness threshold. We show that the…
We develop a renormalisation group approach to deriving the asymptotics of the spectral gap of the generator of Glauber type dynamics of spin systems with strong correlations (at and near a critical point). In our approach, we derive a…
We present a parametrization of density matrices (mixed states) in a finite-dimensional Hilbert space $\mathbb{C}^n$, particularly suited to the description of their time evolution as open quantum systems governed by GKLS dynamics. A…
Gaussian graphical model selection is usually studied under independent sampling, but in many applications observations arise from dependent dynamics. We study structure learning when the data consist of a single trajectory of Gaussian…
A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph $G$ is the maximum density of an independent set in $G$.…
The distributed coloring problem is arguably one of the key problems studied in the area of distributed graph algorithms. The most standard variant of the problem asks for a proper vertex coloring of a graph with $\Delta+1$ colors, where…
In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…
In the Ginzburg-Landau approach, we describe a new phase in neutral two-flavor quark matter in which gluonic degrees of freedom play a crucial role. We call it a gluonic phase. In this phase gluonic dynamics cure a chromomagnetic…
We propose a novel pulsed optical field method that alternately switches the pump beam in conventional saturation absorption to time-division multiplex the same probe beam into both probe and reference beams, followed by digital…
We prove bounds on statistical distances between high-dimensional exchangeable mixture distributions (which we call \emph{permutation mixtures}) and their i.i.d. counterparts. Our results are based on a novel method for controlling $\chi^2$…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
We show that atoms from wide velocity interval can be concurrently involved in Doppler-free two-photon resonant far from frequency degenerate four-wave mixing with the aid of auxiliary electromagnetic field. This gives rise to substantial…
We study mixtures of free, monotone, and Boolean independence described by a directed graph $G = (V,E)$ in the context of $\mathcal{T}$-free convolutions of Jekel and Liu. We prove general limit theorems for the associated additive…
Maximal independent set (MIS), maximal matching (MM), and $(\Delta+1)$-coloring in graphs of maximum degree $\Delta$ are among the most prominent algorithmic graph theory problems. They are all solvable by a simple linear-time greedy…
We consider a sequence of matrices that are associated to Markov dynamical systems and use determinant-free linear algebra techniques (as well as some algebra and complex analysis) to rigorously estimate the eigenvalues of every matrix…
The broad motivation of this work is a rigorous understanding of reversible, local Markov dynamics of interfaces, and in particular their speed of convergence to equilibrium, measured via the mixing time $T_{mix}$. In the…