Related papers: Improved Strong Spatial Mixing for Colorings on Tr…
Natural image statistics exhibit hierarchical dependencies across multiple scales. Representing such prior knowledge in non-factorial latent tree models can boost performance of image denoising, inpainting, deconvolution or reconstruction…
We report the results of a global analysis of dark matter simplified models (DMSMs) with leptophobic mediator particles of spin one, considering the cases of both vector and axial-vector interactions with dark matter (DM) particles and…
Random forest regression is a powerful non-parametric method that adapts to local data characteristics through data-driven partitioning, making it effective across diverse application domains. However, the piecewise constant nature of…
We present a tree-tensor-network-based method to study strongly correlated systems with nonlocal interactions in higher dimensions. Although the momentum-space and quantum-chemistry versions of the density matrix renormalization group…
Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there…
Studies in environmental and epidemiological sciences are often spatially varying and observational in nature with the aim of establishing cause and effect relationships. One of the major challenges with such studies is the presence of…
We introduce decorated sweep covers as a colouring on maximal antichains in tree posets such that if two elements have the same colour they are siblings. DSCs appear in applications wherever maximal antichains require structural…
We introduce harmonization, an ensembling method that combines several "noisy" decoders to generate highly accurate decoding predictions. Harmonized ensembles of MWPM-based decoders achieve lower logical error rates than their individual…
The Minimum Sum Coloring Problem (MSCP) is derived from the Graph Coloring Problem (GCP) by associating a weight to each color. The aim of MSCP is to find a coloring solution of a graph such that the sum of color weights is minimum. MSCP…
We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin system on a potentially infinite graph $G$. The sampling algorithm assumes strong spatial mixing together with subexponential growth…
We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the Online Preemptive and the Incremental Dynamic Graph models. In the {\em Online…
When relating the strong coupling $\alpha_s$, measured at the scale of the $Z$ boson mass, to its numerical value at some higher energy, for example the scale of Grand Unification, it is important to include higher order corrections both in…
Differential spatial modulation (DSM) was recently proposed to overcome the challenge of channel estimation in spatial modulation (SM). In this letter, we propose a gray code order of antenna index permutations for DSM. To facilitate the…
In a fertile patch of the string landscape which includes the Minimal Supersymmetric Standard Model (MSSM) as the low energy effective theory, rather general arguments from Douglas suggest a power-law statistical selection of soft breaking…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…
This paper presents a computational framework for the Wasserstein auto-encoding of merge trees (MT-WAE), a novel extension of the classical auto-encoder neural network architecture to the Wasserstein metric space of merge trees. In contrast…
We study Stanley's chromatic symmetric function (CSF) for trees when expressed in the star basis. We use the deletion-near-contraction (DNC) algorithm to compute coefficients that occur in the CSF in the star basis. In particular, one of…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
A brief overview of some of the last decade's developments in the Top-mode/Topcolor class of models is presented. In addition, a new Topcolor type scenario, named Top-Bottom Color, is suggested. A seesaw mechanism with new weak doublet…