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 163 records · Page 9

An adaptive multi-level simulation algorithm for stochastic biological systems

Discrete-state, continuous-time Markov models are widely used in the modeling of biochemical reaction networks. Their complexity often precludes analytic solution, and we rely on stochastic simulation algorithms (SSA) to estimate system statistics. The Gillespie algorithm is exact, but computationally costly as it simulates every single reaction. As such, approximate stochastic simulation algorithms such as the tau-leap algorithm are often used. Potentially computationally more efficient, the system statistics generated suffer from significant bias unless tau is relatively small, in which case the computational time can be comparable to that of the Gillespie algorithm. The multi-level method [Anderson and Higham, “Multi-level Monte Carlo for continuous time Markov chains, with applications in biochemical kinetics,” SIAM Multiscale Model. Simul. 10(1), 146–179 (2012)] tackles this problem. A base estimator is computed using many (cheap) sample paths at low accuracy. The bias inherent in this estimator is then reduced using a number of corrections. Each correction term is estimated using a collection of paired sample paths where one path of each pair is generated at a higher accuracy compared to the other (and so more expensive). By sharing random variables between these paired paths, the variance of each correction estimator can be reduced. This renders the multi-level method very efficient as only a relatively small number of paired paths are required to calculate each correction term. In the original multi-level method, each sample path is simulated using the tau-leap algorithm with a fixed value of τ. This approach can result in poor performance when the reaction activity of a system changes substantially over the timescale of interest. By introducing a novel adaptive time-stepping approach where τ is chosen according to the stochastic behaviour of each sample path, we extend the applicability of the multi-level method to such cases. We demonstrate the efficiency of our method using a number of examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Improved Discrete Least-Squares/Reduced-Basis Method for Parameterized Elliptic PDEs

It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. In particular, we consider stochastic elliptic PDEs with an affine dependence on the random variable. The goal is to recover the entire solution map from the parameter space to the finite element space. To this end, first, a reduced-basis solution using a weak greedy algorithm is constructed, then a DLS approximation is determined by evaluating the reduced-basis approximation instead of the full finite element approximation. The main advantage of the new approach is that one only need apply the DLS operator to the coefficients of the reduced-basis expansion, resulting in huge savings in both the storage of the DLS coefficients and the online cost of evaluating the DLS approximation. In addition, the recently developed quasi-optimal polynomial space is also adopted in the new approach, resulting in superior convergence rates for a wider class of problems than previous analyzed. Numerical experiments are provided that illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Experimental Nuclear Reaction Data Uncertainties: Basic Concepts and Documentation

This paper has been written to provide experimental nuclear data researchers and data compilers with practical guidance on dealing with experimental nuclear reaction data uncertainties. It outlines some of the properties of random variables as well as principles of data uncertainty estimation, and illustrates them by means of simple examples which are relevant to the field of nuclear data. Emphasis is placed on the importance of generating mathematical models (or algorithms) that can adequately represent individual experiments for the purpose of estimating uncertainties in their results. Several types of uncertainties typically encountered in nuclear data experiments are discussed. The requirements and procedures for reporting information on measurement uncertainties for neutron reaction data, so that they will be useful in practical applications, are addressed. Consideration is given to the challenges and opportunities offered by reports, conference proceedings, journal articles, and computer libraries as vehicles for reporting and documenting numerical experimental data. Finally, contemporary formats used to compile reported experimental covariance data in the widely used library EXFOR are discussed, and several samples of EXFOR files are presented to demonstrate their use.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Min-entropy and quantum key distribution: Nonzero key rates for ''small'' numbers of signals

We calculate an achievable secret key rate for quantum key distribution with a finite number of signals by evaluating the quantum conditional min-entropy explicitly. The min-entropy for a classical random variable is the negative logarithm of the maximal value in its probability distribution. The quantum conditional min-entropy can be expressed in terms of the guessing probability, which we calculate for d-dimensional systems. We compare these key rates to previous approaches using the von Neumann entropy and find nonzero key rates for a smaller number of signals. Furthermore, we improve the secret key rates by modifying the parameter estimation step. Both improvements taken together lead to nonzero key rates for only 10{sup 4}-10{sup 5} signals. An interesting conclusion can also be drawn from the additivity of the min-entropy and its relation to the guessing probability: for a set of symmetric tensor product states, the optimal minimum-error discrimination (MED) measurement is the optimal MED measurement on each subsystem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A global solution to the Schrödinger equation: From Henstock to Feynman

One of the key elements of Feynman’s formulation of non-relativistic quantum mechanics is a so-called Feynman path integral. It plays an important role in the theory, but it appears as a postulate based on intuition, rather than a well-defined object. All previous attempts to supply Feynman’s theory with rigorous mathematics underpinning, based on the physical requirements, have not been satisfactory. The difficulty comes from the need to define a measure on the infinite dimensional space of paths and to create an integral that would possess all of the properties requested by Feynman. In the present paper, we consider a new approach to defining the Feynman path integral, based on the theory developed by Muldowney [A Modern Theory of Random Variable: With Applications in Stochastic Calcolus, Financial Mathematics, and Feynman Integration (John Wiley & Sons, Inc., New Jersey, 2012)]. Muldowney uses the Henstock integration technique and deals with non-absolute integrability of the Fresnel integrals, in order to obtain a representation of the Feynman path integral as a functional. This approach offers a mathematically rigorous definition supporting Feynman’s intuitive derivations. But in his work, Muldowney gives only local in space-time solutions. A physical solution to the non-relativistic Schrödinger equation must be global, and it must be given in the form of a unitary one-parameter group in L{sup 2}(ℝ{sup n}). The purpose of this paper is to show that a system of one-dimensional local Muldowney’s solutions may be extended to yield a global solution. Moreover, the global extension can be represented by a unitary one-parameter group acting in L{sup 2}(ℝ{sup n})

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

THE EFFECTS OF VIEWING ANGLE ON THE MASS DISTRIBUTION OF EXOPLANETS

We present a mathematical method to statistically decouple the effects of unknown inclination angles on the mass distribution of exoplanets that have been discovered using radial-velocity (RV) techniques. The method is based on the distribution of the product of two random variables. Thus, if one assumes a true mass distribution, the method makes it possible to recover the observed distribution. We compare our prediction with available RV data. Assuming that the true mass function is described by a power law, the minimum mass function that we recover proves a good fit to the observed distribution at both mass ends. In particular, it provides an alternative explanation for the observed low-mass decline, usually explained as sample incompleteness. In addition, the peak observed near the low-mass end arises naturally in the predicted distribution as a consequence of imposing a low-mass cutoff in the true distribution. If the low-mass bins below 0.02 M{sub J} are complete, then the mass distribution in this regime is heavily affected by the small fraction of lowly inclined interlopers that are actually more massive companions. Finally, we also present evidence that the exoplanet mass distribution changes form toward low mass, implying that a single power law may not adequately describe the sample population.

79 ASTRONOMY AND ASTROPHYSICS↗

Counts of galaxy clusters as cosmological probes: the impact of baryonic physics

The halo mass function from N-body simulations of collisionless matter is generally used to retrieve cosmological parameters from observed counts of galaxy clusters. This neglects the observational fact that the baryonic mass fraction in clusters is a random variable that, on average, increases with the total mass (within an overdensity of 500). Considering a mock catalog that includes tens of thousands of galaxy clusters, as expected from the forthcoming generation of surveys, we show that the effect of a varying baryonic mass fraction will be observable with high statistical significance. The net effect is a change in the overall normalization of the cluster mass function and a milder modification of its shape. Our results indicate the necessity of taking into account baryonic corrections to the mass function if one wants to obtain unbiased estimates of the cosmological parameters from data of this quality. We introduce the formalism necessary to accomplish this goal. Our discussion is based on the conditional probability of finding a given value of the baryonic mass fraction for clusters of fixed total mass. Finally, we show that combining information from the cluster counts with measurements of the baryonic mass fraction in a small subsample of clusters (including only a few tens of objects) will nearly optimally constrain the cosmological parameters.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic Schrödinger evolution over piecewise enlarged filtrations

This paper constructs a nonlinear filtering framework that admits appearances of new information processes at random times by introducing piecewise enlargements of filtrations and proposes a new energy-based Schrodinger evolution expressed as a stochastic differential equation on a complex Hilbert space. Each information process is modeled as the sum of a random variable taking the eigenvalues of a Hamiltonian and an independent Brownian bridge noise. It is shown that under a piecewise enlarged filtration, the wave function is a jump-diffusion process until it collapses at some terminal time. In between discontinuities, the dynamics of the state vector are governed by different Wiener processes and diffusion coefficients. This motivates the introduction of an inclusive chain of Kolmogorov probability spaces or a *-isomorphic chain of commutative von Neumann probability spaces, on which the quantum system evolves differently based on the number of active information processes. The expectation of the Hamiltonian at a given state is the solution of a second-order nonlinear differential equation determined by one of the possible regimes that the quantum system belongs to. It is shown that the collapse rate is a submartingale with positive jumps and the Shannon entropy process is a supermartingale with expected negative jumps when passing to higher-order probability spaces. The framework is extended to the case when the Hamiltonian is modeled as a function of a set of commutative operators, where each operator is associated with a different piecewise enlarged filtration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic inverse problems: Models and metrics

In past work, we introduced model-based inverse methods, and applied them to problems in which the anomaly could be reasonably modeled by simple canonical shapes, such as rectangular solids. In these cases the parameters to be inverted would be length, width and height, as well as the occasional probe lift-off or rotation. We are now developing a formulation that allows more flexibility in modeling complex flaws. The idea consists of expanding the flaw in a sequence of basis functions, and then solving for the expansion coefficients of this sequence, which are modeled as independent random variables, uniformly distributed over their range of values. There are a number of applications of such modeling: 1. Connected cracks and multiple half-moons, which we have noted in a POD set. Ideally we would like to distinguish connected cracks from one long shallow crack. 2. Cracks of irregular profile and shape which have appeared in cold work holes during bolt-hole eddy-current inspection. One side of such cracks is much deeper than other. 3. L or C shaped crack profiles at the surface, examples of which have been seen in bolt-hole cracks. By formulating problems in a stochastic sense, we are able to leverage the stochastic global optimization algorithms in NLSE, which is resident in VIC-3D®, to answer questions of global minimization and to compute confidence bounds using the sensitivity coefficient that we get from NLSE. We will also address the issue of surrogate functions which are used during the inversion process, and how they contribute to the quality of the estimation of the bounds.

36 MATERIALS SCIENCE↗

Chandrasekhar's relation and stellar rotation in the Kepler field

According to the statistical law of large numbers, the expected mean of identically distributed random variables of a sample tends toward the actual mean as the sample increases. Under this law, it is possible to test the Chandrasekhar's relation (CR), (V) = (π/4){sup –1}(Vsin i), using a large amount of Vsin i and V data from different samples of similar stars. In this context, we conducted a statistical test to check the consistency of the CR in the Kepler field. In order to achieve this, we use three large samples of V obtained from Kepler rotation periods and a homogeneous control sample of Vsin i to overcome the scarcity of Vsin i data for stars in the Kepler field. We used the bootstrap-resampling method to estimate the mean rotations ((V) and (Vsin i)) and their corresponding confidence intervals for the stars segregated by effective temperature. Then, we compared the estimated means to check the consistency of CR, and analyzed the influence of the uncertainties in radii measurements, and possible selection effects. We found that the CR with (sin i) = π/4 is consistent with the behavior of the (V) as a function of (Vsin i) for stars from the Kepler field as there is a very good agreement between such a relation and the data.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic generation of explicit pore structures by thresholding Gaussian random fields

We provide a description and computational investigation of an efficient method to stochastically generate realistic pore structures. Smolarkiewicz and Winter introduced this specific method in pores resolving simulation of Darcy flows (Smolarkiewicz and Winter, 2010 [1]) without giving a complete formal description or analysis of the method, or indicating how to control the parameterization of the ensemble. We address both issues in this paper. The method consists of two steps. First, a realization of a correlated Gaussian field, or topography, is produced by convolving a prescribed kernel with an initial field of independent, identically distributed random variables. The intrinsic length scales of the kernel determine the correlation structure of the topography. Next, a sample pore space is generated by applying a level threshold to the Gaussian field realization: points are assigned to the void phase or the solid phase depending on whether the topography over them is above or below the threshold. Hence, the topology and geometry of the pore space depend on the form of the kernel and the level threshold. Manipulating these two user prescribed quantities allows good control of pore space observables, in particular the Minkowski functionals. Extensions of the method to generate media with multiple pore structures and preferential flow directions are also discussed. To demonstrate its usefulness, the method is used to generate a pore space with physical and hydrological properties similar to a sample of Berea sandstone. -- Graphical abstract: -- Highlights: •An efficient method to stochastically generate realistic pore structures is provided. •Samples are generated by applying a level threshold to a Gaussian field realization. •Two user prescribed quantities determine the topology and geometry of the pore space. •Multiple pore structures and preferential flow directions can be produced. •A pore space based on Berea sandstone is generated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time Series, Stochastic Processes and Completeness of Quantum Theory

Most of physical experiments are usually described as repeated measurements of some random variables. Experimental data registered by on-line computers form time series of outcomes. The frequencies of different outcomes are compared with the probabilities provided by the algorithms of quantum theory (QT). In spite of statistical predictions of QT a claim was made that it provided the most complete description of the data and of the underlying physical phenomena. This claim could be easily rejected if some fine structures, averaged out in the standard descriptive statistical analysis, were found in time series of experimental data. To search for these structures one has to use more subtle statistical tools which were developed to study time series produced by various stochastic processes. In this talk we review some of these tools. As an example we show how the standard descriptive statistical analysis of the data is unable to reveal a fine structure in a simulated sample of AR (2) stochastic process. We emphasize once again that the violation of Bell inequalities gives no information on the completeness or the non locality of QT. The appropriate way to test the completeness of quantum theory is to search for fine structures in time series of the experimental data by means of the purity tests or by studying the autocorrelation and partial autocorrelation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automatic treatment of the variance estimation bias in TRIPOLI-4 criticality calculations

The central limit (CLT) theorem States conditions under which the mean of a sufficiently large number of independent random variables, each with finite mean and variance, will be approximately normally distributed. The use of Monte Carlo transport codes, such as Tripoli4, relies on those conditions. While these are verified in protection applications (the cycles provide independent measurements of fluxes and related quantities), the hypothesis of independent estimates/cycles is broken in criticality mode. Indeed the power iteration technique used in this mode couples a generation to its progeny. Often, after what is called 'source convergence' this coupling almost disappears (the solution is closed to equilibrium) but for loosely coupled systems, such as for PWR or large nuclear cores, the equilibrium is never found, or at least may take time to reach, and the variance estimation such as allowed by the CLT is under-evaluated. In this paper we first propose, by the mean of two different methods, to evaluate the typical correlation length, as measured in cycles number, and then use this information to diagnose correlation problems and to provide an improved variance estimation. Those two methods are based on Fourier spectral decomposition and on the lag k autocorrelation calculation. A theoretical modeling of the autocorrelation function, based on Gauss-Markov stochastic processes, will also be presented. Tests will be performed with Tripoli4 on a PWR pin cell. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Uncertainty quantification for radiation measurements: Bottom-up error variance estimation using calibration information

One example of top-down uncertainty quantification (UQ) involves comparing two or more measurements on each of multiple items. One example of bottom-up UQ expresses a measurement result as a function of one or more input variables that have associated errors, such as a measured count rate, which individually (or collectively) can be evaluated for impact on the uncertainty in the resulting measured value. In practice, it is often found that top-down UQ exhibits larger error variances than bottom-up UQ because some error sources are present in the fielded assay methods used in top-down UQ that are not present (or not recognized) in the assay studies used in bottom-up UQ One would like better consistency between the two approaches in order to claim understanding of the measurement process. The purpose of this paper is to refine bottom-up uncertainty estimation by using calibration information so that if there are no unknown error sources, the refined bottom-up uncertainty estimate will agree with the top-down uncertainty estimate to within a specified tolerance. Then, in practice, if the top-down uncertainty estimate is larger than the refined bottom-up uncertainty estimate by more than the specified tolerance, there must be omitted sources of error beyond those predicted from calibration uncertainty. The paper develops a refined bottom-up uncertainty approach for four cases of simple linear calibration: (1) inverse regression with negligible error in predictors, (2) inverse regression with non negligible error in predictors, (3) classical regression followed by inversion with negligible error in predictors, and (4) classical regression followed by inversion with non-negligible errors in predictors. Our illustrations are of general interest, but are drawn from our experience with nuclear material assay by non-destructive assay. The main example we use is gamma spectroscopy that applies the enrichment meter principle. Previous papers that ignore error in predictors have shown a tendency for inverse regression to have lower error variance than classical regression followed by inversion. Our paper supports that tendency both with and without error in predictors. Furthermore, the paper shows that calibration parameter estimates using error in predictor methods perform worse than without using error in predictor methods in the case of inverse regression, but perform better than without using error in predictor methods in the case of classical regression followed by inversion. Both inverse and classical regression involve the ratio of dependent random variables; therefore, the assumed error distribution(s) will matter in parameter estimation and in uncertainty calculations. Mainly for that reason, calibration using a single predictor is distinct from simple regression, and it has not been thoroughly treated in the literature, nor in the ISO Guide to the Expression of Uncertainty in Measurements (GUM). This refined approach is based on simulation, because we illustrate that analytical approximations are not adequate when there are, for example, 10 or fewer calibration measurements, which is common in calibration applications, each consisting of measured responses from known quantities.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The analysis of space-time structure in QCD vacuum II: Dynamics of polarization and absolute X-distribution

Highlights: > We propose a method to compute the polarization for a multi-dimensional random distribution. > We apply the method to the eigenemodes of the Dirac operator in pure glue QCD. > We compute the chiral polarization for these modes and study its scale dependence. > We find that in a finite volume there is a scale where the polarization tendency changes. > We study the continuum limit of this chiral polarization scale. - Abstract: We propose a framework for quantitative evaluation of dynamical tendency for polarization in an arbitrary random variable that can be decomposed into a pair of orthogonal subspaces. The method uses measures based on comparisons of given dynamics to its counterpart with statistically independent components. The formalism of previously considered X-distributions is used to express the aforementioned comparisons, in effect putting the former approach on solid footing. Our analysis leads to the definition of a suitable correlation coefficient with clear statistical meaning. We apply the method to the dynamics induced by pure-glue lattice QCD in local left-right components of overlap Dirac eigenmodes. It is found that, in finite physical volume, there exists a non-zero physical scale in the spectrum of eigenvalues such that eigenmodes at smaller (fixed) eigenvalues exhibit convex X-distribution (positive correlation), while at larger eigenvalues the distribution is concave (negative correlation). This chiral polarization scale thus separates a regime where dynamics enhances chirality relative to statistical independence from a regime where it suppresses it, and gives an objective definition to the notion of 'low' and 'high' Dirac eigenmode. We propose to investigate whether the polarization scale remains non-zero in the infinite volume limit, in which case it would represent a new kind of low energy scale in QCD.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

COSMIC MICROWAVE BACKGROUND LIKELIHOOD APPROXIMATION FOR BANDED PROBABILITY DISTRIBUTIONS

We investigate sets of random variables that can be arranged sequentially such that a given variable only depends conditionally on its immediate predecessor. For such sets, we show that the full joint probability distribution may be expressed exclusively in terms of uni- and bivariate marginals. Under the assumption that the cosmic microwave background (CMB) power spectrum likelihood only exhibits correlations within a banded multipole range, Δl{sub C}, we apply this expression to two outstanding problems in CMB likelihood analysis. First, we derive a statistically well-defined hybrid likelihood estimator, merging two independent (e.g., low- and high-l) likelihoods into a single expression that properly accounts for correlations between the two. Applying this expression to the Wilkinson Microwave Anisotropy Probe (WMAP) likelihood, we verify that the effect of correlations on cosmological parameters in the transition region is negligible in terms of cosmological parameters for WMAP; the largest relative shift seen for any parameter is 0.06σ. However, because this may not hold for other experimental setups (e.g., for different instrumental noise properties or analysis masks), but must rather be verified on a case-by-case basis, we recommend our new hybridization scheme for future experiments for statistical self-consistency reasons. Second, we use the same expression to improve the convergence rate of the Blackwell-Rao likelihood estimator, reducing the required number of Monte Carlo samples by several orders of magnitude, and thereby extend it to high-l applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantification of modeling uncertainty in the Rayleigh damping model

Understanding and accurately characterizing energy dissipation mechanisms in civil structures during earthquakes is an important element of seismic assessment and design. The most commonly used model is attributed to Rayleigh. This paper proposes a systematic approach to quantify the uncertainty associated with Rayleigh's damping model. Bayesian calibration with embedded model error is employed to treat the coefficients of the Rayleigh model as random variables using modal damping ratios. Through a numerical example, we illustrate how this approach works and how the calibrated model can address modeling uncertainty associated with the Rayleigh damping model.

42 ENGINEERING↗

Order priors for Bayesian network discovery with an application to malware phylogeny

Here, Bayesian networks have been used extensively to model and discover dependency relationships among sets of random variables. We learn Bayesian network structure with a combination of human knowledge about the partial ordering of variables and statistical inference of conditional dependencies from observed data. Our approach leverages complementary information from human knowledge and inference from observed data to produce networks that reflect human beliefs about the system as well as to fit the observed data. Applying prior beliefs about partial orderings of variables is an approach distinctly different from existing methods that incorporate prior beliefs about direct dependencies (or edges) in a Bayesian network. We provide an efficient implementation of the partial-order prior in a Bayesian structure discovery learning algorithm, as well as an edge prior, showing that both priors meet the local modularity requirement necessary for an efficient Bayesian discovery algorithm. In benchmark studies, the partial-order prior improves the accuracy of Bayesian network structure learning as well as the edge prior, even though order priors are more general. Our primary motivation is in characterizing the evolution of families of malware to aid cyber security analysts. For the problem of malware phylogeny discovery, we find that our algorithm, compared to existing malware phylogeny algorithms, more accurately discovers true dependencies that are missed by other algorithms.

97 MATHEMATICS AND COMPUTING↗