Related papers: Extended de Finetti theorems for boolean independe…
We study Ruelle-Pollicott resonances in translationally invariant quantum many-body lattice systems via spectra of a momentum-resolved operator propagator on infinite systems. Momentum dependence gives insight into the decay of correlation…
In this paper, we examine how various notions of independence in non-commutative probability theory arise in bi-free probability. We exhibit how Boolean and monotone independence occur from bi-free pairs of faces and establish a Kac/Loeve…
We study some special classes of piecewise continuous maps on a finite smooth partition of a compact manifold and look for invariant measures for such maps. We show that in the simplest one-dimensional case (so-called interval translation…
Conditional independence and graphical models are well studied for probability distributions on product spaces. We propose a new notion of conditional independence for any measure $\Lambda$ on the punctured Euclidean space $\mathbb…
Separable Bayesian Networks, or the Influence Model, are dynamic Bayesian Networks in which the conditional probability distribution can be separated into a function of only the marginal distribution of a node's neighbors, instead of the…
We study algorithmic randomness and monotone complexity on product of the set of infinite binary sequences. We explore the following problems: monotone complexity on product space, Lambalgen's theorem for correlated probability,…
For two independent, almost surely finite random variables, independence of their minimum (time) and the event that one of them is either greater, equal or less than the other (cause) is completely characterized. It is shown that, other…
We establish a one-to-one correspondence between (i) exchangeable sequences of random variables whose finite-dimensional distributions are minimum (or maximum) infinitely divisible and (ii) non-negative, non-decreasing, infinitely divisible…
We extend the theory of d-separation to cases in which data instances are not independent and identically distributed. We show that applying the rules of d-separation directly to the structure of probabilistic models of relational data…
We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…
What does it mean for a causal structure to be `unknown'? Can we even talk about `repetitions' of an experiment without prior knowledge of causal relations? And under what conditions can we say that a set of processes with arbitrary,…
In this paper we study systems of $N$ uniformly expanding coupled maps when $N$ is finite but large. We introduce self-consistent transfer operators that approximate the evolution of measures under the dynamics, and quantify this…
We give a nonstandard analytic proof of de Finetti's theorem for an exchangeable sequence of Bernoulli random variables. The theorem postulates that such a sequence is uniquely representable as a mixture of iid sequences of Bernoulli random…
Independence testing plays a central role in statistical and causal inference from observational data. Standard independence tests assume that the data samples are independent and identically distributed (i.i.d.) but that assumption is…
We provide an operator algebraic proof of a classical theorem of Thoma which characterizes the extremal characters of the infinite symmetric group $\mathbb{S}_\infty$. Our methods are based on noncommutative conditional independence…
This paper introduces the class of selfdecomposable distributions concerning Boolean convolution. A general regularity property of Boolean selfdecomposable distributions is established; in particular the number of atoms is at most two and…
We show that Boolean functions expressible as monotone disjunctive normal forms are PAC-evolvable under a uniform distribution on the Boolean cube if the hypothesis size is allowed to remain fixed. We further show that this result is…
We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…
Let X_1, X_2,..., X_n be a sequence of independent random variables, let M be a rearrangement invariant space on the underlying probability space, and let N be a symmetric sequence space. This paper gives an approximate formula for the…
A length-$n$ random sequence $X_1,\ldots,X_n$ in a space $S$ is finitely exchangeable if its distribution is invariant under all $n!$ permutations of coordinates. Given $N > n$, we study the extendibility problem: when is it the case that…