Relevant bibliographies by topics / Probability theory

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Probability theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 28 September 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Probability theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Probability theory"

1

Thun, M. von. "Probability Theory and Probability Semantics." Australasian Journal of Philosophy 79, no. 4 (December 2001): 570–71. http://dx.doi.org/10.1080/713659287.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kiessler, Peter C. "Measure Theory and Probability Theory." Journal of the American Statistical Association 102, no. 479 (September 2007): 1078. http://dx.doi.org/10.1198/jasa.2007.s207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Berckmoes, B., R. Lowen, and J. Van Casteren. "Approach theory meets probability theory." Topology and its Applications 158, no. 7 (April 2011): 836–52. http://dx.doi.org/10.1016/j.topol.2011.01.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lindley, D. V., and Harold Jeffreys. "Theory of Probability." Mathematical Gazette 83, no. 497 (July 1999): 372. http://dx.doi.org/10.2307/3619118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guionnet, Alice, Roland Speicher, and Dan-Virgil Voiculescu. "Free Probability Theory." Oberwolfach Reports 12, no. 2 (2015): 1571–629. http://dx.doi.org/10.4171/owr/2015/28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Guionnet, Alice, Roland Speicher, and Dan-Virgil Voiculescu. "Free Probability Theory." Oberwolfach Reports 15, no. 4 (December 16, 2019): 3147–215. http://dx.doi.org/10.4171/owr/2018/53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bhat, B. R. "Modern Probability Theory." Biometrics 42, no. 4 (December 1986): 1007. http://dx.doi.org/10.2307/2530732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jeffreys, H., P. A. P. Moran, and C. Chatfield. "Theory of Probability." Biometrics 41, no. 2 (June 1985): 597. http://dx.doi.org/10.2307/2530899.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Speicher, Roland. "Free Probability Theory." Jahresbericht der Deutschen Mathematiker-Vereinigung 119, no. 1 (September 15, 2016): 3–30. http://dx.doi.org/10.1365/s13291-016-0150-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

MTW and Harold Jeffreys. "Theory of Probability." Journal of the American Statistical Association 94, no. 448 (December 1999): 1389. http://dx.doi.org/10.2307/2669965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Probability theory"

1

Halliwell, Joe. "Linguistic probability theory." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/29135.

Full text
Abstract:
A theory of linguistic probabilities as is patterned after the standard Kolmogorov axioms of probability theory. Since fuzzy numbers lack algebraic inverses, the resulting theory is weaker than, but generalizes its classical counterpart. Nevertheless, it is demonstrated that analogues for classical probabilistic concepts such as conditional probability and random variables can be constructed. In the classical theory, representation theorems mean that most of the time the distinction between mass/density distributions and probability measures can be ignored. Similar results are proven for linguistic probabilities. From these results it is shown that directed acyclic graphs annotated with linguistic probabilities (under certain identified conditions) represent systems of linguistic random variables. It is then demonstrated these linguistic Bayesian networks can utilize adapted best-of-breed Bayesian network algorithms (junction tree based inference and Bayes’ ball irrelevancy calculation). These algorithms are implemented in Arbor, an interactive design, editing and querying tool for linguistic Bayesian networks. To explore the applications of these techniques, a realistic example drawn from the domain of forensic statistics is developed. In this domain the knowledge engineering problems cited above are especially pronounced and expert estimates are commonplace. Moreover, robust conclusions are of unusually critical importance. An analysis of the resulting linguistic Bayesian network for assessing evidential support in glass-transfer scenarios highlights the potential utility of the approach.
APA, Harvard, Vancouver, ISO, and other styles
2

