2000 character limit reached
Littlewood-Offord problems for Ising models
Published 11 Aug 2024 in math.PR | (2408.05720v1)
Abstract: We consider the one dimensional Littlewood-Offord problem for general Ising models. More precisely, consider the concentration function [Q_n(x,v)=P(\sum_{i=1}{n}\varepsilon_iv_i\in(x-1,x+1)),] where $x\in\mathbb{R}$, $v_1,v_2,\ldots,v_n$ are real numbers such that $|v_1|\geq 1, |v_2|\geq 1,\ldots, |v_n|\geq 1$, and $(\varepsilon_i){i=1,2,\ldots,n}$ are spins of some Ising model. Let $Q_n=\sup{x,v}Q_n(x,v)$. Under natural assumptions, we show that there exists a universal constant $C$ such that for all $n\geq 1$, [\binom{n}{[n/2]}2{-n}\leq Q_n\leq Cn{-\frac{1}{2}}.]
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.