Related papers: Rapid mixing from spectral independence beyond the…
For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…
TThe prototypical problem we study here is the following. Given a $2L\times 2L$ square, there are approximately $\exp(4KL^2/\pi )$ ways to tile it with dominos, i.e. with horizontal or vertical $2\times 1$ rectangles, where $K\approx 0.916$…
Inferring dependence structure through undirected graphs is crucial for uncovering the major modes of multivariate interaction among high-dimensional genomic markers that are potentially associated with cancer. Traditionally, conditional…
This work represents a natural coalescence of two important lines of work: learning mixtures of Gaussians and algorithmic robust statistics. In particular we give the first provably robust algorithm for learning mixtures of any constant…
The independence number $\alpha(G)$ and the dissociation number ${\rm diss}(G)$ of a graph $G$ are the largest orders of induced subgraphs of $G$ of maximum degree at most $0$ and at most $1$, respectively. We consider possible improvements…
Feature learning in the presence of a mixed type of variables, numerical and categorical types, is an important issue for related modeling problems. For simple neighborhood queries under mixed data space, standard practice is to consider…
A proper coloring of a graph is \emph{conflict-free} if, for every non-isolated vertex, some color is used exactly once on its neighborhood. Caro, Petru\v{s}evski, and \v{S}krekovski proved that every graph $G$ has a proper conflict-free…
The problem of uniformly sampling hypergraph independent sets is revisited. We design an efficient perfect sampler for the problem under a condition similar to that of the asymmetric Lov\'asz Local Lemma. When applied to $d$-regular…
Let $\Gamma$ be the graph whose vertices are the chambers of the finite projective space $PG(3,q)$ with two vertices being adjacent when the corresponding chambers are in general position. It is known that the independence number of this…
We present three sublinear randomized algorithms for vertex-coloring of graphs with maximum degree $\Delta$. The first is a simple algorithm that extends the idea of Morris and Song to color graphs with maximum degree $\Delta$ using…
By a theorem of Johansson, every triangle-free graph $G$ of maximum degree $\Delta$ has chromatic number at most $(C+o(1))\Delta/\log \Delta$ for some universal constant $C > 0$. Using the entropy compression method, Molloy proved that one…
We consider consistent diffusion dynamics, leaving the celebrated Hua-Pickrell measures, depending on a complex parameter $s$, invariant. These, give rise to Feller-Markov processes on the infinite dimensional boundary $\Omega$ of the…
A seminal palette sparsification result of Assadi, Chen, and Khanna states that in every $n$-vertex graph of maximum degree $\Delta$, sampling $\Theta(\log n)$ colors per vertex from $\{1, \ldots, \Delta+1\}$ almost certainly allows for a…
A system of a quantum harmonic oscillator bi-linearly coupled with a Glauber amplifier is analysed considering a time-dependent Hamiltonian model. The Hilbert space of this system may be exactly subdivided into invariant finite dimensional…
We propose a high-speed and accurate hybrid dynamic density functional theory for the computer simulations of the phase separation processes of polymer melts and blends. The proposed theory is a combination of the dynamic self-consistent…
We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below…
We initiate the study of how to extend the correspondence between dimer models and (0+1)-dimensional cluster integrable systems to (1+1) and (2+1)-dimensional continuous integrable field theories, addressing various points that are…
Highly heterogeneous, anisotropic coefficients, e.g. in the simulation of carbon-fibre composite components, can lead to extremely challenging finite element systems. Direct solvers for the resulting large and sparse linear systems suffer…
Transparent media exhibiting anomalous dispersion have been of considerable interest since Wang, Kuzmich, and Dogariu [Nature {\bf 406}, 277 (2000)] first observed light propagate with superluminal and negative group velocities without…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…