scispace - formally typeset
Search or ask a question
Topic

Probability density function

About: Probability density function is a research topic. Over the lifetime, 22321 publications have been published within this topic receiving 422885 citations. The topic is also known as: probability function & PDF.


Papers
More filters
Journal ArticleDOI
Gedeon Dagan1
TL;DR: In this article, a first-order perturbation approximation of the Eulerian velocity covariances for uniform average flow is used to derive closed-form expressions of the closedform expressions for the concentration expectation value, which satisfies a diffusion equation with time-dependent apparent dispersion coefficients.
Abstract: Solute transport in porous formations is governed by the large-scale heterogeneity of hydraulic conductivity. The two typical lengthscales are the local one (of the order of metres) and the regional one (of the order of kilometres). The formation is modelled as a random fixed structure, to reflect the uncertainty of the space distribution of conductivity, which has a lognormal probability distribution function. A first-order perturbation approximation, valid for small log-conductivity variance, is used in order to derive closed-form expressions of the Eulerian velocity covariances for uniform average flow. The concentration expectation value is determined by using a similar approximation, and it satisfies a diffusion equation with time-dependent apparent dispersion coefficients. The longitudinal coefficients tend to constant values in both two- and three-dimensional flows only after the solute body has travelled a few tens of conductivity integral scales. This may be an exceedingly large distance in many applications for which the transient stage prevails. Comparison of theoretical results with recent field experimental data is quite satisfactory.The variance of the space-averaged concentration over a volume V may be quite large unless the lengthscale of the initial solute body or of V is large compared with the conductivity integral scale. This condition is bound to be obeyed for transport at the local scale, in which case the concentration may be assumed to satisfy the ergodic hypothesis. This is not generally the case at the regional scale, and the solute concentration is subjected to large uncertainty. The usefulness of the prediction of the concentration expectation value is then quite limited and the dispersion coefficients become meaningless.In the second part of the study, the influence of knowledge of the conductivity and head at a set of points upon transport is examined. The statistical moments of the velocity and concentration fields are computed for a subensemble of formations and for conditional probability distribution functions of conductivity and head, with measured values kept fixed at the set of measurement points. For conditional statistics the velocity is not stationary, and its mean and variance vary throughout the space, even if its unconditional mean and variance are constant. The main aim of the analysis is to examine the reduction of concentration coefficient of variation, i.e. of its uncertainty, by conditioning. It is shown that measurements of transmissivity on a grid of points can be effective in reducing concentration variance, provided that the distance between the points is smaller than two conductivity integral scales. Head conditioning has a lesser effect upon variance reduction.

925 citations

Journal ArticleDOI
TL;DR: In this article, the authors provided a formal statistical basis for the efficiency evaluation techniques of data envelopment analysis (DEA) and showed that DEA estimators of the best practice monotone increasing and concave production function are also maximum likelihood estimators if the deviation of actual output from the efficient output is regarded as a stochastic variable with a monotonically decreasing probability density function.
Abstract: This paper provides a formal statistical basis for the efficiency evaluation techniques of data envelopment analysis (DEA). DEA estimators of the best practice monotone increasing and concave production function are shown to be also maximum likelihood estimators if the deviation of actual output from the efficient output is regarded as a stochastic variable with a monotone decreasing probability density function. While the best practice frontier estimator is biased below the theoretical frontier for a finite sample size, the bias approaches zero for large samples. The DEA estimators exhibit the desirable asymptotic property of consistency, and the asymptotic distribution of the DEA estimators of inefficiency deviations is identical to the true distribution of these deviations. This result is then employed to suggest possible statistical tests of hypotheses based on asymptotic distributions.

908 citations

Journal ArticleDOI
TL;DR: A general formula for the density of a vine dependent distribution is derived, which generalizes the well-known density formula for belief nets based on the decomposition of belief nets into cliques and allows a simple proof of the Information Decomposition Theorem for a regular vine.
Abstract: A vine is a new graphical model for dependent random variables Vines generalize the Markov trees often used in modeling multivariate distributions They differ from Markov trees and Bayesian belief nets in that the concept of conditional independence is weakened to allow for various forms of conditional dependence A general formula for the density of a vine dependent distribution is derived This generalizes the well-known density formula for belief nets based on the decomposition of belief nets into cliques Furthermore, the formula allows a simple proof of the Information Decomposition Theorem for a regular vine The problem of (conditional) sampling is discussed, and Gibbs sampling is proposed to carry out sampling from conditional vine dependent distributions The so-called ‘canonical vines’ built on highest degree trees offer the most efficient structure for Gibbs sampling

836 citations

Proceedings ArticleDOI
04 Nov 1991
TL;DR: In this paper, a simple integral expression for calculating the exact probability of a symbol error for an arbitrary array of signal points is presented by applying it to M-ary phase shift keying (MPSK).
Abstract: The author presents a simple integral expression for calculating the exact probability of a symbol error for an arbitrary array of signal points. The integrand contains only elementary functions and the range of integration is finite. The approach is introduced by applying it to M-ary phase shift keying (MPSK). The special case of M=2 gives novel and possibly useful expressions for calculating the Gaussian tail probability function and the related complementary error function. The approach is outlined for polygonal decision regions, and results are given for 16-point signal constellations. A method of obtaining, not exact, but even simpler and highly accurate expressions for symbol error probability when the latter is less than a few hundredths is presented. >

813 citations

Journal ArticleDOI
TL;DR: In this paper, the authors studied the statistical distribution of the maximum values of a random function which is the sum of an infinite number of sine waves in random phase and applied it to sea waves and to the pitching and rolling motion of a ship.
Abstract: This paper studies the statistical distribution of the maximum values of a random function which is the sum of an infinite number of sine waves in random phase. The results are applied to sea waves and to the pitching and rolling motion of a ship.

811 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
88% related
Monte Carlo method
95.9K papers, 2.1M citations
87% related
Estimator
97.3K papers, 2.6M citations
86% related
Optimization problem
96.4K papers, 2.1M citations
85% related
Artificial neural network
207K papers, 4.5M citations
85% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023382
2022906
2021906
20201,047
20191,117
20181,083