Related papers: An improved decoupling inequality for random inter…
This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We establish tightness of graph-based stochastic processes in the space $D[0+\epsilon,1-\epsilon]$ with $\epsilon >0$ that allows for discontinuities of the first kind. The graph-based stochastic processes are based on statistics…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
We prove a deviation bound for the maximum of partial sums of functions of $\alpha$-dependent sequences as defined in Dedecker, Gou{\"e}zel and Merlev{\`e}de (2010). As a consequence, we extend the Rosenthal inequality of Rio (2000) for…
Deep neural networks may perform poorly when training datasets are heavily class-imbalanced. Recently, two-stage methods decouple representation learning and classifier learning to improve performance. But there is still the vital issue of…
The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…
The famous results of Koml\'os, Major and Tusn\'ady (see [15] and [17]) state that it is possible to approximate almost surely the partial sums of size n of i.i.d. centered random variables in L p (p > 2) by a Wiener process with an error…
In image deconvolution problems, the diagonalization of the underlying operators by means of the FFT usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard…
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling…
Supporting sampling in the presence of joins is an important problem in data analysis, but is inherently challenging due to the need to avoid correlation between output tuples. Current solutions provide either correlated or non-correlated…
Distance covariance is a popular measure of dependence between random variables. It has some robustness properties, but not all. We prove that the influence function of the usual distance covariance is bounded, but that its breakdown value…
We study the geometrical features of the order parameter's fluctuations near the critical point of mixed-order phase transitions in randomly interdependent spatial networks. In contrast to continuous transitions, where the structure of the…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
Tree structures are ubiquitous in data across many domains, and many datasets are naturally modelled by unobserved tree structures. In this paper, first we review the theory of random fragmentation processes [Bertoin, 2006], and a number of…
We show that for a typical coordinate projection of a subgaussian class of functions, the infimum over signs $\inf_{(\epsilon_i)}{\sup_{f\in F}}|{\sum_{i=1}^k\epsilon_i}f(X_i)|$ is asymptotically smaller than the expectation over signs as a…
The paper is devoted to tests for uniformity based on sum-functions of overlapping spacings, where the order of spacings can diverge to infinity as the sample size increases. In particular, it is shown that the asymptotic local power of…
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…
We (claim to) prove the extremely surprising fact that NP=RP. It is achieved by creating a Fully Polynomial-Time Randomized Approximation Scheme (FPRAS) for approximately counting the number of independent sets in bounded degree graphs,…
We derive a new upper bound for the correlations in a heterogeneous one-dimensional Ising model with free boundary conditions. The new upper bound quantifies the simultaneous decay of correlations due to weakness of nearest-neighbor…