Search NASA⌕ Search

SEARCH · Search NASA

Results for “random variables”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2011

Adaptive sparse polynomial chaos expansion based on least angle regression

Polynomial chaos (PC) expansions are used in stochastic finite element analysis to represent the random model response by a set of coefficients in a suitable (so-called polynomial chaos) basis. The number of terms to be computed grows dramatically with the size of the input random vector, which makes the computational cost of classical solution schemes (may it be intrusive (i.e. of Galerkin type) or non intrusive) unaffordable when the deterministic finite element model is expensive to evaluate. To address such problems, the paper describes a non intrusive method that builds a sparse PC expansion. First, an original strategy for truncating the PC expansions, based on hyperbolic index sets, is proposed. Then an adaptive algorithm based on least angle regression (LAR) is devised for automatically detecting the significant coefficients of the PC expansion. Beside the sparsity of the basis, the experimental design used at each step of the algorithm is systematically complemented in order to avoid the overfitting phenomenon. The accuracy of the PC metamodel is checked using an estimate inspired by statistical learning theory, namely the corrected leave-one-out error. As a consequence, a rather small number of PC terms are eventually retained (sparse representation), which may be obtained at a reduced computational cost compared to the classical 'full' PC approximation. The convergence of the algorithm is shown on an analytical function. Then the method is illustrated on three stochastic finite element problems. The first model features 10 input random variables, whereas the two others involve an input random field, which is discretized into 38 and 30 - 500 random variables, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Quantifying networks complexity from information geometry viewpoint

We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as weighted edges among vertices. We then associate to the parameter space a statistical manifold endowed with a Riemannian metric structure (that of Fisher-Rao). Going on, in analogy with the microcanonical definition of entropy in Statistical Mechanics, we introduce an entropic measure of networks complexity. We prove that it is invariant under networks isomorphism. Above all, considering networks as simplicial complexes, we evaluate this entropy on simplexes and find that it monotonically increases with their dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

UNDERSTANDING THE SEMI-PROBABILISTIC APPROACHES IN STRUCTURAL RELIABILITY USED TO SET DESIGN RELIABILITY TARGETS FOR GRAPHITE COMPONENTS USING ASME BPVC METHODS

Graphite is a quasi-brittle material, resulting in random variability in tensile strength distributions. To account for the random variability in strength, HHA-3000 of the ASME BPVC provides two semi-probabilistic methods for qualifying nuclear graphite components in the design stage, the simplified and full assessments. The full and simplified assessments apply statistical methods to engineering-based design problems. This is often referred to as reliability-based design. Reliability-based design (RBD) is a method to develop reliable designs by accounting for uncertainties and result in small chances of failure when also considering safety factors. RBDs provide reliability targets using semi-probabilistic approaches. RBD is implemented in ASME BPVC HHA-3000 for nuclear graphite components, but is not specific to that application. There has been much confusion around the methods implemented in ASME BPVC HHA-3000 for qualifying nuclear graphite components. To address the confusion, this paper takes a hierarchical approach. First, the general RBD framework is presented. Then, the semi-probabilistic methods and the underlying assumptions implemented in the assessments are presented. The semi-probabilistic methods are separated from the engineering modifications that have been made to the assessments. After building the framework and underlying assumptions, the specific methods in the full and simplified assessments are explained in three steps: inputs, methods, outputs. The methods are applied to an H-451 reflector block. Tensile strength properties for other graphite grades are provided.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

A functional global sensitivity measure and efficient reliability sensitivity analysis with respect to statistical parameters

