Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “scale-free”

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.

15 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Constraining accuracy of the pairwise velocities in N -body simulations using scale-free models

We present a continuation of an analysis that aims to quantify resolution of N-body simulations by exploiting large (up to N = 4096 3 ) simulations of scale-free cosmologies run using abacus. Here, we focus on radial pairwise velocities of the matter field, both by direct estimation and through the cumulative two-point correlation function (using the pair conservation equation). We find that convergence at the 1 per cent level of the mean relative pairwise velocity can be demonstrated over a range of scales, evolving from a few times the grid spacing at early times to slightly below this scale at late times. We show the analysis of two different box sizes as well as from averaging results from the smaller boxes, and compare the power of the two aforementioned estimators in constraining accuracy at each scale. Down to scales of the order of the smoothing parameter, convergence is obtained at ∼5 per cent precision, and shows a behaviour indicating asymptotic stable clustering. In conclusion, we also infer for LCDM simulations conservative estimates on the evolution of the lower cut-off to resolution (at 1 and 5 per cent precision) as a function of redshift.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Convergence of halo statistics: code comparison between rockstar and compaso using scale-free simulations

ABSTRACT In this study, we perform a halo-finder code comparison between rockstar and compaso. Based on our previous analysis aiming at quantifying resolution of N-body simulations by exploiting large (up to N = 40963) simulations of scale-free cosmologies run using abacus, we focus on convergence of the halo mass function, two-point correlation function, and mean radial pairwise velocities of halo centres selected with the aforementioned two algorithms. We establish convergence, for both rockstar and compaso, of mass functions at the 1 per cent precision level and of the mean pairwise velocities (and also two-point correlation function) at the 2 per cent level. At small scales and masses, we find that rockstar exhibits greater self-similarity. We also highlight the role played by the merger-tree post-processing of compaso haloes on their convergence. Finally, we give resolution limits expressed as a minimum particle number per halo in a form that can be directly extrapolated to Lambda cold dark matter.

Astronomy & Astrophysics↗
DOE OSTI2023

A Generalization of Threshold-Based and Probability-Based Models of Information Diffusion

Diffusion of information through complex networks is of interest in studies such as propagation prediction and influence maximization, both of which have applications in viral marketing and rumor controlling. There are a variety of information diffusion models, all of which simulate the adoption and spread of information over time. However, there is a lack of understanding of whether, despite their conceptual differences, these models represent the same underlying generative structures. For instance, if two different models utilize different conceptual mechanisms, but generate the same results, does the choice of model matter? A classification of diffusion of information models is developed based on the neighbor knowledge of the model infection requirement and the stochasticity of the model. This classification allows for the identification of models that fall into each respective category. The study involves the analysis of the following agent-based models on directed scale-free networks: (1) a linear absolute threshold model (LATM), (2) a linear fractional threshold model (LTFM), (3) the independent cascade model (ICM), (4) Bass-Rand-Rust model (BRRM) (5) a stochastic linear absolute threshold model (SLATM) (6) a stochastic fractional threshold model (SLFTM), and (7) Dodds–Watts model (DWM). Through the execution of simulations and analysis of the experimental results, the distinctive properties of each model are identified. Our analysis reveals that similarity in conceptual design does not imply similarity in behavior concerning speed, final state of nodes and edges, and sensitivity to parameters. Therefore, we highlight the importance of considering the unique behavioral characteristics of each model when selecting a suitable information diffusion model for a particular application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs

Abstract Gromov–Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov–Hausdorff distance is equivalent to solving an NP-hard optimization problem, deeming the notion impractical for applications. In this paper we propose a polynomial algorithm for estimating the so-called modified Gromov–Hausdorff (mGH) distance, a relaxation of the standard Gromov–Hausdorff (GH) distance with similar topological properties. We implement the algorithm for the case of compact metric spaces induced by unweighted graphs as part of Python library , and demonstrate its performance on real-world and synthetic networks. The algorithm finds the mGH distances exactly on most graphs with the scale-free property. We use the computed mGH distances to successfully detect outliers in real-world social and computer networks.

Oles, Vladyslav (ORCID:0000000188727463)↗
DOE OSTI2025

Infalling ultra-faint dwarfs as emissaries of the Axiverse

Recent discoveries of ultra-faint dwarf galaxies (UFDs) infalling onto the Milky Way, namely Leo K & M at r ≃ 450 kpc, considerably strengthens the case that UFDs constitute a distinct galaxy class that is inherently smaller and fainter, and metal-poorer than the classical dwarf spheroidals (dSph). This distinction is at odds with the inherent continuity of galaxy halo masses formed under scale-free gravity for any standard dark-matter (DM) model. Here, we show that distinct galaxy classes do evolve in cosmological simulations of multiple light bosons representing the “Axiverse” proposal of string theory, where a discrete mass spectrum of axions is generically predicted to span many decades in mass. In this context, the observed UFD class we show corresponds to a relatively heavy boson of 3 × 10 −21 eV, including Leo K & M, whereas a lighter axion of 10 −22 eV comprises the bulk of DM in all larger galaxies including the dSphs. Although Leo M is larger in size than Leo K, we predict its velocity dispersion to be smaller ( ≃ 1.7 km/s) than that of Leo K ( ≃ 4.5 km/s) because of the inverse de Broglie scale dependence on momentum. This scenario can be definitively tested using millisecond pulsars close to the Galactic center, where the Compton frequencies of the heavy and light bosons imprint monotone timing residuals that may be detected by the Square Kilometre Array (SKA) on timescales of approximately one week and four months, respectively.

dark matter↗
DOE OSTI2022

Self-consistent dispersal puts tight constraints on the spatiotemporal organization of species-rich metacommunities

Dispersal can be critical to the maintenance of ecosystems as it allows local communities to be recolonized after extinction. However, it remains unclear whether the extinction-mitigating effect of dispersal persists when the number of competing species is large. Based on a spatially explicit mathematical description of metacommunities, we show that when many species coexist, each species operates near its extinction threshold, barely surviving due to dispersal. This has general consequences for spatiotemporal abundance patterns. For short-range dispersal, species organize into fractal spatiotemporal extinction patterns characteristic of a directed percolation phase transition. As species approach their extinction threshold, biodiversity is very sensitive to perturbation, suggesting that dispersal within a metacommunity puts tight constraints on the robustness and evolution of species-rich metacommunities. Biodiversity is often attributed to a dynamic equilibrium between the immigration and extinction of species. This equilibrium forms a common basis for studying ecosystem assembly from a static reservoir of migrants—the mainland. Yet, natural ecosystems often consist of many coupled communities (i.e., metacommunities), and migration occurs between these communities. The pool of migrants then depends on what is sustained in the ecosystem, which, in turn, depends on the dynamic migrant pool. This chicken-and-egg problem of survival and dispersal is poorly understood in communities of many competing species, except for the neutral case—the “unified neutral theory of biodiversity.” Employing spatiotemporal simulations and mean-field analyses, we show that self-consistent dispersal puts rather tight constraints on the dynamic migration–extinction equilibrium. When the number of species is large, species are pushed to the edge of their global extinction, even when competition is weak. As a consequence, the overall diversity is highly sensitive to perturbations in demographic parameters, including growth and dispersal rates. When dispersal is short range, the resulting spatiotemporal abundance patterns follow broad scale-free distributions that correspond to a directed percolation phase transition. The qualitative agreement of our results for short-range and long-range dispersal suggests that this self-organization process is a general property of species-rich metacommunities. Our study shows that self-sustaining metacommunities are highly sensitive to environmental change and provides insights into how biodiversity can be rescued and maintained.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Avalanche statistics of fluctuation-induced fluxes from the SLPM and the W7-AS stellarator

Measurements of fluctuating floating potentials and ion saturation currents at different radial locations in the Santander Linear Plasma Machine (Castellanos et al 2005 Plasma Phys. Control. Fusion47 2067) and at the edge of the W7-AS stellarator by means of radially movable Langmuir probes allow to infer the corresponding fluctuation-induced radial flux temporal series. Avalanche-like transport events are identified in the time series and statistically characterized in terms of avalanche size/duration/quiet-time distributions and size-duration scaling relations. Transport is diffusive in the inner and intermediate radial region of the SLPM r < r tr ≈ 2.6 cm, undergoing a transition at r tr , becoming non-diffusive in the outermost region of the device, r > r tr . Here, the results obtained at the edge of the W7-AS stellarator are similar to those found in SLPM for r > r tr , i.e. consistent with what would be expected for scale-free, self-similar plasma transport dynamics near a critical state.

Avalanches↗
DOE OSTI2023

Domain Adaptive Graph Neural Networks for Constraining Cosmological Parameters Across Multiple Data Sets

Deep learning models have been shown to outperform methods that rely on summary statistics, like the power spectrum, in extracting information from complex cosmological data sets. However, due to differences in the subgrid physics implementation and numerical approximations across different simulation suites, models trained on data from one cosmological simulation show a drop in performance when tested on another. Similarly, models trained on any of the simulations would also likely experience a drop in performance when applied to observational data. Training on data from two different suites of the CAMELS hydrodynamic cosmological simulations, we examine the generalization capabilities of Domain Adaptive Graph Neural Networks (DA-GNNs). By utilizing GNNs, we capitalize on their capacity to capture structured scale-free cosmological information from galaxy distributions. Moreover, by including unsupervised domain adaptation via Maximum Mean Discrepancy (MMD), we enable our models to extract domain-invariant features. We demonstrate that DA-GNN achieves higher accuracy and robustness on cross-dataset tasks. Using data visualizations, we show the effects of domain adaptation on proper latent space data alignment. This shows that DA-GNNs are a promising method for extracting domain-independent cosmological information, a vital step toward robust deep learning for real cosmic survey data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Bridging the Gap between Cosmological Simulations with Graph Neural Networks and Domain Adaptation

Deep learning models have been shown to outperform methods that rely on summary statistics, like the power spectrum, in extracting information from complex cosmological data sets. However, due to differences in the subgrid physics implementation and numerical approximations across different simulation suites, models trained on data from one cosmological simulation show a drop in performance when tested on another. Similarly, models trained on any of the simulations would also likely experience a drop in performance when applied to observational data. Training on data from two different suites of the CAMELS hydrodynamic cosmological simulations, we examine the generalization capabilities of Domain Adaptive Graph Neural Networks (DA-GNNs). By utilizing GNNs, we capitalize on their capacity to capture structured scale-free cosmological information from galaxy distributions. Moreover, by including unsupervised domain adaptation via Maximum Mean Discrepancy (MMD), we enable our models to extract domain-invariant features. We demonstrate that DA-GNN achieves higher accuracy and robustness on cross dataset tasks (up to 28% better relative error and up to almost an order of magnitude better χ 2 ). Using data visualizations, we show the effects of domain adaptation on proper latent space data alignment. This shows that DA-GNNs are a promising method for extracting domain-independent cosmological information, a vital step toward robust deep learning for real cosmic survey data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Domain Adaptive Graph Neural Networks for Constraining Cosmological Parameters Across Multiple Data Sets

Deep learning models have been shown to outperform methods that rely on summary statistics, like the power spectrum, in extracting information from complex cosmological data sets. However, due to differences in the subgrid physics implementation and numerical approximations across different simulation suites, models trained on data from one cosmological simulation show a drop in performance when tested on another. Similarly, models trained on any of the simulations would also likely experience a drop in performance when applied to observational data. Training on data from two different suites of the CAMELS hydrodynamic cosmological simulations, we examine the generalization capabilities of Domain Adaptive Graph Neural Networks (DA-GNNs). By utilizing GNNs, we capitalize on their capacity to capture structured scale-free cosmological information from galaxy distributions. Moreover, by including unsupervised domain adaptation via Maximum Mean Discrepancy (MMD), we enable our models to extract domain-invariant features. We demonstrate that DA-GNN achieves higher accuracy and robustness on cross-dataset tasks (up to $28\%$ better relative error and up to almost an order of magnitude better $\chi^2$). Using data visualizations, we show the effects of domain adaptation on proper latent space data alignment. This shows that DA-GNNs are a promising method for extracting domain-independent cosmological information, a vital step toward robust deep learning for real cosmic survey data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Seeing through noise in power laws

Despite widespread claims of power laws across the natural and social sciences, evidence in data is often equivocal. Modern data and statistical methods reject even classic power laws such as Pareto’s law of wealth and the Gutenberg–Richter law for earthquake magnitudes. We show that the maximum-likelihood estimators and Kolmogorov–Smirnov (K-S) statistics in widespread use are unexpectedly sensitive to ubiquitous errors in data such as measurement noise, quantization noise, heaping and censorship of small values. This sensitivity causes spurious rejection of power laws and biases parameter estimates even in arbitrarily large samples, which explains inconsistencies between theory and data. We show that logarithmic binning by powers of λ > 1 attenuates these errors in a manner analogous to noise averaging in normal statistics and that λ thereby tunes a trade-off between accuracy and precision in estimation. Binning also removes potentially misleading within-scale information while preserving information about the shape of a distribution over powers of λ, and we show that some amount of binning can improve sensitivity and specificity of K-S tests without any cost, while more extreme binning tunes a trade-off between sensitivity and specificity. We therefore advocate logarithmic binning as a simple essential step in power-law inference.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Seeing through noise in power laws

Despite widespread claims of power laws across the natural and social sciences, evidence in data is often equivocal. Modern data and statistical methods reject even classic power laws such as Pareto’s law of wealth and the Gutenberg–Richter law for earthquake magnitudes. We show that the maximum-likelihood estimators and Kolmogorov–Smirnov (K-S) statistics in widespread use are unexpectedly sensitive to ubiquitous errors in data such as measurement noise, quantization noise, heaping and censorship of small values. This sensitivity causes spurious rejection of power laws and biases parameter estimates even in arbitrarily large samples, which explains inconsistencies between theory and data. We show that logarithmic binning by powers of λ > 1 attenuates these errors in a manner analogous to noise averaging in normal statistics and that λ thereby tunes a trade-off between accuracy and precision in estimation. Binning also removes potentially misleading within-scale information while preserving information about the shape of a distribution over powers of λ, and we show that some amount of binning can improve sensitivity and specificity of K-S tests without any cost, while more extreme binning tunes a trade-off between sensitivity and specificity. We therefore advocate logarithmic binning as a simple essential step in power-law inference.

97 MATHEMATICS AND COMPUTING↗