Concentration of Multilinear Functions of the Ising Model with Applications to Network Data

10/11/2017
by   Constantinos Daskalakis, et al.
0

We prove near-tight concentration of measure for polynomial functions of the Ising model under high temperature. For any degree d, we show that a degree-d polynomial of a n-spin Ising model exhibits exponential tails that scale as (-r^2/d) at radius r=Ω̃_d(n^d/2). Our concentration radius is optimal up to logarithmic factors for constant d, improving known results by polynomial factors in the number of spins. We demonstrate the efficacy of polynomial functions as statistics for testing the strength of interactions in social networks in both synthetic and real world data.

READ FULL TEXT
research
01/03/2022

On the concentration of the chromatic number of random graphs

Shamir and Spencer proved in the 1980s that the chromatic number of the ...
research
03/16/2021

On the joint spectral radius

We prove explicit polynomial bounds for Bochi's inequalities regarding t...
research
11/28/2020

Reciprocal maximum likelihood degrees of diagonal linear concentration models

We show that the reciprocal maximal likelihood degree (rmld) of a diagon...
research
09/18/2023

Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits

For every constant d, we design a subexponential time deterministic algo...
research
04/20/2020

Estimating Ising Models from One Sample

Given one sample X ∈{± 1}^n from an Ising model [X=x]∝(x^ J x/2), whose ...
research
07/07/2021

On the Probabilistic Degree of an n-variate Boolean Function

Nisan and Szegedy (CC 1994) showed that any Boolean function f:{0,1}^n→{...
research
06/02/2019

Approximate degree, secret sharing, and concentration phenomena

The ϵ-approximate degree deg_ϵ(f) of a Boolean function f is the least d...

Please sign up or login with your details

Forgot password? Click here to reset