Related papers: Computer Validation of Open Gaps for the Almost Ma…
We investigate the critical behavior of continuous phase transitions in the context of Ginzburg Landau models with a double well effective potential. In particular, we show that the recently proposed configurational entropy, a measure of…
Let $\Omega$ be a smooth bounded simply connected domain in $\mathbb{R}^2$. We investigate the existence of critical points of the energy $E_\varepsilon (u)=1/2\int_\Omega |\nabla u|^2+1/(4\varepsilon^2)\int_\Omega (1-|u|^2)^2$, where the…
We give a new method for analysing the mixing time of a Markov chain using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes…
Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…
A basic problem in operator theory is to estimate how a small perturbation effects the eigenspaces of a self-adjoint compact operator. In this paper, we prove upper bounds for the subspace distance, taylored for structured random…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
We give a new, short computation of pairing probabilities for multiple chordal interfaces in the critical Ising model, the harmonic explorer, and for multiple level lines of the Gaussian free field. The core of the argument are the known…
Bifurcations in a system of coupled maps are investigated. Using symbolic dynamics it is proven that for coupled shift maps the well known space--time--mixing attractor becomes unstable at a critical coupling strength in favour of a…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
A semiclassical diagrammatic approach is constructed for calculating correlation functions of observables in open chaotic systems with time reversal symmetry. The results are expressed in terms of classical correlation functions involving…
In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…
The theoretical models providing mathematical abstractions for several significant optimization problems in machine learning, combinatorial optimization, computer vision and statistical physics have intrinsic similarities. We propose a…
In this work we initiate a positive semi-definite numerical bootstrap program for multi-point correlators. Considering six-point functions of operators on a line we reformulate the crossing symmetry equation for a pair of comb-channel…
In this paper, we study the problem of testing whether or not a given probability measure $\mu$ on $\mathbb{R}^{d}$ can be decomposed as a mixture of two probability measures whose second order statistics are significantly different. We…
The tractability of certain CSPs for dense or sparse instances is known from the 90s. Recently, the densification and the sparsification of CSPs were formulated as computational tasks and the systematical study of their computational…
The well-known quote from George Box states that: "All models are wrong, but some are useful." To develop more useful models, we quantify the inaccuracy with which a given model represents a system of interest, so that we may leverage this…
We discuss the feasibility of applying Diagrammatic Monte-Carlo algorithms to the weak-coupling expansions of asymptotically free quantum field theories, taking the large-$N$ limit of the $O(N)$ sigma-model as the simplest example where…
Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes (QBDs) with…
The spectrum of the self-adjoint Schr\"odinger operator associated with the Kronig-Penney model on the half-line has a band-gap structure: its absolutely continuous spectrum consists of intervals (bands) separated by gaps. We show that if…
We provide a method for estimating spectral gaps in low-dimensional systems. Unlike traditional phase estimation, our approach does not require ancillary qubits nor does it require well characterised gates. Instead, it only requires the…