相关论文: On the Beck-Fiala Conjecture for Random Set System…

We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…

Chance constraints describe a set of given random inequalities depending on the decision vector satisfied with a large enough probability. They are widely used in decision making under uncertain data in many engineering problems. This paper…

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

In this paper we present a new error bound on sampling algorithms for frequent itemsets mining. We show that the new bound is asymptotically tighter than the state-of-art bounds, i.e., given the chosen samples, for small enough error…

We introduce sparse random projection, an important dimension-reduction tool from machine learning, for the estimation of discrete-choice models with high-dimensional choice sets. Initially, high-dimensional data are compressed into a…

We develop a maximum-likelihood based method for regression in a setting where the dependent variable is a random graph and covariates are available on a graph-level. The model generalizes the well-known $\beta$-model for random graphs by…

According to a theorem of S. Schumacher, for a diffusion X in an environment determined by a stable process that belongs to an appropriate class and has index a, it holds that X_t/(log t)^a converges in distribution, as t goes to infinity,…

We study a new family of random variables, that each arise as the distribution of the maximum or minimum of a random number $N$ of i.i.d.~random variables $X_1,X_2,\ldots,X_N$, each distributed as a variable $X$ with support on $[0,1]$. The…

Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…

We investigate the random close packing density, $\phi_\textrm{RCP}$, of polydisperse hard sphere systems using a theoretical framework based on the equilibrium model of crowding. We derive a closed-form solution for $\phi_\textrm{RCP}$ in…

We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible,…

A new method to simulate probability distributions in regions where the events are VERY unlikely (e.g. p ~ 10^{-40}) is presented. The basic idea is to represent the underlying probability space by the phase space of a physical system. The…

Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…

We obtain central limit theorems for stationary random fields employing a novel measure of dependence called $\theta$-lex weak dependence. We show that this dependence notion is more general than strong mixing, i.e., it applies to a broader…

Source-sink systems are metapopulations of patches that can be of variable habitat quality. They can be seen as graphs, where vertices represent the patches, and the weighted oriented edges give the probability of dispersal from one patch…

In a bivariate setting, we consider the problem of detecting a sparse contamination or mixture component, where the effect manifests itself as a positive dependence between the variables, which are otherwise independent in the main…

This paper presents the Poisson-randomized gamma dynamical system (PRGDS), a model for sequentially observed count tensors that encodes a strong inductive bias toward sparsity and burstiness. The PRGDS is based on a new motif in Bayesian…

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…

Consider the standard Gaussian linear regression model $Y=X\theta+\epsilon$, where $Y\in R^n$ is a response vector and $ X\in R^{n*p}$ is a design matrix. Numerous work have been devoted to building efficient estimators of $\theta$ when $p$…

We establish a new version of Siegel's lemma over a number field $k$, providing a bound on the maximum of heights of basis vectors of a subspace of $k^N$, $N \geq 2$. In addition to the small-height property, the basis vectors we obtain…