Related papers: A logical approach to concentration

We study the concentration of the distribution of an additive function, when the sequence of prime values of $f$ decays fast and has good spacing properties. In particular, we prove a conjecture by Erdos and Katai on the concentration of…

Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…

Action convergence provides a limit theory for linear bounded operators $A_n:L^{\infty}(\Omega_n)\longrightarrow L^1(\Omega_n)$ where $\Omega_n$ are potentially different probability spaces. This notion of convergence emerged in graph…

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

Consider the setting of sparse graphs on N vertices, where the vertices have distinct "names", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some…

We study convergence rates of random-order best-response dynamics in games on networks with linear best responses and strategic substitutes. Combining formal analysis with numerical simulations we identify phenomena that lead to slow…

Clustering a graph means identifying internally dense subgraphs which are only sparsely interconnected. Formalizations of this notion lead to measures that quantify the quality of a clustering and to algorithms that actually find…

In this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture of Leader and Radcliffe (1994) and a question of Jones…

We study logical limit laws for uniform attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $n+1$, the vertex $n+1$ is introduced together with $m$ edges joining the new vertex with…

For random systems of $K$ polynomials in $N + 1$ real variables which include the models of Kostlan (1987) and Shub and Smale (1993), we prove that the number of zeros on the unit sphere for $K = N$ or the Hausdorff measure of the zero set…

The continuous and rapid growth of highly interconnected datasets, which are both voluminous and complex, calls for the development of adequate processing and analytical techniques. One method for condensing and simplifying such datasets is…

We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…

In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…

Consider a sequence of polynomials of bounded degree evaluated in independent Gaussian, Gamma or Beta random variables. We show that, if this sequence converges in law to a nonconstant distribution, then (i) the limit distribution is…

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $[n]:=\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $m/n\leq 1$, with high probability the…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

We prove new concentration estimates for random variables that are functionals of a Poisson measure defined on a general measure space. Our results are specifically adapted to geometric applications, and are based on a pervasive use of a…

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…