English
Related papers

Related papers: Replica Bounds by Combinatorial Interpolation for …

200 papers

Given disjoint subsets $T_1,\ldots,T_m$ of "not too large" primes up to $x$, we establish that for a random integer $n$ drawn from $[1,x]$, the $m$-dimensional vector enumerating the number of prime factors of $n$ from $T_1,\ldots,T_m$…

Number Theory · Mathematics 2022-07-05 Kevin Ford

We present a simple strategy in order to show the existence and uniqueness of the infinite volume limit of thermodynamic quantities, for a large class of mean field disordered models, as for example the Sherrington-Kirkpatrick model, and…

Disordered Systems and Neural Networks · Physics 2009-11-07 Francesco Guerra , Fabio L. Toninelli

Inspired by R. Speicher's multidimensional free central limit theorem and semicircle families, we prove an infinite dimensional compound Poisson limit theorem in free probability, and define infinite dimensional compound free Poisson…

Operator Algebras · Mathematics 2017-12-19 Guimei An , Mingchu Gao

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…

Data Structures and Algorithms · Computer Science 2023-01-26 Ewan Davies , Will Perkins

We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…

Combinatorics · Mathematics 2022-01-04 Jaehoon Kim , Hong Liu , Tuan Tran

This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a…

Probability · Mathematics 2024-02-13 Partha S. Dey , Grigory Terlov

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

Probability · Mathematics 2016-07-06 Richard Arratia , Stephen DeSalvo

We show that the free energy in the mixed $p$-spin models of spin glasses does not superconcentrate in the presence of external field, which means that its variance is of the order suggested by the Poincar\'e inequality. This complements…

Probability · Mathematics 2017-06-09 Wei-Kuo Chen , Partha Dey , Dmitry Panchenko

20 years ago, Bovier, Kurkova, and L\"owe [5] proved a central limit theorem (CLT) for the fluctuations of the free energy in the p-spin version of the Sherrington-Kirkpatrick model of spin glasses at high temperatures. In this paper we…

Probability · Mathematics 2022-05-31 Anton Bovier , Adrien Schertzer

We consider a parabolic sine-Gordon model with periodic boundary conditions. We prove a fundamental maximum principle which gives a priori uniform control of the solution. In the one-dimensional case we classify all bounded steady states…

Analysis of PDEs · Mathematics 2021-06-15 Xinyu Cheng , Dong Li , Chaoyu Quan , Wen Yang

We consider the fluctuations of the free energy in generalized Sherrington-Kirkpatrick models and the log likelihood ratio of spiked Wigner models in the high temperature/subcritical regime. We prove that the limiting laws of the…

Probability · Mathematics 2026-05-25 Hyunsuk Choo , Yoochan Han , Ji Oon Lee

This paper is concerned with the distributed control and stabilization problems for linear discrete-time large scale systems with imposed constraints. The main contributions of this paper are: Firstly, by using the maximum principle…

Optimization and Control · Mathematics 2018-01-03 Qingyuan Qi , Huanshui Zhang , Peijun Ju

We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…

Disordered Systems and Neural Networks · Physics 2009-11-10 T. Nikoletopoulos , A. C. C. Coolen , I. Perez-Castillo , N. S. Skantzos , J. P. L. Hatchett , B. Wemmenhove

We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…

Disordered Systems and Neural Networks · Physics 2009-11-13 C. J. Perez-Vicente , A. C. C. Coolen

We refine a result of Matei and Meyer on stable sampling and stable interpolation for simple model sets. Our setting is model sets in locally compact abelian groups and Fourier analysis of unbounded complex Radon measures as developed by…

Functional Analysis · Mathematics 2024-09-05 Christoph Richard , Christoph Schumacher

We address the problem of producing a lower bound for the mean of a discrete probability distribution, with known support over a finite set of real numbers, from an iid sample of that distribution. Up to a constant, this is equivalent to…

Statistics Theory · Mathematics 2025-02-25 Erik Learned-Miller

Many combinatorial optimization problems can be approximated within $(1 \pm \epsilon)$ factors in $\text{poly}(\log n, 1/\epsilon)$ rounds in the LOCAL model via network decompositions [Ghaffari, Kuhn, and Maus, STOC 2018]. These approaches…

Data Structures and Algorithms · Computer Science 2025-10-24 Yi-Jun Chang , Hsin-Hao Su

We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…

Probability · Mathematics 2016-02-16 Paul Jung

This paper studies theory and inference of an observation-driven model for time series of counts. It is assumed that the observations follow a Poisson distribution conditioned on an accompanying intensity process, which is equipped with a…

Methodology · Statistics 2013-07-18 Chao Wang , Heng Liu , Jian-Feng Yao , Richard A. Davis , Wai Keung Li

We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration…

Probability · Mathematics 2026-03-05 Matteo D'Achille , Francesco Mattesini , Dario Trevisan