Related papers: Crossing estimates for the Ising model on general …
We establish a transversality theorem for multiple-point crossings under generic linear perturbations with explicit Hausdorff measure estimates for the exceptional parameter set, and hence explicit upper bounds on its Hausdorff dimension.…
We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…
This paper is a self-contained presentation of certain aspects of the theory of weighted Sobolev spaces and elliptic operators on non-compact Riemannian manifolds. Specifically, we discuss (i) the standard and weighted Sobolev Embedding…
This note establishes a theoretical framework for finding (potentially overparameterized) approximations of a function on a compact set with a-priori bounds for the generalization error. The approximation method considered is to choose,…
We investigate thermodynamic phase transitions of the joint presence of spin glass (SG) and random field (RF) using a random graph model that allows us to deal with the quenched disorder. Therefore, the connectivity becomes a controllable…
Recent years have seen an increasing amount of research devoted to the development of so-called resonance-based methods for dispersive nonlinear partial differential equations. In many situations, this new class of methods allows for…
We investigate certain large deviation asymptotics concerning random interlacements in Z^d, d bigger or equal to 3. We find the principal exponential rate of decay for the probability that the average value of some suitable non-decreasing…
For a very general class of probability distributions in disordered Ising spin systems, in the thermodynamical limit, we prove the following property for overlaps among real replicas. Consider the overlaps among s replicas. Add one replica…
We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…
We prove that intersections and unions of independent random sets in finite spaces achieve a form of Lipschitz continuity. More precisely, given the distribution of a random set $\Xi$, the function mapping any random set distribution to the…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
We prove a probabilistic level-spacing estimate at the bottom of the spectrum for continuum alloy-type random Schr\"odinger operators, assuming sign-definiteness of a single-site bump function and absolutely continuous randomness. More…
We compute the $S$-matrix of the Tricritical Ising Model perturbed by the subleading magnetic operator using Smirnov's RSOS reduction of the Izergin-Korepin model. The massive model contains kink excitations which interpolate between two…
In a series of works published in the 1990-s, Kerov put forth various applications of the circle of ideas centred at the Markov moment problem to the limiting shape of random continual diagrams arising in representation theory and spectral…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
We consider the problem of estimating Ising models over $n$ variables in Total Variation (TV) distance, given $l$ independent samples from the model. While the statistical complexity of the problem is well-understood [DMR20], identifying…
We estimate the linear isoperimetric constants of an n-dimensional ellipse. Using these estimates and a technique of Gromov, we estimate the Hopf and linking invariants of Lipschitz maps from ellipses to round spheres. Using these…
The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…
This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and…
We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…