Weighted Network of Chinese Nature Science Basic Research

Abstract

Using the requisition papers of Chinese Nature Science Basic Research in management and information department, we construct the weighted network of research areas({\bf WRAN}) represented by the subject codes. In WRAN, two research areas are considered connected if they have been filled in at least one requisition paper. The edge weight is defined as the number of requisition papers which have filled in the same pairs of codes. The node strength is defined as the number of requisition papers which have filled in this code, including the papers which have filled in it only. Here we study a variety of nonlocal statistics for these networks, such as typical distances between research areas through the network, and measures of centrality such as betweenness. These statistics characteristics can illuminate the global development trend of Chinese scientific study, it is also helpful to adjust the code system to reflect the real status more accurately. Finally, we present a plausible model for the formation and structure of networks with the observed properties.

8 pages, 14 figures

References in corpus (35)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Finding and evaluating community structure in networks
• Assortative mixing in networks
• The architecture of complex weighted networks
• Evolution of networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Evolution of the social network of scientific collaborations
• Cascade-based attacks on complex networks
• Why social networks are different from other types of networks
• Weighted evolving networks: coupling topology and weights dynamics
• Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
• Statistical Analysis of Airport Network of China
• Modeling the evolution of weighted networks
• Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Sandpile on Scale-Free Networks
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Construction and properties of assortative random networks
• Assortative model for social networks
• Recursive graphs with small-world scale-free properties
• Enhance synchronizability by structural perturbations
• Deterministic Small-World Networks
• A Mutual Selection Model for Weighted Networks
• Perturbation: the Catastrophe Causer in Scale-Free Networks
• The Network of EU-Funded Collaborative R&D Projects
• Optimization of robustness of scale-free network to random and targeted attacks
• Scaling in directed dynamical small-world networks with random responses
• Temporal Series Analysis Approach to Spectra of Complex Networks
• Better Synchronizability Predicted by Crossed Double Cycle
• Self-organized Boolean game on networks
• Scaling Invariance in Spectra of Complex Networks: A Diffusion Factorial Moment Approach
• Optimization of scale-free network for random failures
• Complex Network Properties of Chinese Natural Science Basic Research

Cited by in corpus (6)

• Highly accurate recommendation algorithm based on high-order similarities
• Empirical analysis on a keyword-based semantic system
• Effect of user tastes on personalized recommendation
• Degree correlation effect of bipartite network on personalized recommendation
• Online Social Activity Reflects Economic Status
• Characteristics of Real Futures Trading Networks