Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random Matrix”

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 109 records · Page 6

Functional Ecological Gene Networks to Reveal the Changes Among Microbial Interactions Under Elevated Carbon Dioxide Conditions

Biodiversity and its responses to environmental changes is a central issue in ecology, and for society. Almost all microbial biodiversity researches focus on species richness and abundance but ignore the interactions among different microbial species/populations. However, determining the interactions and their relationships to environmental changes in microbial communities is a grand challenge, primarily due to the lack of information on the network structure among different microbial species/populations. Here, a novel random matrix theory (RMT)-based conceptual framework for identifying functional ecological gene networks (fEGNs) is developed with the high throughput functional gene array hybridization data from the grassland microbial communities in a long-term FACE (Free Air CO2 Enrichment) experiment. Both fEGNs under elevated CO2 (eCO2) and ambient CO2 (aCO2) possessed general characteristics of many complex systems such as scale-free, small-world, modular and hierarchical. However, the topological structure of the fEGNs is distinctly different between eCO2 and aCO2, suggesting that eCO2 dramatically altered the interactions among different microbial functional groups/populations. In addition, the changes in network structure were significantly correlated with soil carbon and nitrogen dynamics, and plant productivity, indicating the potential importance of network interactions in ecosystem functioning. Elucidating network interactions in microbial communities and their responses to environmental changes are fundamentally important for research in microbial ecology, systems microbiology, and global change.

54 ENVIRONMENTAL SCIENCES↗

Molecular ecological network analyses

