Related papers: An Invariance Principle for the Multi-slice, with …
A notable result from analysis of Boolean functions is the Basic Invariance Principle (BIP), a quantitative nonlinear generalization of the Central Limit Theorem for multilinear polynomials. We present a generalization of the BIP for…
We propose a unified framework for establishing existence of nonparametric M-estimators, computing the corresponding estimates, and proving their strong consistency when the class of functions is exceptionally rich. In particular, the…
We present a theory for slicing probabilistic imperative programs -- containing random assignments, and ``observe'' statements (for conditioning) -- represented as probabilistic control-flow graphs (pCFGs) whose nodes modify probability…
We introduce and study multiple partition structures which are sequences of probability measures on families of Young diagrams subjected to a consistency condition. The multiple partition structures are generalizations of Kingman's…
Let $I=[0,1]$ and consider disjoint closed regions $G_{1},....,G_{n}$ in $% I\times I$ and subintervals $I_{1},......,I_{n},$ such that $G_{i}$ projects onto $I_{i.}$ We define the lower and upper maps $\tau_{1},$ $\tau_{2}$ by the lower…
Graph similarity measurement, which computes the distance/similarity between two graphs, arises in various graph-related tasks. Recent learning-based methods lack interpretability, as they directly transform interaction information between…
In this paper we consider a sufficiently broad class of nonlinear mathematical programs with disjunctive constraints, which, e.g., include mathematical programs with complemetarity/vanishing constraints. We present an extension of the…
The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k, every multiset of n real numbers with nonnegative total sum has at least (n-1 choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a…
The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…
We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…
In this paper we give simple sufficient conditions for linear type processes with short memory that imply the invariance principle. Various examples including projective criterion are considered as applications. In particular, we treat the…
We describe and analyze some Monte Carlo methods for manifolds in Euclidean space defined by equality and inequality constraints. First, we give an MCMC sampler for probability distributions defined by un-normalized densities on such…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
Two stochastic representations of multivariate geometric distributions are analyzed, both are obtained by lifting the lack-of-memory (LM) property of the univariate geometric law to the multivariate case. On the one hand, the narrow-sense…
The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…
We present a measure-theoretic condition for a property to hold ``almost everywhere'' on an infinite-dimensional vector space, with particular emphasis on function spaces such as $C^k$ and $L^p$. Like the concept of ``Lebesgue almost…
In this paper we prove a correspondence principle between multivariate functions of bounded variation in the sense of Hardy and Krause and signed measures of finite total variation, which allows us to obtain a simple proof of a generalized…
We construct a measure in the hamiltonian function level sets that is invariant under the hamiltonian flow for short times and flow preserving for arbitrarily long times. This allows a probabilistic approach to the study of hamiltonian…
Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…
The task of approximating a function of d variables from its evaluations at a given number of points is ubiquitous in numerical analysis and engineering applications. When d is large, this task is challenged by the so-called curse of…