Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomization”

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 253 records · Page 14

On Edge Exchangeable Random Graphs

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields convergence to a non-integrable generalized graphon defined on (0,∞).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299–2361, 2012). It was proved that when the degrees obey a power law with exponent τ∈(3,4), the sequence of clusters ordered in decreasing size and multiplied through by n{sup −(τ−2)/(τ−1)} converges as n→∞ to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237–269, 2001) for the Erdős–Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

Localization of disordered bosons and magnets in random fields

We study localization properties of disordered bosons and spins in random fields at zero temperature. We focus on two representatives of different symmetry classes, hard-core bosons (XY magnets) and Ising magnets in random transverse fields, and contrast their physical properties. We describe localization properties using a locator expansion on general lattices. For 1d Ising chains, we find non-analytic behavior of the localization length as a function of energy at ω=0, ξ{sup −1}(ω)=ξ{sup −1}(0)+A|ω|{sup α}, with α vanishing at criticality. This contrasts with the much smoother behavior predicted for XY magnets. We use these results to approach the ordering transition on Bethe lattices of large connectivity K, which mimic the limit of high dimensionality. In both models, in the paramagnetic phase with uniform disorder, the localization length is found to have a local maximum at ω=0. For the Ising model, we find activated scaling at the phase transition, in agreement with infinite randomness studies. In the Ising model long range order is found to arise due to a delocalization and condensation initiated at ω=0, without a closing mobility gap. We find that Ising systems establish order on much sparser (fractal) subgraphs than XY models. Possible implications of these results for finite-dimensional systems are discussed. -- Highlights: •Study of localization properties of disordered bosons and spins in random fields. •Comparison between XY magnets (hard-core bosons) and Ising magnets. •Analysis of the nature of the magnetic transition in strong quenched disorder. •Ising magnets: activated scaling, no closing mobility gap at the transition. •Ising order emerges on sparser (fractal) support than XY order.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Benford’s law and continuous dependent random variables

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11% of the time, as one would expect if all digits were equally likely, but rather 30%. This phenomenon is known as Benford’s Law. Analyzing which datasets adhere to Benford’s Law and how quickly Benford behavior sets in are the two most important problems in the field. Most previous work studied systems of independent random variables, and relied on the independence in their analyses. Inspired by natural processes such as particle decay, we study the dependent random variables that emerge from models of decomposition of conserved quantities. We prove that in many instances the distribution of lengths of the resulting pieces converges to Benford behavior as the number of divisions grow, and give several conjectures for other fragmentation processes. The main difficulty is that the resulting random variables are dependent. We handle this by using tools from Fourier analysis and irrationality exponents to obtain quantified convergence rates as well as introducing and developing techniques to measure and control the dependencies. The construction of these tools is one of the major motivations of this work, as our approach can be applied to many other dependent systems. As an example, we show that the n! entries in the determinant expansions of n×n matrices with entries independently drawn from nice random variables converges to Benford’s Law.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parametric models for samples of random functions

A new class of parametric models, referred to as sample parametric models, is developed for random elements that match sample rather than the first two moments and/or other global properties of these elements. The models can be used to characterize, e.g., material properties at small scale in which case their samples represent microstructures of material specimens selected at random from a population. The samples of the proposed models are elements of finite-dimensional vector spaces spanned by samples, eigenfunctions of Karhunen–Loève (KL) representations, or modes of singular value decompositions (SVDs). The implementation of sample parametric models requires knowledge of the probability laws of target random elements. Numerical examples including stochastic processes and random fields are used to demonstrate the construction of sample parametric models, assess their accuracy, and illustrate how these models can be used to solve efficiently stochastic equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Partial transpose of random quantum states: Exact formulas and meanders

