Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.2236

Probability Bracket Notation: Probability Space, Conditional Expectation and Introductory Martingales

Xing M. Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we continue to explore the consistence and usability of Probability Bracket Notation (PBN) proposed in our previous articles. After a brief review of PBN with dimensional analysis, we investigate probability spaces in terms of PBN by introducing probability spaces associated with random variables (R.V) or associated with stochastic processes (S.P). Next, we express several important properties of conditional expectation (CE) and some their proofs in PBN. Then, we introduce martingales based on sequence of R.V or based on filtration in PBN. In the process, we see PBN can be used to investigate some probability problems, which otherwise might need explicit usage of Measure theory. Whenever applicable, we use dimensional analysis to validate our formulas and use graphs for visualization of concepts in PBN. We hope this study shows that PBN, stimulated by and adapted from Dirac notation in Quantum Mechanics (QM), may have the potential to be a useful tool in probability modeling, at least for those who are already familiar with Dirac notation in QM.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xing M. Wang. 2009-10-15. Probability Bracket Notation: Probability Space, Conditional Expectation and Introductory Martingales. https://arxiv.org/abs/0707.2236

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

KEEP EXPLORING

Related papers

arXiv2026

Rough backward SDEs with discontinuous Young drivers

We study solutions to backward differential equations that are driven hybridly by a deterministic discontinuous rough path $W$ of finite $q$-variation for $q \in [1, 2)$ and by Brownian motion $B$. To distinguish between integration of jumps in a forward- or Marcus-sense, we refer to these equations as forward- respectively Marcus-type rough backward stochastic differential equations (RBSDEs). We establish global well-posedness by proving global apriori bounds for solutions and employing fixed-point arguments locally. Furthermore, we lift the RBSDE solution and the driving rough noise to the space of decorated paths endowed with a Skorokhod-type metric and show stability of solutions with respect to perturbations of the rough noise. Finally, we prove well-posedness for a new class of backward doubly stochastic differential equations (BDSDEs), which are jointly driven by a Brownian martingale $B$ and an independent discontinuous stochastic process $L$ of finite $q$-variation. We explain, how our RBSDEs can be understood as conditional solutions to such BDSDEs, conditioned on the information generated by the path of $L$.

math.PR↗
arXiv2026

Convergence of the KMP model to the KPZ equation

We prove that the Kipnis-Marchioro-Presutti (KMP) process converges to the Kardar-Parisi-Zhang (KPZ) equation, as time $t$ goes to infinity, in a properly scaled observation window shifted by $t^{3/4}$. Our proof is based on identifying the KMP process with a stochastic flow of kernels describing transition probabilities in a certain model of random walk in space-time random environment. This allows to apply a recent result of arXiv:2401.06073 proving convergence of the density field of random walks in random environment to the KPZ equation in a suitably general sense.

math.PR↗
arXiv2026

Permuton and local limits for the Luce model

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities proportional to prescribed positive weights. These permutations arise in applications such as ranking models, the Tsetlin library, and related Markov processes. Under minimal assumptions on the weights, we establish a permuton limit theorem describing the global behavior of Luce-distributed permutations and derive an explicit density of the limiting permuton. We further compute limiting pattern densities and analyze the differences between exact Luce permutations and their permuton approximations. We also study the local convergence of these permutations, proving a quenched Benjamini--Schramm limit and a central limit theorem for consecutive pattern occurrences. Finally, we prove a central limit theorem for the number of inversions.

math.PR↗