Background: Understanding the interaction among different species within a community and their responses to environmental changes is a central goal in ecology. However, defining the network structure in a microbial community is very challenging due to their extremely high diversity and as-yet uncultivated status. Although recent advance of metagenomic technologies, such as high throughout sequencing and functional gene arrays, provide revolutionary tools for analyzing microbial community structure, it is still difficult to examine network interactions in a microbial community based on high-throughput metagenomics data. Results: Here, we describe a novel mathematical and bioinformatics framework to construct ecological association networks named molecular ecological networks (MENs) through Random Matrix Theory (RMT)-based methods. Compared to other network construction methods, this approach is remarkable in that the network is automatically defined and robust to noise, thus providing excellent solutions to several common issues associated with high throughput metagenomics data. We applied it to determine the network structure of microbial communities subjected to long-term experimental warming based on pyrosequencing data of 16 S rRNA genes. We showed that the constructed MENs under both warming and unwarming conditions exhibited topological features of scale free, small world and modularity, which were consistent with previously described molecular ecological networks. Eigengene analysis indicated that the eigengenes represented the module profiles relatively well. In consistency with many other studies, several major environmental traits including temperature and soil pH were found to be important in determining network interactions in the microbial communities examined. To facilitate its application by the scientific community, all these methods and statistical tools have been integrated into a comprehensive Molecular Ecological Network Analysis Pipeline (MENAP), which is open-accessible now (http://ieg2.ou.edu/MENA). Conclusions: The RMT-based molecular ecological network analysis provides powerful tools to elucidate network interactions in microbial communities and their responses to environmental changes, which are fundamentally important for research in microbial ecology and environmental microbiology.

59 BASIC BIOLOGICAL SCIENCES↗

Replica symmetry breaking for the integrable two-site Sachdev–Ye–Kitaev model

We analyze a two-body non-Hermitian two-site Sachdev–Ye–Kitaev (SYK) model with the couplings of one site complex conjugated to the other site. This model, with no explicit coupling between the sites, shows an infinite number of second-order phase transitions, which is a consequence of the factorization of the partition function into a product over Matsubara frequencies. We calculate the quenched free energy in two different ways: first in terms of the single-particle energies and second by solving the Schwinger–Dyson equations of the two-site model. The first calculation can be done entirely in terms of a one-site model. The conjugate replica enters due to non-analyticities when Matsubara frequencies enter the spectral support of the coupling matrix. The second calculation is based on the replica trick of the two-site partition function. Both methods give the same result. The free-fermion partition function can also be rephrased as a matrix model for the coupling matrix. Up to minor details, this model is the random matrix model that describes the chiral phase transition of QCD, and the order parameter of the two-body model corresponds to the chiral condensate of QCD. Comparing to the corresponding four-body model, we are able to determine which features of the free energy are due to the chaotic nature of the four-body model. The high-temperature phase of both models is entropy dominated, and in both cases, the free energy is determined by the spectral density. The chaotic four-body SYK model has a low-temperature phase whose free energy is almost temperature-independent, signaling an effective gap of the theory even though the actual spectrum does not exhibit a gap. On the other hand, the low-temperature free energy of the two-body SYK model is not flat; in fact, it oscillates to arbitrarily low temperature. This indicates a less desirable feature that the entropy of the two-body model is not always positive in the low-temperature phase, which most likely is a consequence of the non-hermiticity.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗

Random Tensor Networks with Non-trivial Links

Abstract Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that a better model consists of random tensor networks with link states that are not maximally entangled, i.e., have non-trivial spectra. In this work, we initiate a systematic study of the entanglement properties of these networks. We employ tools from free probability, random matrix theory, and one-shot quantum information theory to study random tensor networks with bounded and unbounded variation in link spectra, and in cases where a subsystem has one or multiple minimal cuts. If the link states have bounded spectral variation, the limiting entanglement spectrum of a subsystem with two minimal cuts can be expressed as a free product of the entanglement spectra of each cut, along with a Marchenko–Pastur distribution. For a class of states with unbounded spectral variation, analogous to semiclassical states in quantum gravity, we relate the limiting entanglement spectrum of a subsystem with two minimal cuts to the distribution of the minimal entanglement across the two cuts. In doing so, we draw connections to previous work on split transfer protocols, entanglement negativity in random tensor networks, and Euclidean path integrals in quantum gravity.

Physics↗

Maximum likelihood method to correct for missed levels based on the {Delta}{sub 3}(L) statistic

The {Delta}{sub 3}(L) statistic of random matrix theory is defined as the average of a set of random numbers {l_brace}{delta}{r_brace}, derived from a spectrum. The distribution p({delta}) of these random numbers is used as the basis of a maximum likelihood method to gauge the fraction x of levels missed in an experimental spectrum. The method is tested on an ensemble of depleted spectra from the Gaussian orthogonal ensemble (GOE) and accurately returned the correct fraction of missed levels. Neutron resonance data and acoustic spectra of an aluminum block were analyzed. All results were compared with an analysis based on an established expression for {Delta}{sub 3}(L) for a depleted GOE spectrum. The effects of intruder levels are examined and seen to be very similar to those of missed levels. Shell model spectra were seen to give the same p({delta}) as the GOE.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A principle of maximum ignorance for semiclassical gravity

The principle of maximum ignorance posits that the coarse-grained description of a system is maximally agnostic about its underlying microscopic structure. We briefly review this principle for random matrix theory and for the eigenstate thermalization hypothesis. We then apply this principle in holography to construct ensembles of random mixed states. This leads to an ensemble of microstates which models our microscopic ignorance, and which on average reproduces the effective semiclassical physics of a given bulk state. We call this ensemble the state-averaging ansatz. The output of our model is a prediction for semiclassical contributions to variances and higher statistical moments over the ensemble of microstates. The statistical moments provide coarse-grained — yet gravitationally non-perturbative — information about the microstructure of the individual states of the ensemble. We show that these contributions exactly match the on-shell action of known wormhole configurations of the gravitational path integral. These results strengthen the view that wormholes simply parametrize the ignorance of the microstructure of a fundamental state, given a fixed semiclassical bulk description.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum chaotic scattering in microwave resonators

In a frequency range where a microwave resonator simulates a chaotic quantum billiard, we have measured moduli and phases of reflection and transmission amplitudes in the regimes of both isolated and of weakly overlapping resonances and for resonators with and without time-reversal invariance. Statistical measures for S-matrix fluctuations were determined from the data and compared with extant and/or newly derived theoretical results obtained from the random-matrix approach to quantum chaotic scattering. The latter contained a small number of fit parameters. The large data sets taken made it possible to test the theoretical expressions with unprecedented accuracy. The theory is confirmed by both a goodness-of-fit-test and the agreement of predicted values for those statistical measures that were not used for the fits, with the data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Correlations of RMT characteristic polynomials and integrability: Hermitean matrices

Integrable theory is formulated for correlation functions of characteristic polynomials associated with invariant non-Gaussian ensembles of Hermitean random matrices. By embedding the correlation functions of interest into a more general theory of {tau} functions, we (i) identify a zoo of hierarchical relations satisfied by {tau} functions in an abstract infinite-dimensional space and (ii) present a technology to translate these relations into hierarchically structured nonlinear differential equations describing the correlation functions of characteristic polynomials in the physical, spectral space. Implications of this formalism for fermionic, bosonic, and supersymmetric variations of zero-dimensional replica field theories are discussed at length. A particular emphasis is placed on the phenomenon of fermionic-bosonic factorisation of random-matrix-theory correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement transitions from holographic random tensor networks

Here, we introduce a class of phase transitions separating quantum states with different entanglement features. An example of such an “entanglement phase transition” is provided by the many-body localization transition in disordered quantum systems, as it separates highly entangled thermal states at weak disorder from many-body localized states with low entanglement at strong disorder. In the spirit of random matrix theory, we describe a simple model for such transitions where a physical quantum many-body system lives at the “holographic” boundary of a bulk random tensor network. Using a replica trick approach, we map the calculation of the entanglement properties of the boundary system onto the free energy cost of fluctuating domain walls in a classical statistical mechanics model. This allows us to interpret transitions between volume-law and area-law scaling of entanglement as ordering transitions in this statistical mechanics model. Our approach allows us to get an analytic handle on the field theory of these entanglement transitions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Operator dynamics in Floquet many-body systems

We study operator dynamics in many-body quantum systems, focusing on generic features of systems that are ergodic, spatially extended, and lack conserved densities. Quantum circuits of various types provide simple models for such systems. We focus on Floquet quantum circuits, comparing their behavior with what has been found previously for circuits that are random in time. Floquet circuits, which have discrete time-translation symmetry, represent an intermediate case between circuits that are random in time and lack any symmetry, and systems with a time-independent Hamiltonian and continuous time-translation invariance. By making this comparison, one of our aims is to identify signatures of time-translation symmetry in Floquet operator dynamics. To characterize behavior we examine a variety of quantities in solvable models and numerically: operator autocorrelation functions; the partial spectral form factor; the out-of-time-order correlator (OTOC); and the paths in operator space that make the dominant contributions to the ensemble-averaged autocorrelation functions. Our most striking result is that ensemble-averaged autocorrelation functions show behavior that is distinctively different in Floquet systems compared to systems in which successive time-steps are independent. Specifically, while average autocorrelation functions decay on a microscopic timescale for circuits that are random in time, in Floquet systems they have a late-time tail with a duration that grows parametrically with the size of the operator support. In the simplest models this tail is separated from the initial decay by a minimum, so that the average autocorrelation function has an intermediate-time peak. The existence of these tails provides a way to understand deviations of the spectral form factor from random matrix behavior at times shorter than the Thouless time. In contrast to this feature in autocorrelation functions, we find no new aspects to the behavior of OTOCs for Floquet models compared to random-in-time circuits. We show that this difference between averaged autocorrelation functions and OTOCs can be understood in terms of the paths in operator space that contribute to the two quantities: paths for the former retain a limited support at late times, while paths for the latter are dominated by operator spreading. Published by the American Physical Society 2025

Yoshimura, Takato (ORCID:0000000309159846)↗

Using the {delta}{sub 3} statistic to test for missed levels in mixed sequence neutron resonance data

The {delta}{sub 3}(L) statistic is studied as a tool to detect missing levels in the neutron resonance data where two sequences are present. These systems are problematic because there is no level repulsion, and the resonances can be too close to resolve. {delta}{sub 3}(L) is a measure of the fluctuations in the number of levels in an interval of length L on the energy axis. The method used is tested on ensembles of mixed Gaussian orthogonal ensemble spectra, with a known fraction of levels (x%) randomly depleted, and can accurately return x. The accuracy of the method as a function of spectrum size is established. The method is used on neutron resonance data for 11 isotopes with either s-wave neutrons on odd-A isotopes, or p-wave neutrons on even-A isotopes. The method compares favorably with a maximum likelihood method applied to the level spacing distribution. Nuclear data ensembles were made from 20 isotopes in total, and their {delta}{sub 3}(L) statistics are discussed in the context of random matrix theory.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Bit Error Probability for Maximum Likelihood Decoding of Linear Block Codes

In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear codes is investigated. The contribution of each information bit to P(sub b) is considered. For randomly generated codes, it is shown that the conventional approximation at high SNR P(sub b) is approximately equal to (d(sub H)/N)P(sub s), where P(sub s) represents the block error probability, holds for systematic encoding only. Also systematic encoding provides the minimum P(sub b) when the inverse mapping corresponding to the generator matrix of the code is used to retrieve the information sequence. The bit error performances corresponding to other generator matrix forms are also evaluated. Although derived for codes with a generator matrix randomly generated, these results are shown to provide good approximations for codes used in practice. Finally, for decoding methods which require a generator matrix with a particular structure such as trellis decoding or algebraic-based soft decision decoding, equivalent schemes that reduce the bit error probability are discussed.

Lin, Shu↗

Semiclassical matrix model for quantum chaotic transport with time-reversal symmetry

We show that the semiclassical approach to chaotic quantum transport in the presence of time-reversal symmetry can be described by a matrix model. In other words, we construct a matrix integral whose perturbative expansion satisfies the semiclassical diagrammatic rules for the calculation of transport statistics. One of the virtues of this approach is that it leads very naturally to the semiclassical derivation of universal predictions from random matrix theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantifying Quantum Chaos through Microcanonical Distributions of Entanglement

A characteristic feature of “quantum chaotic” systems is that their eigenspectra and eigenstates display universal statistical properties described by random matrix theory (RMT). However, eigenstates of local systems also encode structure beyond RMT. To capture this feature, we introduce a framework that allows us to compare the properties of eigenstates in local systems with those of pure random states. In particular, our framework defines a notion of distance between quantum state ensembles that utilizes the Kullback-Leibler divergence to compare the microcanonical distribution of entanglement entropy (EE) of eigenstates with a reference RMT distribution generated by pure random states (with appropriate constraints). This notion gives rise to a quantitative metric for quantum chaos that not only accounts for averages of the distributions but also higher moments. The differences in moments are compared on a highly resolved scale set by the standard deviation of the RMT distribution, which is exponentially small in system size. As a result, the metric can distinguish between chaotic and integrable behaviors and, in addition, quantify and compare the of chaos (in terms of proximity to RMT behavior) between two systems that are assumed to be chaotic. We implement our framework in local, minimally structured, Floquet random circuits, as well as a canonical family of many-body Hamiltonians, the mixed-field Ising model (MFIM). Importantly, for Hamiltonian systems, we find that the reference random distribution must be appropriately constrained to incorporate the effect of energy conservation in order to describe the ensemble properties of midspectrum eigenstates. The metric captures deviations from RMT across all models and parameters, including those that have been previously identified as strongly chaotic, and for which other diagnostics of chaos such as level spacing statistics look strongly thermal. In Floquet circuits, the dominant source of deviations is the second moment of the distribution, and this persists for all system sizes. For the MFIM, we find significant variation of the KL divergence in parameter space. Notably, we find a small region where deviations from RMT are minimized, suggesting that “maximally chaotic” Hamiltonians may exist in fine-tuned pockets of parameter space. Published by the American Physical Society 2024

Physics↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