We investigate the asymptotic behavior of the empirical eigenvalues distribution of the partial transpose of a random quantum state. The limiting distribution was previously investigated via Wishart random matrices indirectly (by approximating the matrix of trace 1 by the Wishart matrix of random trace) and shown to be the semicircular distribution or the free difference of two free Poisson distributions, depending on how dimensions of the concerned spaces grow. Our use of Wishart matrices gives exact combinatorial formulas for the moments of the partial transpose of the random state. We find three natural asymptotic regimes in terms of geodesics on the permutation groups. Two of them correspond to the above two cases; the third one turns out to be a new matrix model for the meander polynomials. Moreover, we prove the convergence to the semicircular distribution together with its extreme eigenvalues under weaker assumptions, and show large deviation bound for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nonlocal operators, parabolic-type equations, and ultrametric random walks

In this article, we introduce a new type of nonlocal operators and study the Cauchy problem for certain parabolic-type pseudodifferential equations naturally associated to these operators. Some of these equations are the p-adic master equations of certain models of complex systems introduced by Avetisov, V. A. and Bikulov, A. Kh., “On the ultrametricity of the fluctuation dynamicmobility of protein molecules,” Proc. Steklov Inst. Math. 265(1), 75–81 (2009) [Tr. Mat. Inst. Steklova 265, 82–89 (2009) (Izbrannye Voprosy Matematicheskoy Fiziki i p-adicheskogo Analiza) (in Russian)]; Avetisov, V. A., Bikulov, A. Kh., and Zubarev, A. P., “First passage time distribution and the number of returns for ultrametric random walks,” J. Phys. A 42(8), 085003 (2009); Avetisov, V. A., Bikulov, A. Kh., and Osipov, V. A., “p-adic models of ultrametric diffusion in the conformational dynamics of macromolecules,” Proc. Steklov Inst. Math. 245(2), 48–57 (2004) [Tr. Mat. Inst. Steklova 245, 55–64 (2004) (Izbrannye Voprosy Matematicheskoy Fiziki i p-adicheskogo Analiza) (in Russian)]; Avetisov, V. A., Bikulov, A. Kh., and Osipov, V. A., “p-adic description of characteristic relaxation in complex systems,” J. Phys. A 36(15), 4239–4246 (2003); Avetisov, V. A., Bikulov, A. H., Kozyrev, S. V., and Osipov, V. A., “p-adic models of ultrametric diffusion constrained by hierarchical energy landscapes,” J. Phys. A 35(2), 177–189 (2002); Avetisov, V. A., Bikulov, A. Kh., and Kozyrev, S. V., “Description of logarithmic relaxation by a model of a hierarchical random walk,” Dokl. Akad. Nauk 368(2), 164–167 (1999) (in Russian). The fundamental solutions of these parabolic-type equations are transition functions of random walks on the n-dimensional vector space over the field of p-adic numbers. We study some properties of these random walks, including the first passage time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation

The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monomer-dimer problem on random planar honeycomb lattice

We consider the monomer-dimer (MD) problem on a random planar honeycomb lattice model, namely, the random multiple chain. This is a lattice system with non-periodic boundary condition, whose generating process is inspired by the growth of single walled zigzag carbon nanotubes. By applying algebraic and combinatorial techniques we establish a calculating expression of the MD partition function for bipartite graphs, which corresponds to the permanent of a matrix. Further, by using the transfer matrix argument we show that the computing problem of the permanent of high order matrix can be converted into some lower order matrices for this family of lattices, based on which we derive an explicit recurrence formula for evaluating the MD partition function of multiple chains and random multiple chains. Finally, we analyze the expectation of the number of monomer-dimer arrangements on a random multiple chain and the asymptotic behavior of the annealed MD entropy when the multiple chain becomes infinite in width and length, respectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust random number generation using steady-state emission of gain-switched laser diodes

We demonstrate robust, high-speed random number generation using interference of the steady-state emission of guaranteed random phases, obtained through gain-switching a semiconductor laser diode. Steady-state emission tolerates large temporal pulse misalignments and therefore significantly improves the interference quality. Using an 8-bit digitizer followed by a finite-impulse-response unbiasing algorithm, we achieve random number generation rates of 8 and 20 Gb/s, for laser repetition rates of 1 and 2.5 GHz, respectively, with a ±20% tolerance in the interferometer differential delay. We also report a generation rate of 80 Gb/s using partially phase-correlated short pulses. In relation to the field of quantum key distribution, our results confirm the gain-switched laser diode as a suitable light source, capable of providing phase-randomized coherent pulses at a clock rate of up to 2.5 GHz.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Random attractors for the stochastic coupled fractional Ginzburg-Landau equation with additive noise