Sensitivity analysis and reliability assessment are two important aspects of structural and system safety. Epistemic uncertainty with respect to probabilistic model of input parameters due to lack of knowledge is present in many scarce-data applications and complicates the characterization of uncertainty in model response. In this article, we present two importance measures to evaluate the impact of distribution parameters on the probability distribution function (PDF) of the output and the failure probability. The epistemic uncertainty associated with the distribution parameters is modeled as random variables. Additionally, a modified extended polynomial chaos expansion (MEPCE) approach is introduced in which aleatory and epistemic random variables are modeled and propagated simultaneously while allowing the separate assessment for any single epistemic variable. A MEPCE-based kernel density estimation (KDE) construction provides a composite map from each epistemic variable to the response PDF. The functional global sensitivity index of the PDF with respect to the distribution parameters is thus derived, as a function of output, which is both more informative and more efficient than standard scalar sensitivity measures. Reliability sensitivity indices can be readily evaluated by integrating the global sensitivity index function over the failure zone. Three illustrative examples are used to demonstrate the proposed methodology.

42 ENGINEERING↗
DOE OSTI2014

Radio variability and random walk noise properties of four blazars

We present the results of a time series analysis of the long-term radio light curves of four blazars: 3C 279, 3C 345, 3C 446, and BL Lacertae. We exploit the database of the University of Michigan Radio Astronomy Observatory monitoring program which provides densely sampled light curves spanning 32 years in time in three frequency bands located at 4.8, 8, and 14.5 GHz. Our sources show mostly flat or inverted (spectral indices –0.5 ≲ α ≲ 0) spectra, in agreement with optically thick emission. All light curves show strong variability on all timescales. Analyzing the time lags between the light curves from different frequency bands, we find that we can distinguish high-peaking flares and low-peaking flares in accordance with the classification of Valtaoja et al. The periodograms (temporal power spectra) of the observed light curves are consistent with random-walk power-law noise without any indication of (quasi-)periodic variability. The fact that all four sources studied are in agreement with being random-walk noise emitters at radio wavelengths suggests that such behavior is a general property of blazars.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Random field optimization

Herein we present a new modeling paradigm for optimization that we call random field optimization. Random fields are a powerful modeling abstraction that aims to capture the behavior of random variables that live on infinite-dimensional spaces (e.g., space and time) such as stochastic processes (e.g., time series, Gaussian processes, and Markov processes), random matrices, and random spatial fields. This paradigm involves sophisticated mathematical objects (e.g., stochastic differential equations and space-time kernel functions) and has been widely used in neuroscience, geoscience, physics, civil engineering, and computer graphics. Despite of this, however, random fields have seen limited use in optimization; specifically, existing optimization paradigms that involve uncertainty (e.g., stochastic programming and robust optimization) mostly focus on the use of finite random variables. This trend is rapidly changing with the advent of statistical optimization (e.g., Bayesian optimization) and multi-scale optimization (e.g., integration of molecular sciences and process engineering). Our work extends a recently-proposed abstraction for infinite-dimensional optimization problems by capturing more general uncertainty representations. Moreover, we discuss solution paradigms for this new class of problems based on finite transformations and sampling, and identify open questions and challenges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Robustness analysis of an air heating plant and control law by using polynomial chaos

