Related papers: Improved Strong Spatial Mixing for Colorings on Tr…
In a large class of models for Weakly Interacting Massive Particles (WIMPs), the WIMP mass $M$ lies far above the weak scale $m_W$. This work identifies universal Sudakov-type logarithms $\sim \alpha \log^2 (2\,M/m_W)$ that spoil the naive…
Introduction: Quantitative Susceptibility Mapping (QSM) is generally acquired with full brain coverage, even though many QSM brain-iron studies focus on the deep grey matter (DGM) region only. Reducing the spatial coverage to the DGM…
As an essential prerequisite task in image-based plant phenotyping, leaf segmentation has garnered increasing attention in recent years. While self-supervised learning is emerging as an effective alternative to various computer vision…
Superstring flux compactifications can stabilize all moduli while leading to an enormous number of vacua solutions, each leading to different $4-d$ laws of physics. While the string landscape provides at present the only plausible…
Weak lensing peak counts are a powerful statistical tool for constraining cosmological parameters. So far, this method has been applied only to surveys with relatively small areas, up to several hundred square degrees. As future surveys…
We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a…
Symmetry-based classification of quantum phases of matter is one of the most foundational organizing principles in physics; however, an analogous framework for mixed, decohered quantum states has only begun to emerge. A central new concept…
Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical…
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing-ST). We solve the underlying LP to within a $(1+\epsilon)$…
Spatially Coherent Random Forest (SCRF) extends Random Forest to create spatially coherent labeling. Each split function in SCRF is evaluated based on a traditional information gain measure that is regularized by a spatial coherency term.…
In this paper, we propose a new method to use the strong lensing data sets to constrain a cosmological model. By taking the ratio…
Based on a nonabelian generalization of electric-magnetic duality, the Dualized Standard Model (DSM) suggests a natural explanation for exactly 3 generations of fermions as the `dual colour' $\widetilde{SU}(3)$ symmetry broken in a…
Fine particulate matter, PM$_{2.5}$, has been documented to have adverse health effects and wildland fires are a major contributor to PM$_{2.5}$ air pollution in the US. Forecasters use numerical models to predict PM$_{2.5}$ concentrations…
The commonly accepted notion of a weak unified coupling $\alpha_X \approx 0.04$, based on the assumption of the MSSM--spectrum, is questioned. It is suggested that the four--dimensional unified string coupling should very likely have an…
A spectral mixture (SM) kernel is a flexible kernel used to model any stationary covariance function. Although it is useful in modeling data, the learning of the SM kernel is generally difficult because optimizing a large number of…
We present quantitative investigations of the weak lensing effect on the two-point correlation functions of local maxima (hotspots), $\xipk(\theta)$, in the cosmic microwave background (CMB) maps. The lensing effect depends on the projected…
Image restoration requires simultaneously preserving fine-grained local structures and maintaining long-range spatial coherence. While convolutional networks struggle with limited receptive fields, and Transformers incur quadratic…
We use the recently proposed generalised on-shell representation for scattering amplitudes and a consistency test to explore the space of tree-level consistent couplings in four-dimensional Minkowski spacetime. The extension of the…
We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$-colorings of a path on $n$ vertices (in statistical physics terms, the one-dimensional…
Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which are trivially two-colorable, it is impossible to achieve…