Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both unweighted and weighted scale free networks having local and global core-periphery as well as community structure. Network evolves using topological growth, self growth, and weight distribution function. To validate the correctness of proposed models, we use K-shell and S-shell decomposition methods. Simulation results show that the generated unweighted networks follow power law degree distribution with droop head and heavy tail. Similarly, generated weighted networks follow degree, strength, and edge-weight power law distributions. We further study other properties of complex networks, such as clustering coefficient, nearest neighbor degree, and strength degree correlation.
 With more attentions drawn to transportation, we find that it is available to analyze transportation system by using weighted networks. Distinguishing from traditional method, we introduce a dynamic weighted network model with evolutional size and weight. Additionally, the expected strength allocation vector of the model consists of a deterministic component reflecting preferential attachment and a random component, which can characterize the realistic network better. In this paper, we obtain the degree and strength distributions of the weighted network and we conclude that the network has scale-free characteristics. We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges’ weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights’ reinforcement mechanism coupled to the local network growth. That coupling can be generalized in order to include the effect of additional randomness and nonlinearities which can be present in real-world networks. The model generates weighted graphs exhibiting the statistical properties observed in several realworld systems. In particular, the model yields a nontrivial time evolution of vertices’ properties and scale-free behavior with exponents depending on the microscopic parameters characterizing the coupling rules. Very interestingly, the generated graphs spontaneously achieve a complex hierarchical architecture characterized by clustering and connectivity correlations varying as a function of the vertices’ degree.