This paper is concerned with the stochastic coupled fractional Ginzburg-Landau equation with additive noise. We first transform the stochastic coupled fractional Ginzburg-Landau equation into random equations whose solutions generate a random dynamical system. Then we prove the existence of random attractor for random dynamical system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discrete-time systems with random switches: From systems stability to networks synchronization

In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developed approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Synchronization properties of coupled chaotic neurons: The role of random shared input

Spike-time correlations of neighbouring neurons depend on their intrinsic firing properties as well as on the inputs they share. Studies have shown that periodically firing neurons, when subjected to random shared input, exhibit asynchronicity. Here, we study the effect of random shared input on the synchronization of weakly coupled chaotic neurons. The cases of so-called electrical and chemical coupling are both considered, and we observe a wide range of synchronization behaviour. When subjected to identical shared random input, there is a decrease in the threshold coupling strength needed for chaotic neurons to synchronize in-phase. The system also supports lag–synchronous states, and for these, we find that shared input can cause desynchronization. We carry out a master stability function analysis for a network of such neurons and show agreement with the numerical simulations. The contrasting role of shared random input for complete and lag synchronized neurons is useful in understanding spike-time correlations observed in many areas of the brain.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Random numbers from vacuum fluctuations

We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ACCELERATION OF VERY SMALL DUST GRAINS DUE TO RANDOM CHARGE FLUCTUATIONS

We study the acceleration of very small dust grains including polycyclic aromatic hydrocarbons arising from electrostatic interactions of dust grains that have charge fluctuating randomly in time. Random charge fluctuations of very small grains due to discrete charging events (i.e., sticking collisions with electrons and ions in plasma, and emission of photoelectrons by UV photons) are simulated using the Monte Carlo (MC) method. The motion of dust grains in randomly fluctuating electric fields induced by surrounding charged grains is studied using MC simulations. We identify the acceleration induced by random charge fluctuations as a dominant acceleration mechanism for very small grains in the diffuse interstellar medium (ISM). We find that this acceleration mechanism is efficient for environments with a low degree of ionization (i.e., large Debye length), where charge fluctuations are slow but have a large amplitude. The implications of the present acceleration mechanism for grain coagulation and shattering in the diffuse ISM and dark clouds are also discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

MODEL OF THE FIELD LINE RANDOM WALK EVOLUTION AND APPROACH TO ASYMPTOTIC DIFFUSION IN MAGNETIC TURBULENCE

The turbulent random walk of magnetic field lines plays an important role in the transport of plasmas and energetic particles in a wide variety of astrophysical situations, but most theoretical work has concentrated on determination of the asymptotic field line diffusion coefficient. Here we consider the evolution with distance of the field line random walk using a general ordinary differential equation (ODE), which for most cases of interest in astrophysics describes a transition from free streaming to asymptotic diffusion. By challenging theories of asymptotic diffusion to also describe the evolution, one gains insight on how accurately they describe the random walk process. Previous theoretical work has effectively involved closure of the ODE, often by assuming Corrsin's hypothesis and a Gaussian displacement distribution. Approaches that use quasilinear theory and prescribe the mean squared displacement ({Delta}x {sup 2}) according to free streaming (random ballistic decorrelation, RBD) or asymptotic diffusion (diffusive decorrelation, DD) can match computer simulation results, but only over specific parameter ranges, with no obvious 'marker' of the range of validity. Here we make use of a unified description in which the ODE determines ({Delta}x {sup 2}) self-consistently, providing a natural transition between the assumptions of RBD and DD. We find that the minimum kurtosis of the displacement distribution provides a good indicator of whether the self-consistent ODE is applicable, i.e., inaccuracy of the self-consistent ODE is associated with non-Gaussian displacement distributions.

79 ASTRONOMY AND ASTROPHYSICS↗