SEARCH · Search NASA
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.
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer.
We analyze the dynamics of the Sisyphus random walk model, a discrete Markov chain in which the walkers may randomly return to their initial position x{sub 0}. In particular, we present a remarkably compact derivation of the time-dependent survival probability function S(t;x{sub 0}) which characterizes the random walkers in the presence of an absorbing trap at the origin. The survival probabilities are expressed in a compact mathematical form in terms of the x{sub 0}-generalized Fibonacci-like numbers G{sub t}{sup (x{sub 0})}. Interestingly, it is proved that, as opposed to the standard random walk model in which the survival probabilities depend linearly on the initial distance x{sub 0} of the walkers from the trap and decay asymptotically as an inverse power of the time, in the Sisyphus random walk model the asymptotic survival probabilities decay exponentially in time and are characterized by a non-trivial (non-linear) dependence on the initial gap x{sub 0} from the absorbing trap. We use the analytically derived results in order to analyze the underlying dynamics of the ‘survival-game’, a highly risky investment strategy in which non-absorbed agents receive a reward P(t) which gradually increases in time.
In this study, a one-dimensional stochastic model based on the random walk approach is used to simulate cyclic voltammetry. The model takes into account mass transport, kinetics of the redox reactions, adsorption effects and changes in the morphology of the electrode. The model is shown to display the expected behavior. Furthermore, the model shows consistent qualitative agreement with a finite difference solution. This approach allows for an understanding of phenomena on a microscopic level and may be useful for analyzing qualitative features observed in experimentally recorded signals.
One of the longstanding open problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. Here, we propose automated model order selection (AMOS), a solution to the SGC model selection problem under a random interconnection model (RIM) using a novel selection criterion that is based on an asymptotic phase transition analysis. AMOS can more generally be applied to discovering hidden block diagonal structure in symmetric non-negative matrices. Numerical experiments on simulated graphs validate the phase transition analysis, and real-world network data is used to validate the performance of the proposed model selection procedure.
Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.
In this paper we explain the relation between the free energy of the SYK model for N Majorana fermions with a random q-body interaction and the moments of its spectral density. The high temperature expansion of the free energy gives the cumulants of the spectral density. Using that the cumulants are extensive we find the p dependence of the 1/N 2 correction of the 2p-th moments obtained in [1]. Conversely, the 1/N 2 corrections to the moments give the correction (even q) to the β 6 coefficient of the high temperature expansion of the free energy for arbitrary q. Our result agrees with the 1/q 3 correction obtained by Tarnopolsky using a mean field expansion. These considerations also lead to a more powerful method for solving the moment problem and intersection-graph enumeration problems. We take advantage of this and push the moment calculation to 1/N 3 order and find surprisingly simple enumeration identities for intersection graphs. The 1/N 3 corrections to the moments, give corrections to the β 8 coefficient (for even q) of the high temperature expansion of the free energy which have not been calculated before. Results for odd q, where the SYK “Hamiltonian” is the supercharge of a supersymmetric theory are discussed as well.
In this work, we introduce a modified Implicit Monte Carlo (IMC) Random Walk (RW) algorithm, which increases simulation efficiency for multigroup radiative transfer problems with strongly frequency-dependent opacities. To date, the RW method has only been implemented in “fully-gray” form; that is, the multigroup IMC opacities are group-collapsed over the full frequency domain of the problem to obtain a gray diffusion problem for RW. This formulation works well for problems with large spatial cells and/or opacities that are weakly dependent on frequency; however, the efficiency of the RW method degrades when the spatial cells are thin or the opacities are a strong function of frequency. To address this inefficiency, we introduce a RW frequency group cutoff in each spatial cell, which divides the frequency domain into optically thick and optically thin components. In the modified algorithm, opacities for the RW diffusion problem are obtained by group-collapsing IMC opacities below the frequency group cutoff. Particles with frequencies above the cutoff are transported via standard IMC, while particles below the cutoff are eligible for RW. This greatly increases the total number of RW steps taken per IMC time-step, which in turn improves the efficiency of the simulation. We refer to this new method as Partially-Gray Random Walk (PGRW). We present numerical results for several multigroup radiative transfer problems, which show that the PGRW method is significantly more efficient than standard RW for several problems of interest. In general, PGRW decreases runtimes by a factor of ∼2–4 compared to standard RW, and a factor of ∼3–6 compared to standard IMC. While PGRW is slower than frequency-dependent Discrete Diffusion Monte Carlo (DDMC), it is also easier to adapt to unstructured meshes and can be used in spatial cells where DDMC is not applicable. This suggests that it may be optimal to employ both DDMC and PGRW in a single simulation.
In 2017, the largest recorded dengue outbreak in Sri Lanka’s history occurred. Since then, dengue has continued to threaten national health across Sri Lanka. The development of an effective Early Warning System (EWS) for dengue outbreaks is essential for Sri Lanka’s Ministry of Health to take preventative measures. We propose the use of Graph Neural Networks as EWS. Using earth observational data from NASAs global satellites and dengue incidence data from Sri Lanka s Ministry of Health, we developed a series of traditional and graph representation EWS to forecast Dengue cases across Sri Lanka’s 25 districts between 2013 and 2022. We demonstrate empirically that Graph Neural Networks which incorporate spatiotemporal relations significantly outperform traditional EWS such as Autoregressive Integrated Moving Average (ARIMA), Random Forest, and Long Short-Term Memory (LSTM). Our source code is available on GitHub and will be provided in the final submission.
WPGNN is the graph neural network machine learning based surrogate model and software that provides a streamlined approximation of wind plant wake models. It can rapidly estimate the energy production of the plant and turbines for any arbitrarily sized wind plant and layout under any inflow condition. Associated tools include graphing and visualization capabilities as well as a wind plant generator capable of creating randomized realizations of canonical wind plant layouts. The WPGNN architecture and application is extendable to multiple wake models, turbine technologies and features, and supports downstream optimizations of wind plant layouts and control strategies. In addition to the WPGNN, we include the code for the plant layout generator (PLayGen) playgen.py. This generator can produce random realizations of realistic wind plant layouts from one of the four canonical styles: cluster, single string, multiple string, or parallel string. The PLayGen_demo.ipynb notebook provides a demonstration of how to use the generator tool.
Abstract. A new test statistic for climate model evaluation has been developed that potentially mitigates some of the limitations that exist for observing and representing field and space dependencies of climate phenomena. Traditionally such dependencies have been ignored when climate models have been evaluated against observational data, which makes it difficult to assess whether any given model is simulating observed climate for the right reasons. The new statistic uses Gaussian Markov random fields for estimating field and space dependencies within a first-order grid point neighborhood structure. We illustrate the ability of Gaussian Markov random fields to represent empirical estimates of field and space covariances using "witch hat" graphs. We further use the new statistic to evaluate the tropical response of a climate model (CAM3.1) to changes in two parameters important to its representation of cloud and precipitation physics. Overall, the inclusion of dependency information did not alter significantly the recognition of those regions of parameter space that best approximated observations. However, there were some qualitative differences in the shape of the response surface that suggest how such a measure could affect estimates of model uncertainty.
Flowgraph techniques for closed systems, discussing properties, approximation method, topology equation, frequency response, constraints, oscillatory and stochastic processes, etc
A computer-controlled data acquisition system has been developed for the 40x80-foot wind tunnel at Ames Research Center. The system, consisting of several small onboard units installed in the model and a data-managing, data-displaying ground station, is capable of sampling up to 256 channels of raw data at a total sample rate of 128,000 samples/sec. Complete signal conditioning is contained within the on-board units. The sampling sequence and channel gain selection is completely random and under total control of the ground station. Outputs include a bar-graph display, digital-to-analog converters, and digital interface to the tunnel's central computer, an SEL 840MP. The system can be run stand-alone or under the control of the SEL 840MP.
Collisional particle transport in stochastic magnetic fields is studied using a semi-analytical method. The aim is to determine the influence of the nonlinear effects that occur in the magnetic field line random walk on particle transport. We show that particle transport coefficients can be strongly influenced by the magnetic line trapping. The conditions that correspond to these nonlinear regimes are determined. We also analyze the effects produced by the space variation of the large-scale magnetic field. We show that an average drift is generated by the gradient of the magnetic field, which strongly increases and reverses its orientation in the nonlinear regime.
In this work, we develop a probabilistic estimator for the voltage-to-current map arising in electrical impedance tomography. This novel so-called partially reflecting random walk on spheres estimator enables Monte Carlo methods to compute the voltage-to-current map in an embarrassingly parallel manner, which is an important issue with regard to the corresponding inverse problem. Our method uses the well-known random walk on spheres algorithm inside subdomains where the diffusion coefficient is constant and employs replacement techniques motivated by finite difference discretization to deal with both mixed boundary conditions and interface transmission conditions. We analyze the global bias and the variance of the new estimator both theoretically and experimentally. Subsequently, the variance of the new estimator is considerably reduced via a novel control variate conditional sampling technique which yields a highly efficient hybrid forward solver coupling probabilistic and deterministic algorithms.
We perform a multi-wavelength polarimetric study of the quasar CTA 102 during an extraordinarily bright γ-ray outburst detected by the Fermi Large Area Telescope in 2012 September–October when the source reached a flux of F{sub >100} {sub MeV} = 5.2 ± 0.4 × 10{sup −6} photons cm{sup −2} s{sup −1}. At the same time, the source displayed an unprecedented optical and near-infrared (near-IR) outburst. We study the evolution of the parsec-scale jet with ultra-high angular resolution through a sequence of 80 total and polarized intensity Very Long Baseline Array images at 43 GHz, covering the observing period from 2007 June to 2014 June. We find that the γ-ray outburst is coincident with flares at all the other frequencies and is related to the passage of a new superluminal knot through the radio core. The powerful γ-ray emission is associated with a change in direction of the jet, which became oriented more closely to our line of sight (θ ∼ 1.°2) during the ejection of the knot and the γ-ray outburst. During the flare, the optical polarized emission displays intra-day variability and a clear clockwise rotation of electric vector position angles (EVPAs), which we associate with the path followed by the knot as it moves along helical magnetic field lines, although a random walk of the EVPA caused by a turbulent magnetic field cannot be ruled out. We locate the γ-ray outburst a short distance downstream of the radio core, parsecs from the black hole. This suggests that synchrotron self-Compton scattering of NIR to ultraviolet photons is the probable mechanism for the γ-ray production.
We consider a random walk in dimension d≥1 in a dynamic random environment evolving as an interchange process with rate γ>0. We prove that, if we choose γ large enough, almost surely the empirical velocity of the walker X{sub t}/t eventually lies in an arbitrary small ball around the annealed drift. This statement is thus a perturbation of the case γ=+∞ where the environment is refreshed between each step of the walker. We extend three-way part of the results of Huveneers and Simenhaus (Electron J Probab 20(105):42, 2015), where the environment was given by the 1-dimensional exclusion process: (i) We deal with any dimension d≥1; (ii) We treat the much more general interchange process, where each particle carries a transition vector chosen according to an arbitrary law μ; (iii) We show that X{sub t}/t is not only in the same direction of the annealed drift, but that it is also close to it.
Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.
Neuromorphic computing has many promises in the future of computing due to its energy efficient and scalable implementation. Here we extend a neural algorithm that is able to solve the diffusion equation PDE by implementing random walks on neuromorphic hardware. Additionally, we introduce four random walk applications that use this spiking neural algorithm. The four applications currently implemented are: generating a random walk to replicate an image, finding a path between two nodes, finding triangles in a graph, and partitioning a graph into two sections. We then made these four applications available to be implemented on software using a graphical user interface (GUI).