Youmbi, Norbert. "Probability theory on semihypergroups." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001201.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sorokin, Yegor. "Probability theory, fourier transform and central limit theorem." Manhattan, Kan. : Kansas State University, 2009. http://hdl.handle.net/2097/1604.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Johns, Richard. "A theory of physical probability." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0027/NQ38907.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Perlin, Alex 1974. "Probability theory on Galton-Watson trees." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8673.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2001.
Includes bibliographical references (p. 91).
By a Galton-Watson tree T we mean an infinite rooted tree that starts with one node and where each node has a random number of children independently of the rest of the tree. In the first chapter of this thesis, we prove a conjecture made in [7] for Galton-Watson trees where vertices have bounded number of children not equal to 1. The conjecture states that the electric conductance of such a tree has a continuous distribution. In the second chapter, we study rays in Galton-Watson trees. We establish what concentration of vertices with is given number of children is possible along a ray in a typical tree. We also gauge the size of the collection of all rays with given concentrations of vertices of given degrees.
by Alex Perlin.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Jiun-Chau. "Limit theorems in noncommutative probability theory." [Bloomington, Ind.] : Indiana University, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3331258.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2008.
Title from PDF t.p. (viewed on Jul 27, 2009). Source: Dissertation Abstracts International, Volume: 69-11, Section: B, page: 6852. Adviser: Hari Bercovici.
APA, Harvard, Vancouver, ISO, and other styles
7

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text
Abstract:
Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this work generalizes the sieve of Eratosthenes to a sequence of polynomial values called polynomial-value sieving. In the case of quadratics, the method of polynomial-value sieving may be characterized briefly as a product presentation of two binary quadratic forms. Polynomials for which the polynomial-value sieving yields all possible integer factorizations of the polynomial values are called recursively-factorable. The Euler and Legendre prime producing polynomials of the form n2+n+p and 2n2+p, respectively, and Landau's n2+1 are shown to be recursively-factorable. Integer factorizations realized by the polynomial-value sieving method, applied to quadratic functions, are in direct correspondence with the lattice point solutions (X,Y) of the conic sections aX2+bXY +cY2+X-nY=0. The factorization structure of the underlying quadratic polynomial is shown to have geometric properties in the space of the associated lattice point solutions of these conic sections. In the area of combinatorial graph theory, this work considers two topological structures that are used to model the process of homologous genetic recombination: assembly graphs and chord diagrams. The result of a homologous recombination can be recorded as a sequence of signed permutations called a micronuclear arrangement. In the assembly graph model, each micronuclear arrangement corresponds to a directed Hamiltonian polygonal path within a directed assembly graph. Starting from a given assembly graph, we construct all the associated micronuclear arrangements. Another way of modeling genetic rearrangement is to represent precursor and product genes as a sequence of blocks which form arcs of a circle. Associating matching blocks in the precursor and product gene with chords produces a chord diagram. The braid index of a chord diagram can be used to measure the scope of interaction between the crossings of the chords. We augment the brute force algorithm for computing the braid index to utilize a divide and conquer strategy. Both assembly graphs and chord diagrams are closely associated with double occurrence words, so we classify and enumerate the double occurrence words based on several notions of irreducibility. In the area of analytic probability, moments abstractly describe the shape of a probability distribution. Over the years, numerous varieties of moments such as central moments, factorial moments, and cumulants have been developed to assist in statistical analysis. We use inversion formulas to compute high order moments of various types for common probability distributions, and show how the successive ratios of moments can be used for distribution and parameter fitting. We consider examples for both simulated binomial data and the probability distribution affiliated with the braid index counting sequence. Finally we consider a sequence of multiparameter binomial sums which shares similar properties with the moment sequences generated by the binomial and beta-binomial distributions. This sequence of sums behaves asymptotically like the high order moments of the beta distribution, and has completely monotonic properties.
APA, Harvard, Vancouver, ISO, and other styles
8

Christopher, Fisher Ryan. "Are people naive probability theorists? An examination of the probability theory + variation model." Miami University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=miami1406657670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tarrago, Pierre. "Non-commutative generalization of some probabilistic results from representation theory." Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1123/document.

Full text
Abstract:
Le sujet de cette thèse est la généralisation non-commutative de résultats probabilistes venant de la théorie des représentations. Les résultats obtenus se divisent en trois parties distinctes. Dans la première partie de la thèse, le concept de groupe quantique easy est étendu au cas unitaire. Tout d'abord, nous donnons une classification de l'ensemble des groupes quantiques easy unitaires dans le cas libre et classique. Nous étendons ensuite les résultats probabilistes de au cas unitaire. La deuxième partie de la thèse est consacrée à une étude du produit en couronne libre. Dans un premier temps, nous décrivons les entrelaceurs des représentations dans le cas particulier d'un produit en couronne libre avec le groupe symétrique libre: cette description permet également d'obtenir plusieurs résultats probabilistes. Dans un deuxième temps, nous établissons un lien entre le produit en couronne libre et les algèbres planaires: ce lien mène à une preuve d'une conjecture de Banica et Bichon. Dans la troisième partie de la thèse, nous étudions un analoque du graphe de Young qui encode la structure multiplicative des fonctions fondamentales quasi-symétriques. La frontière minimale de ce graphe a déjà été décrite par Gnedin et Olshanski. Nous prouvons que la frontière minimale coïncide avec la frontière de Martin. Au cours de cette preuve, nous montrons plusieurs résultats combinatoires asymptotiques concernant les diagrammes de Young en ruban
The subject of this thesis is the non-commutative generalization of some probabilistic results that occur in representation theory. The results of the thesis are divided into three different parts. In the first part of the thesis, we classify all unitary easy quantum groups whose intertwiner spaces are described by non-crossing partitions, and develop the Weingarten calculus on these quantum groups. As an application of the previous work, we recover the results of Diaconis and Shahshahani on the unitary group and extend those results to the free unitary group. In the second part of the thesis, we study the free wreath product. First, we study the free wreath product with the free symmetric group by giving a description of the intertwiner spaces: several probabilistic results are deduced from this description. Then, we relate the intertwiner spaces of a free wreath product with the free product of planar algebras, an object which has been defined by Bisch and Jones. This relation allows us to prove the conjecture of Banica and Bichon. In the last part of the thesis, we prove that the minimal and the Martin boundaries of a graph introduced by Gnedin and Olshanski are the same. In order to prove this, we give some precise estimates on the uniform standard filling of a large ribbon Young diagram. This yields several asymptotic results on the filling of large ribbon Young diagrams
APA, Harvard, Vancouver, ISO, and other styles
10

