Related papers: Hoeffding-ANOVA decompositions for symmetric stati…
We say that a topological space $X$ is selectively highly divergent (SHD) if for every sequence of non-empty open sets $\{U_n\mid n\in\omega \}$ of $X$, we can find $x_n\in U_n$ such that the sequence $(x_n)$ has no convergent subsequences.…
In his 1985 survey of notions of exchangeability, Aldous introduced a form of exchangeability corresponding to the symmetries of the infinite discrete cube, and asked whether these exchangeable probability measures enjoy a representation…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
Let $\{x_{\alpha}\}_{\alpha \in \mathbb{Z}}$ and $\{y_{\alpha}\}_{\alpha \in \mathbb{Z}}$ be two independent collections of zero mean, unit variance random variables with uniformly bounded moments of all orders. Consider a nonsymmetric…
We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…
The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the…
This paper is concerned with cross-sectional dependence arising because observations are interconnected through an observed network. Following Doukhan and Louhichi (1999), we measure the strength of dependence by covariances of nonlinearly…
When dealing with modern big data sets, a very common theme is reducing the set through a random process. These generally work by making "many simple estimates" of the full data set, and then judging them as a whole. Perhaps magically,…
As a motivating problem, we aim to study some special aspects of the marginal distributions of the order statistics for exchangeable and (more generally) for minimally stable non-negative random variables $T_{1},...,T_{r}$. In any case, we…
We investigate structure for pairs of randomizations that do not follow each other in a chain. These are unrandomized-inclusive, independent, coincident or double randomizations. This involves taking several structures that satisfy…
In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this assumption, the problem is often insoluble without…
It is proved that each Hoeffding space associated with a random permutation (or, equivalently, with extractions without replacement from a finite population) carries an irreducible representation of the symmetric group, equivalent to a…
A notion of conditionally identically distributed (c.i.d.) sequences has been studied as a form of stochastic dependence that is weaker than exchangeability, but is equivalent to exchangeability for stationary sequences. In this article we…
The problem of combining p-values is an old and fundamental one, and the classic assumption of independence is often violated or unverifiable in many applications. There are many well-known rules that can combine a set of arbitrarily…
We consider a discrete-time version of a Hawkes process defined as a Poisson auto-regressive process whose parameters depend on the past of the trajectory. We allow these parameters to take on negative values, modelling inhibition. More…
Parties connected to independent sources through a network can generate correlations among themselves. Notably, the space of feasible correlations for a given network, depends on the physical nature of the sources and the measurements…
The Hoeffding-type-inequalities are obtained for the distribution tails of canonical (degenerate) U- and V-statistics of an arbitrary order based on samples from a stationary sequence of observations satisfying $\rho$-mixing.
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…
Most of results of Bestvina and Mogilski [\textit{Characterizing certain incomplete infinite-dimensional absolute retracts}, Michigan Math. J. \textbf{33} (1986), 291--313] on strong $Z$-sets in ANR's and absorbing sets is generalized to…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…