SearcharxivSearch

arXiv · 1511.03516

Context-Content Systems of Random Variables: The Contextuality-by-Default Theory

Abstract

This paper provides a systematic yet accessible presentation of the Contextuality-by-Default theory. The consideration is confined to finite systems of categorical random variables, which allows us to focus on the basics of the theory without using full-scale measure-theoretic language. Contextuality-by-Default is a theory of random variables identified by their contents and their contexts, so that two variables have a joint distribution if and only if they share a context. Intuitively, the content of a random variable is the entity the random variable measures or responds to, while the context is formed by the conditions under which these measurements or responses are obtained. A system of random variables consists of stochastically unrelated "bunches," each of which is a set of jointly distributed random variables sharing a context. The variables that have the same content in different contexts form "connections" between the bunches. A probabilistic coupling of this system is a set of random variables obtained by imposing a joint distribution on the stochastically unrelated bunches. A system is considered noncontextual or contextual according to whether it can or cannot be coupled so that the joint distributions imposed on its connections possess a certain property (in the present version of the theory, "maximality"). We present a criterion of contextuality for a special class of systems of random variables, called cyclic systems. We also introduce a general measure of contextuality that makes use of (quasi-)couplings whose distributions may involve negative numbers or numbers greater than 1 in place of probabilities.

Explore related subjects

Keep this discovery

BibTeXRIS

Ehtibar N. Dzhafarov, Janne V. Kujala. 2016-05-27. Context-Content Systems of Random Variables: The Contextuality-by-Default Theory. https://arxiv.org/abs/1511.03516

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