McGillivray, Ivor Edward. "Some applications of Dirichlet forms in probability theory." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Probability theory"

1

Meyer, Paul André. Quantum probability for probabilists. Berlin: Springer-Verlag, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Louis H. Y., Kwok P. Choi, Kaiyuan Hu, and Lou Jiann-Hua, eds. Probability Theory. Berlin, Boston: DE GRUYTER, 1992. http://dx.doi.org/10.1515/9783110862829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rudas, Tamás. Probability Theory. 2455 Teller Road, Thousand Oaks California 91320 United States of America: SAGE Publications, Inc., 2004. http://dx.doi.org/10.4135/9781412985482.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sinai, Yakov G. Probability Theory. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-02845-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chow, Yuan Shih, and Henry Teicher. Probability Theory. New York, NY: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4684-0504-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hendricks, Vincent F., Stig Andur Pedersen, and Klaus Frovin Jørgensen, eds. Probability Theory. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9648-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Klenke, Achim. Probability Theory. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-56402-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pakshirajan, R. P. Probability Theory. Gurgaon: Hindustan Book Agency, 2013. http://dx.doi.org/10.1007/978-93-86279-54-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chow, Yuan Shih, and Henry Teicher. Probability Theory. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1950-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Borkar, Vivek S. Probability Theory. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-0791-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Probability theory"

1

O’Hagan, Anthony. "Distribution theory." In Probability, 132–56. Dordrecht: Springer Netherlands, 1988. http://dx.doi.org/10.1007/978-94-009-1211-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cohn, Donald L. "Probability." In Measure Theory, 307–71. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6956-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lynch, Scott M. "Probability Theory." In Using Statistics in Social Research, 57–81. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8573-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Koch, Karl-Rudolf. "Probability Theory." In Parameter Estimation and Hypothesis Testing in Linear Models, 87–173. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-662-02544-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Čepin, Marko. "Probability Theory." In Assessment of Power System Reliability, 33–57. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-688-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lista, Luca. "Probability Theory." In Statistical Methods for Data Analysis in Particle Physics, 1–23. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62840-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Durrett, Rick. "Probability Theory." In Mathematics Unlimited — 2001 and Beyond, 393–405. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56478-9_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stroock, Daniel W. "Probability Theory." In Mathematics Unlimited — 2001 and Beyond, 1105–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56478-9_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sucar, Luis Enrique. "Probability Theory." In Probabilistic Graphical Models, 15–26. London: Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6699-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yao, Kai. "Probability Theory." In Uncertain Renewal Processes, 1–25. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9345-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Probability theory"

1

