Synonyms
Definition
A random variable Z is said to follow a symmetric α-stable distribution [13, 15], where 0 < α ≤ 2, if the Fourier transform of its probability density function f Z (z) satisfies
where d > 0 is the scale parameter. This is denoted by Z ∼ S(α, d).
There is an equivalent definition. A random variable Z follows a symmetric α-stable distribution if, for any real numbers, C 1 and C 2,
where Z 1 and Z 2 are independent copies of Z, and the symbol “\( \overset{d}{=} \)” denotes equality in distribution.
The probability density function f Z (z) can be obtained by taking inverse Fourier transform of 1. In particular, f Z (z) can be expressed in closed-forms when α = 2 (i.e., the normal distribution) and α= 1 (i.e., the...
This is a preview of subscription content, log in via an institution.
Recommended Reading
Achlioptas D. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J Comput Syst Sci. 2003;66(4):671–87.
Alon N, Matias Y, Szegedy M. The space complexity of approximating the frequency moments. In: Proceedings of the 28th annual ACM symposium on theory of computing. 1996. p. 20–9.
Cormode G, Datar M, Indyk P, Muthukrishnan S. Comparing data streams using hamming norms (how to zero in). In: Proceedings of the 28th international conference on very large data bases. 2002. p. 335–45.
Datar M, Immorlica N, Indyk P, Mirrokn VS. Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the 20th annual symposium on computational geometry. 2004. p. 253–62.
Donoho DL. Compressed sensing. IEEE Trans Inform Theory. 2006;52(4):1289–306.
Fama EF, Roll R. Parameter estimates for symmetric stable distributions. J Am Stat Assoc. 1971;66(334):331–8.
Indyk P. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J ACM. 2006;53(3):307–23.
Indyk P, Motwani R. Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the 30th annual ACM symposium on theory of computing. 1998. p. 604–13.
Johnson WB, Lindenstrauss J. Extensions of Lipschitz mapping into Hilbert space. Contemp Math. 1984;26:189–206.
Li P. Very sparse stable random projections for dimension reduction in l α (0 < α ≤ 2) norm. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. 2007.
Li P. Estimators and tail bounds for dimension reduction in l α (0 < α ≤ 2) using stable random projections. In: Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms. 2008.
Muthukrishnan S. Data streams: algorithms and applications. Found Trends Theor Comput Sci. 2005;11:117–236.
Samorodnitsky G, Taqqu MS. Stable Non-Gaussian random processes: Chapman & Hall; 1994.
Vempala S. The random projection method. Providence: American Mathematical Society; 2004.
Zolotarev VM. One-dimensional stable distributions. Providence: American Mathematical Society; 1986.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media LLC
About this entry
Cite this entry
Li, P. (2016). Stable Distribution. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_367-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_367-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering