SearcharxivSearch

arXiv · 2412.00847

A Theory of Structural Independence

Abstract

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models. Formally, let $U = (U_i)_{i \in I}$ be an independent family of random elements on a probability space $(\Omega, \mathcal{A}, \mathbb{P})$. Let $X$, $Y$, and $Z$ be arbitrary $\sigma(U)$-measurable random elements. We characterize all independences $X \perp Y \mid Z$ implied by the independence of $U$ and call these independences \textit{structural}. Formally, these are the independences which hold in all probability measures $P$ that render $U$ independent and are absolutely continuous with respect to $\mathbb{P}$; i.e., for all such $P$, it must hold that $X \perp_P Y \mid Z$. We introduce the history $\mathcal{H}(X \mid Z) : \Omega \to \mathcal{P}(I)$, a combinatorial object that measures the dependence of $X$ on $U_i$ for each $i \in I$ given $Z$. The independence of $X$ and $Y$ given $Z$ is implied by the independence of $U$ if and only if $\mathcal{H}(X \mid Z) \cap \mathcal{H}(Y \mid Z) = \emptyset$ almost surely with respect to $\mathbb{P}$. Finally, we apply this $d$-separation-like criterion in structural causal models to discover a causal direction in a toy setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthias Georg Mayer. 2024-12-01. A Theory of Structural Independence. https://arxiv.org/abs/2412.00847

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR