Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & Computing”

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 1,423 records · Page 79

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Quantum random walks without walking

Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Instabilities of optical solitons and Hamiltonian singular solutions in a medium of finite extension

We analyze the role of soliton solutions and Hamiltonian singularities in the dynamics of counterpropagating waves in a medium of finite spatial extension. The soliton solution can become unstable due to the finite extension of the system. We show that the spatiotemporal dynamics then relaxes toward a Hamiltonian singular state of a nature different than that of the soliton state. This phenomenon can be explained through a geometrical analysis of the singularities of the stationary Hamiltonian system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal shift of the fidelity susceptibility peak away from the critical point of the Berezinskii-Kosterlitz-Thouless quantum phase transition

We show that the peak which can be observed in fidelity susceptibility around the Berezinskii-Kosterlitz-Thouless transition is shifted from the quantum critical point (QCP) at J c to J * in the gapped phase by a value | J *– J c | = B 2 /36, where B 2 is a transition width controlling the asymptotic form of the correlation length ξ~exp(– B /√| J – J c |) in that phase. This is in contrast to the conventional continuous QCP where the maximum is an indicator of the position of the critical point. The shape of the peak is universal, emphasizing the close connection between fidelity susceptibility and the correlation length. Here, we support those arguments with numerical matrix product state simulations of the one-dimensional Bose-Hubbard model in the thermodynamic limit, where the broad peak is located at J * = 0.212 that is significantly different from J c = 0.3048(3). In the spin-3/2 XXZ model the shift from J c = 1 to J * = 1.0021 is small but the narrow universal peak is much more pronounced over the nonuniversal background.

36 MATERIALS SCIENCE↗

Generalized Galileons: All scalar models whose curved background extensions maintain second-order field equations and stress tensors

We extend to curved backgrounds all flat-space scalar field models that obey purely second-order equations, while maintaining their second-order dependence on both field and metric. This extension simultaneously restores to second order the, originally higher derivative, stress tensors as well. The process is transparent and uniform for all dimensions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

New framework for studying spherically symmetric static solutions in f(R) gravity

We develop a new covariant formalism to treat spherically symmetric spacetimes in metric f(R) theories of gravity. Using this formalism we derive the general equations for a static and spherically symmetric metric in a general f(R) gravity. These equations are used to determine the conditions for which the Schwarzschild metric is the only vacuum solution with vanishing Ricci scalar. We also show that our general framework provides a clear way of showing that the Schwarzschild solution is not a unique static spherically symmetric solution, providing some insight into how the current form of Birkhoff's theorem breaks down for these theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Compactlike kinks and vortices in generalized models

This work deals with the presence of topological defects in k-field models, where the dynamics is generalized to include higher order power in the kinetic term. We investigate kinks in (1, 1) dimensions and vortices in (2, 1) dimensions, focusing on some specific features of the solutions. In particular, we show how the kinks and vortices change to compactlike solutions, controlled by the parameter used to introduce the generalized models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Measurement and memory in the periodically driven complex Ginzburg-Landau equation

In the present work we illustrate that classical but nonlinear systems may possess features reminiscent of quantum ones, such as memory, upon suitable external perturbation. As our prototypical example, we use the two-dimensional complex Ginzburg-Landau equation in its vortex glass regime. Here, we impose an external drive as a perturbation mimicking a quantum measurement protocol, with a given “measurement rate” (the rate of repetition of the drive) and “mixing rate” (characterized by the intensity of the drive). Using a variety of measures, we find that the system may or may not retain its coherence, statistically retrieving its original glass state, depending on the strength and periodicity of the perturbing field. The corresponding parametric regimes and the associated energy cascade mechanisms involving the dynamics of vortex waveforms and domain boundaries are discussed.

97 MATHEMATICS AND COMPUTING↗

Magnitude correlations in global seismicity

By employing natural time analysis, we analyze the worldwide seismicity and study the existence of correlations between earthquake magnitudes. We find that global seismicity exhibits nontrivial magnitude correlations for earthquake magnitudes greater than M{sub w}6.5.

58 GEOSCIENCES↗

Security proof of practical quantum key distribution with detection-efficiency mismatch

Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cutoff of incoming signals such that our security proof is directly applicable to practical situations. We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes. In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed. For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cutoff assumption. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.

97 MATHEMATICS AND COMPUTING↗

A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performs significantly better.

97 MATHEMATICS AND COMPUTING↗

Insights From the Software Design of a Multiphysics Multicomponent Scientific Code

Using simulations for scientific discovery requires that the software used in the simulations undergoes a rigorous design and development process similar to that of the lab instruments in the experimental sciences. To devise a good design methodology, it is critical to understand the requirements, constraints, and challenges. Furthermore, this article describes insights from the long-term stewardship of a multiphysics multicomponent software, FLASH, that was designed more than 20 years ago for astrophysics, now serves multiple communities, and has been successful in adapting to the changing world of high-performance computing.

97 MATHEMATICS AND COMPUTING↗

Stochastic robust mathematical programming model for power system optimization

We present a stochastic robust framework for two-stage power system optimization problems with uncertainty. The model optimizes the probabilistic expectation of different worst-case scenarios with different uncertainty sets. In addition, a case study of unit commitment shows the effectiveness of the proposed model and algorithms.

97 MATHEMATICS AND COMPUTING↗

Local Equilibrium and Retardation Revisited

We present that in modeling solute transport with mobile-immobile mass transfer (MIMT), it is common to use an advection-dispersion equation (ADE) with a retardation factor, or retarded ADE. This is commonly referred to as making the local equilibrium assumption (LEA). Assuming local equilibrium, Eulerian textbook treatments derive the retarded ADE, ostensibly exactly. However, other authors have presented rigorous mathematical derivations of the dispersive effect of MIMT, applicable even in the case of arbitrarily fast mass transfer. We resolve the apparent contradiction between these seemingly exact derivations by adopting a Lagrangian point of view. We show that local equilibrium constrains the expected time immobile, whereas the retarded ADE actually embeds a stronger, nonphysical, constraint: that all particles spend the same amount of every time increment immobile. Eulerian derivations of the retarded ADE thus silently commit the gambler's fallacy, leading them to ignore dispersion due to mass transfer that is correctly modeled by other approaches. We then present a particle tracking simulation illustrating how poor an approximation the retarded ADE may be, even when mobile and immobile plumes are continually near local equilibrium. Finally, we note that classic “LEA” (actually, retarded ADE validity) criteria test for insignificance of MIMT-driven dispersion relative to hydrodynamic dispersion, rather than for local equilibrium.

58 GEOSCIENCES↗