Related papers: Self-Inverse and Exchangeable Random Variables
In probability theory, there is a tendency to treat one random variable with a given distribution as being just as good as any other. By and large this is fine because probability is (mostly) concerned with distributional properties of…
The negative binomial distribution is self similar: If the spectrum over the whole rapidity range gives rise to a negative binomial, in absence of correlation and if the source is unique, also a partial range in rapidity gives rise to the…
The (general) hypoexponential distribution is the distribution of a sum of independent exponential random variables. We consider the particular case when the involved exponential variables have distinct rate parameters. We prove that the…
We call a ring R pointwise semicommutative if for any element a in R either l(a) or r(a) is an ideal of R. A class of pointwise semicommutative rings is a strict generalization of semicommutative rings. Since reduced rings are pointwise…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
An element of a group is said to be reversible if it is conjugate to its inverse. We characterise the reversible elements in the group of diffeomorphisms of the real line, and in the subgroup of order preserving diffeomorphisms.
It is known that if X is uniformly distributed modulo 1 and Y is an arbitrary random variable independent of X then Y+X is also uniformly distributed modulo 1. We prove a converse for any continuous random variable Y (or a reasonable…
We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…
Let $X$ be a random variable that takes its values in $\frac{1}{q}\mathbb{Z}$, for some integer $q\ge2$, and consider $X$ rounded to an integer, either downwards or upwards or to the nearest integer. We give general formulas for the…
Investigation of the reversibility of the directional hierarchy in the interdependency among the notions of conditional independence, conditional mean independence, and zero conditional covariance, for two random variables X and Y given a…
When a linear model is adjusted to control for additional explanatory variables the sign of a fitted coefficient may reverse. Here these reversals are studied using coefficients of determination. The resulting theory can be used to…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
Given well-shuffled data, can we determine whether the data items are statistically (in)dependent? Formally, we consider the problem of testing whether a set of exchangeable random variables are independent. We will show that this is…
Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed…
It is a well-known fact that an exchangeable sequence has empirical distributions that form a reverse-martingale. This paper is devoted to proof of the converse statement. As a byproduct of the proof for the binary case, we introduce and…
The aim of this paper is to establish Hoeffding and Bernstein type concentration inequalities for weighted sums of exchangeable random variables. A special case is the i.i.d. setting, where random variables are sampled independently from…
A dynamical system is said to be reversible if, given an output, the input can always be recovered in a well-posed manner. Nevertheless, we argue that reversible systems that have a time-reversal symmetry, such as the Nonlinear…
A system (P_a: a in A) of probability measures on a common state space S indexed by another index set A can be ``realized'' by a system (X_a: a in A) of S-valued random variables on some probability space in such a way that each X_a is…
The inversion formula is given for automorphisms of the Weyl algebras with polynomial coefficients over a field of characteristic zero. The theorem of Gabber on the degree of polynomial automorphism is extended. It is proved that any…