This paper presents a robustness analysis of an air heating plant with a multivariable closed-loop control law by using the polynomial chaos methodology (MPC). The plant consists of a PVC tube with a fan in the air input (that forces the air through the tube) and a mass flux sensor in the output. A heating resistance warms the air as it flows inside the tube, and a thermo-couple sensor measures the air temperature. The plant has thus two inputs (the fan's rotation intensity and heat generated by the resistance, both measured in percent of the maximum value) and two outputs (air temperature and air mass flux, also in percent of the maximal value). The mathematical model is obtained by System Identification techniques. The mass flux sensor, which is nonlinear, is linearized and the delays in the transfer functions are properly approximated by non-minimum phase transfer functions. The resulting model is transformed to a state-space model, which is used for control design purposes. The multivariable robust control design techniques used is the LQG/LTR, and the controllers are validated in simulation software and in the real plant. Finally, the MPC is applied by considering some of the system's parameters as random variables (one at a time, and the system's stochastic differential equations are solved by expanding the solution (a stochastic process) in an orthogonal basis of polynomial functions of the basic random variables. This method transforms the stochastic equations in a set of deterministic differential equations, which can be solved by traditional numerical methods (That is the MPC). Statistical data for the system (like expected values and variances) are then calculated. The effects of randomness in the parameters are evaluated in the open-loop and closed-loop pole's positions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Stochastic Modeling in a Multimaterial Continuum Mixture Shock Physics Code

Stochastic modelling approaches are presented to capture random effects at multiple time and length scales. Random processes that occur at the microscale produce nondeterministic effects at the macroscale. Here we present three stochastic modeling approaches that describe random processes at microscopic length scales and map these processes to the macroscopic length scale. The first stochastic modeling approach is based upon a particle based numerical technique to solve a Stochastic Differential Equation (SDE) using an arbitrary diffusion process to capture random processes at the microstructural level. The second approach prescribes a Probability Density Function (PDF) for the drift and diffusion of the random variable derived using the forward and backward Kolmogorov equations. This method requires mean and drift evolution PDF transport equations. The third approach is the coupling of multiple random variables which are dependent on each other. The relationship of the PDFs and a coupling function, known as a copula, produces a Joint Probability Density Function (JPDF). These stochastic modeling approaches are implemented into a Multiple Component (MC) shock physics computational code and used to model statistical fracture and reactive flow applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2012

Stringy mechanism for a small cosmological constant

Based on the probability distributions of products of random variables, we propose a simple stringy mechanism that prefers the meta-stable vacua with a small cosmological constant. We state some relevant properties of the probability distributions of functions of random variables. We then illustrate the mechanism within the flux compactification models in Type IIB string theory. As a result of the stringy dynamics, we argue that the generic probability distribution for the meta-stable vacua typically peaks with a divergent behavior at the zero value of the cosmological constant. However, its suppression in the single modulus model studied here is modest.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2013

Explaining the dark energy, baryon and dark matter coincidence via domain-dependent random densities

The dark energy, dark matter and baryon densities in the Universe are observed to be similar, with a factor of no more than 20 between the largest and smallest densities. We show that this coincidence can be understood via superhorizon domains of randomly varying densities when the baryon density at initial collapse of galaxy-forming perturbations is determined by anthropic selection. The baryon and dark matter densities are assumed to be dependent on random variables θ{sub d} and θ{sub b} according to ρ{sub dm}∝θ{sub d}{sup α} and ρ{sub b}∝θ{sub b}{sup β}, while the effectively constant dark energy density is dependent upon a random variable φ{sub Q} according to ρ{sub Q}∝φ{sub Q}{sup n}. The ratio of the baryon density to the dark energy density at initial collapse, r{sub Q}, and the baryon-to-dark matter ratio, r, are then determined purely statistically, with no dependence on the anthropically-preferred baryon density. We compute the probability distribution for r{sub Q} and r and show that the observed values of r{sub Q} and r can be naturally understood within this framework. In particular, for the case α = 2, β = 1 and n = 4, which can be physically realized via a combination of axion dark matter, Affleck-Dine baryogenesis and frozen quintessence with a φ{sub Q}{sup 4} potential, the range of r{sub Q} and r which corresponds to the observed Universe is a quite natural, with a probability which is broadly similar to other ranges of r{sub Q} and r.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

Diffusion Processes Satisfying a Conservation Law Constraint

We investigate coupled stochastic differential equations governing N non-negative continuous random variables that satisfy a conservation principle. In various fields a conservation law requires that a set of fluctuating variables be non-negative and (if appropriately normalized) sum to one. As a result, any stochastic differential equation model to be realizable must not produce events outside of the allowed sample space. We develop a set of constraints on the drift and diffusion terms of such stochastic models to ensure that both the non-negativity and the unit-sum conservation law constraint are satisfied as the variables evolve in time. We investigate the consequences of the developed constraints on the Fokker-Planck equation, the associated system of stochastic differential equations, and the evolution equations of the first four moments of the probability density function. We show that random variables, satisfying a conservation law constraint, represented by stochastic diffusion processes, must have diffusion terms that are coupled and nonlinear. The set of constraints developed enables the development of statistical representations of fluctuating variables satisfying a conservation law. We exemplify the results with the bivariate beta process and the multivariate Wright-Fisher, Dirichlet, and Lochner’s generalized Dirichlet processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Scale Mixtures of Frechet Distributions as Asymptotic Approximations of Extreme Precipitation

This paper is a further development of the results of [20] where, based on the negative binomial model for the duration of wet periods measured in days [16], an asymptotic approximation was proposed for the distribution of the maximum daily precipitation volume within a wet period. This approximation has the form of a scale mixture of the Fr´echet distribution with the gamma mixing distribution and coincides with the distribution of a positive power of a random variable having the Snedecor–Fisher distribution. Here we extend this result to the mth extremes, m ∈ ℕ, and sample quantiles. The proof of this result is based on the representation of the negative binomial distribution as a mixed geometric (and hence, mixed Poisson) distribution [17] and limit theorems for extreme order statistics in samples with random sizes having mixed Poisson distributions [10]. Some analytic properties of the obtained limit distribution are described. In particular, it is demonstrated that under certain conditions the limit distribution of the maximum precipitation is mixed exponential and hence, is infinitely divisible. It is shown that under the same conditions this limit distribution can be represented as a scale mixture of stable or Weibull or Pareto or folded normal laws. The corresponding product representations for the limit random variable can be used for its computer simulation. The results of fitting this distribution to real data are presented illustrating high adequacy of the proposed model. It is also shown that the limit distribution of sample quantiles is the well-known Student distribution. Several methods are proposed for the estimation of the parameters of the asymptotic distributions. The obtained mixture representations for the limit laws and the corresponding asymptotic approximations provide better insight into the nature of mixed probability (“Bayesian”) models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Learning planar Ising models

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

A stringy mechanism for a small cosmological constant — multi-moduli cases

Based on the properties of probability distributions of functions of random variables, we proposed earlier a simple stringy mechanism that prefers the meta-stable vacua with a small cosmological constant Λ. As an illustration of this approach, we study in this paper particularly simple but non-trivial models of the Kähler uplift in the large volume flux compactification scenario in Type IIB string theory, where all parameters introduced in the model are treated either as fixed constants motivated by physics, or as random variables with some given uniform probability distributions. We determine the value w{sub 0} of the superpotential W{sub 0} at the supersymmetric minima, and find that the resulting probability distribution P(w{sub 0}) peaks at w{sub 0} = 0; furthermore, this peaking behavior strengthens as the number of complex structure moduli increases. The resulting probability distribution P(Λ) for meta-stable vacua also peaks as Λ → 0, for both positive and negative Λ. This peaking/divergent behavior of P(Λ) strengthens as the number of moduli increases. In some scenarios for Λ > 0, the likely value of Λ decreases exponentially as the number of moduli increases. The light cosmological moduli issue accompanying a very small Λ is also mentioned.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Scaling exponents for ordered maxima

We study extreme value statistics of multiple sequences of random variables. For each sequence with N variables, independently drawn from the same distribution, the running maximum is defined as the largest variable to date. We compare the running maxima of m independent sequences and investigate the probability S N that the maxima are perfectly ordered, that is, the running maximum of the first sequence is always larger than that of the second sequence, which is always larger than the running maximum of the third sequence, and so on. The probability S N is universal: it does not depend on the distribution from which the random variables are drawn. For two sequences, S N ~N –1/2 , and in general, the decay is algebraic, S N ~N –σm , for large N. We analytically obtain the exponent σ 3 ≅1.302931 as root of a transcendental equation. Moreover, the exponents σ m grow with m, and we show that σ m ~m for large m.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

97 MATHEMATICS AND COMPUTING↗