arXiv subjects

Arthur Sinulis

Publications and source records attributed to Arthur Sinulis.

8 recordsLinked to original sources

arXiv2020

Concentration inequalities on the multislice and for sampling without replacement

We present concentration inequalities on the multislice which are based on (modified) log-Sobolev inequalities. This includes bounds for convex functions and multilinear polynomials. As an application we show concentration results for the triangle count in the $G(n,M)$ Erdős--Rényi model resembling known bounds in the $G(n,p)$ case. Moreover, we give a proof of Talagrand's convex distance inequality for the multislice. Interpreting the multislice in a sampling without replacement context, we furthermore present concentration results for $n$ out of $N$ sampling without replacement. Based on a bounded difference inequality involving the finite-sampling correction factor $1- n/N$, we present an easy proof of Serfling's inequality with a slightly worse factor in the exponent, as well as a sub-Gaussian right tail for the Kolmogorov distance between the empirical measure and the true distribution of the sample.

math.PR↗

arXiv2020

Concentration inequalities for bounded functionals via generalized log-Sobolev inequalities

In this paper we prove multilevel concentration inequalities for bounded functionals $f = f(X_1, \ldots, X_n)$ of random variables $X_1, \ldots, X_n$ that are either independent or satisfy certain logarithmic Sobolev inequalities. The constants in the tail estimates depend on the operator norms of $k$-tensors of higher order differences of $f$. We provide applications in both dependent and independent random variables. This includes deviation inequalities for empirical processes $f(X) = \sup_{g \in \mathcal{F}} \lvert g(X) \rvert$ and suprema of homogeneous chaos in bounded random variables in the Banach space case given by $f(X) = \sup_{t} \lVert \sum_{i_1 \neq \ldots \neq i_d} t_{i_1 \ldots i_d} X_{i_1} \cdots X_{i_d}\rVert_{\mathcal{B}}$. The latter application is comparable to earlier results of Boucheron-Bousquet-Lugosi-Massart and provides the upper tail bounds of Talagrand. In the case of Rademacher random variables, we give an interpretation of the results in terms of quantities familiar in Boolean analysis. Further applications are concentration inequalities for $U$-statistics with bounded kernels $h$ and for the number of triangles in an exponential random graph model.

math.PR↗

arXiv2020

Fluctuation results for general block spin Ising models

We study a block spin mean-field Ising model, i.e. a model of spins in which the vertices are divided into a finite number of blocks with each block having a fixed proportion of vertices, and where pair interactions are given according to their blocks. For the vector of block magnetizations we prove Large Deviation Principles and Central Limit Theorems under general assumptions for the block interaction matrix. Using the exchangeable pair approach of Stein's method we establish a rate of convergence in the Central Limit Theorem for the block magnetization vector in the high temperature regime.

math.PR↗

arXiv2020

Modified log-Sobolev inequalities and two-level concentration

We consider a generic modified logarithmic Sobolev inequality (mLSI) of the form $\mathrm{Ent}_μ(e^f) \le \tfracρ{2} \mathbb{E}_μe^f Γ(f)^2$ for some difference operator $Γ$, and show how it implies two-level concentration inequalities akin to the Hanson--Wright or Bernstein inequality. This can be applied to the continuous (e.\,g. the sphere or bounded perturbations of product measures) as well as discrete setting (the symmetric group, finite measures satisfying an approximate tensorization property, \ldots). Moreover, we use modified logarithmic Sobolev inequalities on the symmetric group $S_n$ and for slices of the hypercube to prove Talagrand's convex distance inequality, and provide concentration inequalities for locally Lipschitz functions on $S_n$. Some examples of known statistics are worked out, for which we obtain the correct order of fluctuations, which is consistent with central limit theorems.

math.PR↗

arXiv2019

Concentration inequalities for polynomials in $α$-sub-exponential random variables

In this work we derive multi-level concentration inequalities for polynomial functions in independent random variables with a $α$-sub-exponential tail decay. A particularly interesting case is given by quadratic forms $f(X_1, \ldots, X_n) = \langle X,A X \rangle$, for which we prove Hanson-Wright-type inequalities with explicit dependence on various norms of the matrix $A$. A consequence of these inequalities is a two-level concentration inequality for quadratic forms in $α$-sub-exponential random variables, such as quadratic Poisson chaos. We provide various applications of these inequalities. Among these are generalizations the results given by Rudelson-Vershynin from sub-Gaussian to $α$-sub-exponential random variables, i. e. concentration of the Euclidean norm of the linear image of a random vector, small ball probability estimates and concentration inequalities for the distance between a random vector and a fixed subspace. Moreover, we obtain concentration inequalities for the excess loss in a fixed design linear regression and the norm of a randomly projected random vector.

math.PR↗

arXiv2019

Mixing times of Glauber dynamics via entropy methods

In this work we prove sufficient conditions for the Glauber dynamics corresponding to a sequence of (non-product) measures on finite product spaces to be rapidly mixing, i.e. that the mixing time with respect to the total variation distance satisfies $t_{mix} = O(N \log N)$, where $N$ is the system size. The proofs do not rely on coupling arguments, but instead use functional inequalities. As a byproduct, we obtain exponential decay of the relative entropy along the Glauber semigroup. These conditions can be checked in various examples, which include the exponential random graph models with sufficiently small parameters (which does not require any monotonicity in the system and thus also applies to negative parameters, as long the associated monotone system is in the high temperature phase), the vertex-weighted exponential random graph models, as well as models with hard constraints such as the random coloring and the hard-core model.

math.PR↗

arXiv2019

Logarithmic Sobolev inequalities for finite spin systems and applications

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted) exponential random graph model, the random coloring and the hard-core model with fugacity. This leads to two separate branches of applications. The first branch is given by mixing time estimates of the Glauber dynamics. The proofs do not rely on coupling arguments, but instead use functional inequalities. As a byproduct, this also yields exponential decay of the relative entropy along the Glauber semigroup. Secondly, we investigate the concentration of measure phenomenon (particularly of higher order) for these spin systems. We show the effect of better concentration properties by centering not around the mean, but a stochastic term in the exponential random graph model. From there, one can deduce a central limit theorem for the number of triangles from the CLT of the edge count. In the Erdös-Rényi model the first order approximation leads to a quantification and a proof of a central limit theorem for subgraph counts.

math.PR↗

arXiv2018

Higher order concentration for functions of weakly dependent random variables

We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a difference operator that arises from Gibbs sampler type dynamics. Examples of such random variables include the Ising model on a graph with n nodes with general, but weak interactions, i.e. in the Dobrushin uniqueness regime, for which we prove concentration results of homogeneous polynomials, as well as random permutations, and slices of the hypercube with dynamics given by either the Bernoulli-Laplace or the symmetric simple exclusion processes.

math.PR↗