Search NASA⌕ Search

SEARCH · Search NASA

Results for “clustering coefficients”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

EGBTER: Capturing Degree Distribution, Clustering Coefficients, and Community Structure in a Single Random Graph Model

Random graph models are important constructs for data analytic applications as well as pure mathematical developments, as they provide capabilities for network synthesis and principled analysis. Several models have been developed with the aim of faithfully preserving important graph metrics and substructures. With the goal of capturing degree distribution, clustering coefficient, and communities in a single random graph model, we propose a new model to address shortcomings in a progression of network modeling capabilities. The Block Two-Level Erdos-Rényi (BTER) model of Seshadhri et aI., designed to allow prescription of expected degree and clustering coefficient distributions, neglects community modeling, while the Generalized BTER (GBTER) model of Bridges et aI., designed to add community modeling capabilities to BTER, struggles to faithfully represent all three characteristics simultaneously. In this work, we fit BTER and two GBTER configurations to several real-world networks and compare the results with that of our new model, the Extended GBTER (EGBTER) model. Our results support that EBGTER adds a community-modeling flexibility to BTER, while retaining a satisfactory level of accuracy in terms of degree and clustering coefficient. Our insights and empirical testing of previous models as well as the new model are novel contributions to the literature.

El-Daghar, Omar↗
DOE OSTI2014

Wedge sampling for computing clustering coefficients and triangle counts on large graphs

Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social cohesion. Despite the importance of these triadic measures, algorithms to compute them can be extremely expensive. We discuss the method of wedge sampling. This versatile technique allows for the fast and accurate approximation of various types of clustering coefficients and triangle counts. Furthermore, these techniques are extensible to counting directed triangles in digraphs. Our methods come with provable and practical time-approximation tradeoffs for all computations. We provide extensive results that show our methods are orders of magnitude faster than the state of the art, while providing nearly the accuracy of full enumeration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

A generalized Uhlenbeck and Beth formula for the third cluster coefficient

Relatively recently (Amaya-Tapia et al., 2011), we presented a formula for the evaluation of the third Bose fugacity coefficient–leading to the third virial coefficient–in terms of three-body eigenphase shifts, for particles subject to repulsive forces. An analytical calculation for a 1-dim. model, for which the result is known, confirmed the validity of this approach. We now extend the formalism to particles with attractive forces, and therefore must allow for the possibility that the particles have bound states. We thus obtain a true generalization of the famous formula of Uhlenbeck and Beth (Uhlenbeck and Beth, 1936; Beth and Uhlenbeck, 1937) and of Gropper (Gropper, 1936, 1937) for the second virial. We illustrate our formalism by a calculation, in an adiabatic approximation, of the third cluster in one dimension, using McGuire’s model as in our previous paper, but with attractive forces. The inclusion of three-body bound states is trivial; taking into account states having asymptotically two particles bound, and one free, is not.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Spatiotemporal Characteristics and Propagation of Summer Extreme Precipitation Events over United States: A Complex Network Analysis

Complex Network (CN) is a graph-theory based depiction of relation shared by various elements of a complex-dynamical system such as the atmosphere. Here we applied the concept of CN to understand the directionality and topological structure of summer extreme precipitation events (SEPEs) over the conterminous United States (CONUS). The SEPEs are calculated based on the 95th percentile daily rainfall at 0.5ox0.5o spatial resolution for CONUS to investigate the multi-dimensional characteristics of precipitation extremes. The derived CN coefficients (e.g., betweenness centrality, clustering coefficient, orientation, and network divergence) reveal important structural and dynamical information about the topology of the SEPEs and improve understanding of the dominant meteorological patterns. The initiation and propagation of SEPEs from the source-zones to the sink-zones are identified. The SEPEs are influenced by topography, dominant wind patterns, and moisture sources in terms of their topological structure and spatial dynamics.

Mondal, Somnath↗
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 OSTI2014

The application of complex network time series analysis in turbulent heated jets

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topological properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Measuring and Modeling Bipartite Graphs with Community Structure

Network science is a powerful tool for analyzing complex systems in fields ranging from sociology to engineering to biology. This paper is focused on generative models of bipartite graphs, also known as two-way graphs. We propose two generative models that can be easily tuned to reproduce the characteristics of real-world networks, not just qualitatively, but quantitatively. The measurements we consider are the degree distributions and the bipartite clustering coefficient, which we refer to as the metamorphosis coefficient. We define edge, node, and degreewise metamorphosis coefficients, enabling a more detailed understand of the bipartite community structure. Our proposed bipartite Chung-Lu model is able to reproduce real-world degree distributions, and our proposed bipartite “BTER” model reproduces both the degree distributions as well as the degreewise metamorphosis coefficients. We demonstrate the effectiveness of these models on several real-world data sets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Integrated Land Suitability Assessment for Depots Siting in a Sustainable Biomass Supply Chain

A sustainable biomass supply chain would require not only an effective and fluid transportation system with a reduced carbon footprint and costs, but also good soil characteristics ensuring durable biomass feedstock presence. Unlike existing approaches that fail to account for ecological factors, this work integrates ecological as well as economic factors for developing sustainable supply chain development. For feedstock to be sustainably supplied, it necessitates adequate environmental conditions, which need to be captured in supply chain analysis. Using geospatial data and heuristics, we present an integrated framework that models biomass production suitability, capturing the economic aspect via transportation network analysis and the environmental aspect via ecological indicators. Production suitability is estimated using scores, considering both ecological factors and road transportation networks. These factors include land cover/crop rotation, slope, soil properties (productivity, soil texture, and erodibility factor) and water availability. This scoring determines the spatial distribution of depots with priority to fields scoring the highest. Two methods for depot selection are presented using graph theory and a clustering algorithm to benefit from contextualized insights from both and potentially gain a more comprehensive understanding of biomass supply chain designs. Graph theory, via the clustering coefficient, helps determine dense areas in the network and indicate the most appropriate location for a depot. Clustering algorithm, via K-means, helps form clusters and determine the depot location at the center of these clusters. An application of this innovative concept is performed on a case study in the US South Atlantic, in the Piedmont region, determining distance traveled and depot locations, with implications on supply chain design. The findings from this study show that a more decentralized depot-based supply chain design with 3depots, obtained using the graph theory method, can be more economical and environmentally friendly compared to a design obtained from the clustering algorithm method with 2 depots. In the former, the distance from fields to depots totals 801,031,476 miles, while in the latter, it adds up to 1,037,606,072 miles, which represents about 30% more distance covered for feedstock transportation.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2015

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

A Gaussian graphical model approach to climate networks

Distinguishing between direct and indirect connections is essential when interpreting network structures in terms of dynamical interactions and stability. When constructing networks from climate data the nodes are usually defined on a spatial grid. The edges are usually derived from a bivariate dependency measure, such as Pearson correlation coefficients or mutual information. Thus, the edges indistinguishably represent direct and indirect dependencies. Interpreting climate data fields as realizations of Gaussian Random Fields (GRFs), we have constructed networks according to the Gaussian Graphical Model (GGM) approach. In contrast to the widely used method, the edges of GGM networks are based on partial correlations denoting direct dependencies. Furthermore, GRFs can be represented not only on points in space, but also by expansion coefficients of orthogonal basis functions, such as spherical harmonics. This leads to a modified definition of network nodes and edges in spectral space, which is motivated from an atmospheric dynamics perspective. We construct and analyze networks from climate data in grid point space as well as in spectral space, and derive the edges from both Pearson and partial correlations. Network characteristics, such as mean degree, average shortest path length, and clustering coefficient, reveal that the networks posses an ordered and strongly locally interconnected structure rather than small-world properties. Despite this, the network structures differ strongly depending on the construction method. Straightforward approaches to infer networks from climate data while not regarding any physical processes may contain too strong simplifications to describe the dynamics of the climate system appropriately.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Protein conformational switch discerned via network centrality properties

Network analysis has emerged as a powerful tool for examining structural biology systems. The spatial organization of the components of a biomolecular structure has been rendered as a graph representation and analyses have been performed to deduce the biophysical and mechanistic properties of these components. For proteins, the analysis of protein structure networks (PSNs), especially via network centrality measurements and cluster coefficients, has led to identifying amino acid residues that play key functional roles and classifying amino acid residues in general. Whether these network properties examined in various studies are sensitive to subtle (yet biologically significant) conformational changes remained to be addressed. Here, we focused on four types of network centrality properties (betweenness, closeness, degree, and eigenvector centralities) for conformational changes upon ligand binding of a sensor protein (constitutive androstane receptor) and an allosteric enzyme (ribonucleotide reductase). We found that eigenvector centrality is sensitive and can distinguish salient structural features between protein conformational states while other centrality measures, especially closeness centrality, are less sensitive and rather generic with respect to the structural specificity. We also demonstrated that an ensembleinformed, modified PSN with static edges removed (which we term PSN*) has enhanced sensitivity at discerning structural changes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Climate warming enhances microbial network complexity and stability

Unravelling the relationships between network complexity and stability under changing climate is a challenging topic in theoretical ecology that remains understudied in the field of microbial ecology. Here, we examined the effects of long-term experimental warming on the complexity and stability of molecular ecological networks in grassland soil microbial communities. Warming significantly increased network complexity, including network size, connectivity, connectance, average clustering coefficient, relative modularity and number of keystone species, as compared with the ambient control. Molecular ecological networks under warming became significantly more robust, with network stability strongly correlated with network complexity, supporting the central ecological belief that complexity begets stability. Furthermore, warming significantly strengthened the relationships of network structure to community functional potentials and key ecosystem functioning. Furthermore, these results indicate that preserving microbial ‘interactions’ is critical for ecosystem management and for projecting ecological consequences of future climate warming.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Three-state majority-vote model on small-world networks

Abstract In this work, we study the opinion dynamics of the three-state majority-vote model on small-world networks of social interactions. In the majority-vote dynamics, an individual adopts the opinion of the majority of its neighbors with probability 1- q , and a different opinion with chance q , where q stands for the noise parameter. The noise q acts as a social temperature, inducing dissent among individual opinions. With probability p , we rewire the connections of the two-dimensional square lattice network, allowing long-range interactions in the society, thus yielding the small-world property present in many different real-world systems. We investigate the degree distribution, average clustering coefficient and average shortest path length to characterize the topology of the rewired networks of social interactions. By employing Monte Carlo simulations, we investigate the second-order phase transition of the three-state majority-vote dynamics, and obtain the critical noise $$q_c$$ q c , as well as the standard critical exponents $$\beta /\nu$$ β / ν , $$\gamma /\nu$$ γ / ν , and $$1/\nu$$ 1 / ν for several values of the rewiring probability p . We conclude that the rewiring of the lattice enhances the social order in the system and drives the model to different universality classes from that of the three-state majority-vote model in two-dimensional square lattices.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

Modeling and dynamical topology properties of VANET based on complex networks theory

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Impact-Driven Sampling Strategies for Hybrid Attack Graphs

Cyber-Physical Systems (CPSs) have a large input space, with discrete and continuous elements across multiple layers. Hybrid Attack Graph (HAG) provide a flexible and efficient approach to generate attack sequences for a CPS. Analysis and testing of large-scale HAGs are prohibitively costly. We propose a dimension reduction via property-preserving multi-layer graph sampling algorithms. Existing property-preserving graph sampling approaches generate a representative subgraph of an original large-sized graph while preserving the key properties, such as node and edge distribution, clustering coefficients, and betweenness. On the other hand, we propose impact-driven sampling strategies to transform the input data to a lower-dimensional representation while retaining key properties of the data.

Subasi, Omer↗
DOE OSTI2019

Plant–microbe networks in soil are weakened by century-long use of inorganic fertilizers

Understanding the changes in plant-microbe interactions is critically important for predicting ecosystem functioning in response to human-induced environmental changes such as nitrogen (N) addition. In this study, the effects of a century-long fertilization treatment (> 150 years) on the networks between plants and soil microbial functional communities, detected by GeoChip, in grassland were determined in the Park Grass Experiment at Rothamsted Research, UK. Our results showed that plants and soil microbes have a consistent response to long-term fertilization-both richness and diversity of plants and soil microbes are significantly decreased, as well as microbial functional genes involved in soil carbon (C), nitrogen (N) and phosphorus (P) cycling. The network-based analyses showed that long-term fertilization decreased the complexity of networks between plant and microbial functional communities in terms of node numbers, connectivity, network density and the clustering coefficient. Similarly, within the soil microbial community, the strength of microbial associations was also weakened in response to long-term fertilization. Mantel path analysis showed that soil C and N contents were the main factors affecting the network between plants and microbes. Our results indicate that century-long fertilization weakens the plant-microbe networks, which is important in improving our understanding of grassland ecosystem functions and stability under long-term agriculture management.

59 BASIC BIOLOGICAL SCIENCES↗