Temlyakov, V. N. "Optimal estimators in learning theory." In Approximation and Probability. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2006. http://dx.doi.org/10.4064/bc72-0-23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Helland, Inge S. "Quantum theory as a statistical theory under symmetry." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 3. AIP, 2005. http://dx.doi.org/10.1063/1.1874567.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gudder, Stan. "Fuzzy Quantum Probability Theory." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 3. AIP, 2005. http://dx.doi.org/10.1063/1.1874565.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pleśniak, W. "Multivariate polynomial inequalities viapluripotential theory and subanalytic geometry methods." In Approximation and Probability. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2006. http://dx.doi.org/10.4064/bc72-0-16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chiribella, G., G. M. D'Ariano, and Paolo Perinotti. "Informational axioms for quantum theory." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 6. AIP, 2012. http://dx.doi.org/10.1063/1.3688980.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pérez-Suárez, Marcos. "Bayesian Intersubjectivity and Quantum Theory." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 3. AIP, 2005. http://dx.doi.org/10.1063/1.1874582.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Woesler, Richard. "Problems of Quantum Theory may be Solved by an Emulation Theory of Quantum Physics." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 3. AIP, 2005. http://dx.doi.org/10.1063/1.1874589.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vacchini, B. "A Probabilistic View on Decoherence Theory." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 4. AIP, 2007. http://dx.doi.org/10.1063/1.2713491.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sverdlov, Roman. "Quantum field theory without Fock space." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 6. AIP, 2012. http://dx.doi.org/10.1063/1.3688986.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gregory, Lee. "Quantum Filtering Theory and the Filtering Interpretation." In FOUNDATIONS OF PROBABILITY AND PHYSICS - 3. AIP, 2005. http://dx.doi.org/10.1063/1.1874562.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Probability theory"

1

Hurley, Michael B. Track Association with Bayesian Probability Theory. Fort Belvoir, VA: Defense Technical Information Center, October 2003. http://dx.doi.org/10.21236/ada417987.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Goodman, I. R., and V. M. Bier. A Re-Examination of the Relationship between Fuzzy Set Theory and Probability Theory. Fort Belvoir, VA: Defense Technical Information Center, August 1991. http://dx.doi.org/10.21236/ada240243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Steele, J. M. Probability and Statistics Applied to the Theory of Algorithms. Fort Belvoir, VA: Defense Technical Information Center, April 1995. http://dx.doi.org/10.21236/ada295805.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sullivan, Keith M., and Ian Grivell. QSIM: A Queueing Theory Model with Various Probability Distribution Functions. Fort Belvoir, VA: Defense Technical Information Center, March 2003. http://dx.doi.org/10.21236/ada414471.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Oberkampf, William Louis, W. Troy Tucker, Jianzhong Zhang, Lev Ginzburg, Daniel J. Berleant, Scott Ferson, Janos Hajagos, and Roger B. Nelsen. Dependence in probabilistic modeling, Dempster-Shafer theory, and probability bounds analysis. Office of Scientific and Technical Information (OSTI), October 2004. http://dx.doi.org/10.2172/919189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wise, Gary L. Some Applications of Probability and Statistics in Communication Theory and Signal Processing. Fort Belvoir, VA: Defense Technical Information Center, August 1990. http://dx.doi.org/10.21236/ada226869.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ilyin, M. E. The distance learning course «Theory of probability, mathematical statistics and random functions». OFERNIO, December 2018. http://dx.doi.org/10.12731/ofernio.2018.23529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Budhiraja, Amarjit. Stochastic Analysis and Applied Probability(3.3.1): Topics in the Theory and Applications of Stochastic Analysis. Fort Belvoir, VA: Defense Technical Information Center, July 2015. http://dx.doi.org/10.21236/ada625850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kott, Phillip S. The Degrees of Freedom of a Variance Estimator in a Probability Sample. RTI Press, August 2020. http://dx.doi.org/10.3768/rtipress.2020.mr.0043.2008.

Full text
Abstract:
Inferences from probability-sampling theory (more commonly called “design-based sampling theory”) often rely on the asymptotic normality of nearly unbiased estimators. When constructing a two-sided confidence interval for a mean, the ad hoc practice of determining the degrees of freedom of a probability-sampling variance estimator by subtracting the number of its variance strata from the number of variance primary sampling units (PSUs) can be justified by making usually untenable assumptions about the PSUs. We will investigate the effectiveness of this conventional and an alternative method for determining the effective degrees of freedom of a probability-sampling variance estimator under a stratified cluster sample.
APA, Harvard, Vancouver, ISO, and other styles
10

Zio, Enrico, and Nicola Pedroni. Literature review of methods for representing uncertainty. Fondation pour une culture de sécurité industrielle, December 2013. http://dx.doi.org/10.57071/124ure.

Full text
Abstract:
This document provides a critical review of different frameworks for uncertainty analysis, in a risk analysis context: classical probabilistic analysis, imprecise probability (interval analysis), probability bound analysis, evidence theory, and possibility theory. The driver of the critical analysis is the decision-making process and the need to feed it with representative information derived from the risk assessment, to robustly support the decision. Technical details of the different frameworks are exposed only to the extent necessary to analyze and judge how these contribute to the communication of risk and the representation of the associated uncertainties to decision-makers, in the typical settings of high-consequence risk analysis of complex systems with limited knowledge on their behaviour.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Probability theory' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography