Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random walk”

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

Field lines and magnetic surfaces in a two-component slab/2D model of interplanetary magnetic fluctuations

A two-component model for the spectrum of interplanetary magnetic fluctuations was proposed on the basis of ISEE observations, and has found an intriguing level of application in other solar wind studies. The model fluctuations consist of a fraction of 'slab' fluctuations, varying only in the direction parallel to the locally uniform mean magnetic field B(0) and a complement of 2D (two-dimensional) fluctuations that vary in the directions transverse to B(0). We have developed an spectral method computational algorithm for computing the magnetic flux surfaces (flux tubes) associated with the composite model, based upon a precise analogy with equations for ideal transport of a passive scalar in planar two dimensional geometry. Visualization of various composite models will be presented, including the 80 percent 2D/ 20 percent slab model with delta B/B(0) approximately equals 1 and a minus 5/3 spectral law, that is thought to approximately represent a snapshot of solar wind turbulence. Characteristically, the visualizations show that flux tubes, even when defined as regular on some plane, shred and disperse rapidly as they are viewed along the parallel direction. This diffusive process, which generalizes the standard picture of field line random walk, will be discussed in detail. Evidently, the traditional picture that flux tubes randomize like strands of spaghetti with a uniform tangle along the axial direction is in need of modification.

Matthaeus, W. H.↗

Stationary Distribution of a Stochastic Process

We find a stationary distribution of a stochastic process with delay at the origin. The trajectories of the process have linear growth and random jumps at random times. We use known results for regenerative processes and factorization technique for the study in boundary crossing problems for random walks.

97 MATHEMATICS AND COMPUTING↗

A simple coin for a 2d entangled walk

We analyze the effect of a simple coin operator, built out of Bell pairs, in a 2d Discrete Quantum Random Walk (DQRW) problem. The specific form of the coin enables us to find analytical and closed form solutions to the recursion relations of the DQRW. The coin induces entanglement between the spin and position degrees of freedom, which oscillates with time and reaches a constant value asymptotically. We probe the entangling properties of the coin operator further, by two different measures. First, by integrating over the space of initial tensor product states, we determine the Entangling Power of the coin operator. Secondly, we compute the Generalized Relative Rényi Entropy between the corresponding density matrices for the entangled state and the initial pure unentangled state. Both the Entangling Power and Generalized Relative Rényi Entropy behaves similar to the entanglement with time. Finally, in the continuum limit, the specific coin operator reduces the 2d DQRW into two 1d massive fermions coupled to synthetic gauge fields, where both the mass term and the gauge fields are built out of the coin parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗

Cyclotomic Shuffles

Analogues of 1-shuffle elements for complex reflection groups of type G(m,1,n) are introduced. A geometric interpretation for G(m,1,n) in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and their multiplicities, of the 1-shuffle element in the algebra of the group G(m,1,n). Considering shuffling as a random walk on the group G(m,1,n), we estimate the rate of convergence to randomness of the corresponding Markov chain. We report on the spectrum of the 1-shuffle analogue in the cyclotomic Hecke algebra H(m,1,n) for m=2 and small n.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Simulation of Inflated Pahoehoe Lava Flows

A new stochastic model simulates late-stage pahoehoe lobes where random processes dominate emplacement. The model prescribes probabilistic rules for determining where and when parcels of lava move within the lobe. Unlike a classical Brownian motion random walk, the model allows individual parcels to remain dormant, but fluid, for multiple time steps. The randomness of parcel volume transfers within the lobe interior as well as at the margins qualitatively reflects inflation processes observed in the field. The fraction of inflated volume to total volume increases with the total volume, with greater than 75% of the lobe volume contributed through inflation for typical lobes. The influence on planform shape and topographic cross-sectional profiles of total volume, source area and shape, topographic confinement, and sequential breakouts at the lobe margins, are all explored with the stochastic model. Each of these factors influences the overall lobe thickness and width. The model provides a means for assessing the relative importance of these processes through comparisons with field data. For the first time, Gaussian and parabolic functions are quantitatively fit to field measurements of pahoehoe lobes. Both functional forms provide adequate description of the cross-sectional flow shapes. When comparing simulated lobes to field data, sequential breakouts at the lobe margins are found to be an important process controlling the final topographic distribution of observed pahoehoe lobes.

modeling↗

Universal method for the optimization of HDC coating uniformity on non-planar, non-stationary substrates for inertial confinement fusion targets

The thickness uniformity of chemical vapor deposited (CVD) diamond coatings on non-planar, non-stationary substrates depends on both the intrinsic instantaneous coating thickness distribution (ICTD) of the coating conditions used and, if applicable, on the frequency of substrate reorientation. While important for many CVD diamond applications, the relative impact of the ICTD and substrate reorientation on the coating thickness uniformity has not been studied. In this work, we systematically investigate the effect of these factors for microwave-plasma chemical vapor deposition (MPCVD) of diamond (referred to as high density carbon (HDC) in the inertial confinement fusion (ICF) community) coatings on spherical, rolling substrates. This coating technique is used to fabricate capsules for ICF experiments, which require extreme coating uniformity with <0.3 % thickness variation (so-called Mode 1 or M1) to ensure symmetric compression of imploding targets. To extract the otherwise unobservable reorientation timescale (Δt), Monte Carlo simulations were performed using experimental ICTD data as input. This combined approach confirms scaling relationships between the substrate reorientation timescale as well as coating thickness and coating uniformity, as expected from a 3D random walk. Simulations confirm that M1 is Rayleigh-distributed and scales as (Δt) 1/2 , consistent with the randomization of two angles that determine orientation of a sphere. We also demonstrate that, under the conditions studied, Δt is the dominant factor in determining thickness uniformity while the intrinsic ICTD has minimal impact. Finally, experiments show that Δt can be affected by total batch size under constant agitation conditions due to space constraints that limit the capsule reorientation kinetics. In conclusion, this study highlights the utility of a combined experiment-simulation approach as a general methodology for understanding and improving coating uniformity on non-planar, non-stationary substrates.

Capsule↗

Evaluating disease surveillance strategies for early outbreak detection in contact networks with varying community structure

Disease surveillance systems allow public health agencies to respond to emerging diseases before they become widespread. Developing such systems requires identifying optimal ways to monitor in the context of an epidemic outbreak; this problem is known as sensor selection. Contact networks represent the dynamics of interaction in a population and are used to model how a disease spreads in a population and to explore strategies of sensor selection. We evaluated five sensor selection strategies on their ability to provide an early warning of a COVID-like outbreak in synthetic contact networks encapsulated in four network scenarios. Three of these scenarios assessed different aspects of community structure. The fourth scenario employed a contact network representing the population and interactions of 6.8 million people in New York City, constructed from an agent-based simulation using census and transportation data. This scenario exemplifies how sensor selection strategies may perform in a real-world, urban context. Our findings suggest that the choice of the optimal strategy depends heavily on the community structure of the network. Strategies that select highly connected nodes or maximize network coverage are the optimal surveillance strategy for outbreak detection in many network community structures. However, a naive implementation of these strategies may fail to provide an early warning at all—including in the New York City scenario. Moreover, these methods are impractical for real-world use as they require knowledge of the underlying contact network. Instead, a selection strategy that starts with a set of random nodes and then performs a random walk through a chain of neighbors reliably provides early warnings without requiring prior knowledge of the network. We find this method, called “random chain”, to be the most pragmatic for implementation in a real-world disease surveillance context.

60 APPLIED LIFE SCIENCES↗

Turbulent-like flows in quasi two-dimensional dense suspensions of motile colloids

Dense bacterial suspensions exhibit turbulent-like flows at low Reynolds numbers, driven by the activity of the microswimmers. In this study, we develop a model system to examine these dynamics using motile colloids that mimic bacterial locomotion. The colloids are powered by the Quincke instability, which causes them to spontaneously roll in a random-walk pattern when exposed to a square-wave electric field. We experimentally investigate the flow dynamics in dense suspensions of these Quincke random walkers under quasi two-dimensional conditions, where the particle size is comparable to the gap between the electrodes. The results suggest a scaling regime in the energy spectrum ∼k −4 at high wavenumbers, observed consistently across activity levels and particle concentrations. We observe that velocity time correlations decay within a single period of the square-wave field, yet an anti-correlation appears between successive field applications, indicative of a dynamic structural memory of the ensemble.

Luo, Rui [Northwestern Univ., Evanston, IL (United↗

Tortuosity of lightning return stroke channels

Data obtained from photographs of lightning are presented on the tortuosity of return stroke channels. The data were obtained by making piecewise linear fits to the channels, and recording the cartesian coordinates of the ends of each linear segment. The mean change between ends of the segments was nearly zero in the horizontal direction and was about eight meters in the vertical direction. Histograms of these changes are presented. These data were used to create model lightning channels and to predict the electric fields radiated during return strokes. This was done using a computer generated random walk in which linear segments were placed end-to-end to form a piecewise linear representation of the channel. The computer selected random numbers for the ends of the segments assuming a normal distribution with the measured statistics. Once the channels were simulated, the electric fields radiated during a return stroke were predicted using a transmission line model on each segment. It was found that realistic channels are obtained with this procedure, but only if the model includes two scales of tortuosity: fine scale irregularities corresponding to the local channel tortuosity which are superimposed on large scale horizontal drifts. The two scales of tortuosity are also necessary to obtain agreement between the electric fields computed mathematically from the simulated channels and the electric fields radiated from real return strokes. Without large scale drifts, the computed electric fields do not have the undulations characteristics of the data.

Levine, D. M.↗

Monte Carlo predictions of DNA fragment-size distributions for large sizes after HZE particle irradiation

DSBs (double-strand breaks) produced by densely ionizing space radiation are not located randomly in the genome: recent data indicate DSB clustering along chromosomes. DSB clustering at large scales, from >100 Mbp down to approximately 2 kbp, is modeled using a Monte-Carlo algorithm. A random-walk model of chromatin is combined with a track model, that predicts the radial distribution of energy from an ion, and the RLC (randomly-located-clusters) formalism, in software called DNAbreak. This model generalizes the random-breakage model, whose broken-stick fragment-size distribution is applicable to low-LET radiation. DSB induction due to track interaction with the DNA volume depends on the radiation quality parameter Q. This dose-independent parameter depends only weakly on LET. Multi-track, high-dose effects depend on the cluster intensity parameter lambda, proportional to fluence as defined by the RLC formalism. After lambda is determined by a numerical experiment, the model reduces to one adjustable parameter Q. The best numerical fits to the experimental data, determining Q, are obtained. The knowledge of lambda and Q allows us to give biophysically based extrapolations of high-dose DNA fragment-size data to low doses or to high LETs.

NASA Center JSC↗

Generalized Levy-walk model for DNA nucleotide sequences

We propose a generalized Levy walk to model fractal landscapes observed in noncoding DNA sequences. We find that this model provides a very close approximation to the empirical data and explains a number of statistical properties of genomic DNA sequences such as the distribution of strand-biased regions (those with an excess of one type of nucleotide) as well as local changes in the slope of the correlation exponent alpha. The generalized Levy-walk model simultaneously accounts for the long-range correlations in noncoding DNA sequences and for the apparently paradoxical finding of long subregions of biased random walks (length lj) within these correlated sequences. In the generalized Levy-walk model, the lj are chosen from a power-law distribution P(lj) varies as lj(-mu). The correlation exponent alpha is related to mu through alpha = 2-mu/2 if 2 < mu < 3. The model is consistent with the finding of "repetitive elements" of variable length interspersed within noncoding DNA.

NASA Discipline Number 14-10↗

Stochastic models for atomic clocks

For the atomic clocks used in the National Bureau of Standards Time Scales, an adequate model is the superposition of white FM, random walk FM, and linear frequency drift for times longer than about one minute. The model was tested on several clocks using maximum likelihood techniques for parameter estimation and the residuals were acceptably random. Conventional diagnostics indicate that additional model elements contribute no significant improvement to the model even at the expense of the added model complexity.

Barnes, J. A.↗

Channeled propagation of solar particles

Bartley (1966) and McCracken and Ness (1966) identified bundles of interplanetary magnetic field (IMF) lines that differed in direction from the interplanetary field lines in which they were imbedded. These bundles, called filaments differed in direction by as much as several tens of degrees from the surrounding field. The filaments werre first noticed due to the large and sudden change in flow direction of highly anisotropic solar flare protons in the energy range 1 to 13 MeV. Passage of the filaments over the spacecraft required a few hours, implying a diameter for the filaments of approximately 3 x 10 to the 6th power km at a distance of 1 AU from the Sun. In 1968, Jakipii and Parker used Leighton's hypothesis of random walk of magnetic field lines associated with granules and supergranules (1964) to develop a picture of an interplanetary medium composed of a tangle of field lines frozen into the solar wind, but whose feet were carried about by the random motions at the solar surface. Jakipii and Parker noted that using a correlation length of 15,000 km - about the radius of a supergranule - the magnetic structure would be 3 x 10 to the 6th power km in size of the filaments as determined by Bartley and McCracken and Ness. These workers did not find changes in the solar particle intensity, anisotropy ratio or energy spectrum as the spacecraft entered the filament.

Anderson, K. A.↗

The color of magnetic monopole noise

We relate the anomaly in the noise color of spin ice to the emergent nature of its magnetic monopoles and their random walk. Monopoles are quasi-particles, and the spin vacuum in which they wander is not structureless. Rather, the underlying spin ensemble filters the thermal white noise, leading to non-trivial coevolution. Thus, monopoles can be considered as "dressed" random walkers, activated by a non-trivial stochastic noise that subsumes mutual interactions and the coevolution of their spin vacuum. From this, we suggest that recent experimental results are interpretable in terms of monopole subdiffusion. Furthermore, we then conjecture relations between the color of the noise and other observables, such as relaxation time, monopole density, the dynamic exponent, and the order of the annihilation reaction, which suggests to us the introduction of spin-ice-specific critical exponents in a neighborhood of the ice manifold criticality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