Complex network Research Papers - Academia.edu (original) (raw)

Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics of processes executed on the network. The analysis, discrimination, and synthesis of... more

Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics of processes executed on the network. The analysis, discrimination, and synthesis of complex networks therefore rely on the use of measurements capable of expressing the most relevant topological features. This article presents a survey of such measurements. It includes general considerations about complex network characterization, a brief review of the principal models, and the ...

We combine data on international trade linkages with network methods to examine the global trading system as an interdependent complex network. We map the topology of the international trade network and suggest new network based measures... more

We combine data on international trade linkages with network methods to examine the global trading system as an interdependent complex network. We map the topology of the international trade network and suggest new network based measures of international economic integration, at both a global system-wide level and a local country-level. We develop network based measures that incorporate not only the

Local assortativity has been recently proposed as a measure to analyse complex networks. It has been noted that the Internet Autonomous System level networks show a markedly different local assortativity profile to most biological and... more

Local assortativity has been recently proposed as a measure to analyse complex networks. It has been noted that the Internet Autonomous System level networks show a markedly different local assortativity profile to most biological and social networks. In this paper we show that, even though several Internet growth models exist, none of them produce the local assortativity profile that can be observed in the real AS networks. We introduce a new generic growth model which can produce a linear local assortativity profile similar to that of the Internet. We verify that this model accurately depicts the local assortativity profile criteria of Internet, while also satisfactorily modelling other attributes of AS networks already explained by existing models.

Abstract: Community detection is an important research topic in complex networks. We present the employment of a genetic algorithm to detect communities in complex networks which is based on optimizing network modularity. It does not need... more

Abstract: Community detection is an important research topic in complex networks. We present the employment of a genetic algorithm to detect communities in complex networks which is based on optimizing network modularity. It does not need any prior knowledge about the number of communities. Its performance is tested on two real life networks with known community structures and a set of synthetic networks. As the performance measure an information theoretical metric variation of information is used. The results are promising ...

Assessing the importance of transportation facilities is an increasingly growing topic of interest to federal and state transportation agencies. In the wake of recent terrorist attacks and recurring manmade and natural disasters,... more

Assessing the importance of transportation facilities is an increasingly growing topic of interest to federal and state transportation agencies. In the wake of recent terrorist attacks and recurring manmade and natural disasters, significant steps are needed to improve security at both state and metropolitan level. This paper proposes a heuristic procedure using concepts of complex networks science to assess the importance of highway transportation networks using travel time as the performance measure to assess criticality. We demonstrate the proposed technique both in a theoretical network (Sioux Falls network) and in a built-up network to assess the criticality of the major infrastructures that are used to access Manhattan in an AM peak hour. The results demonstrate the efficacy of the procedure to determine critical links in a transportation network.

The emergence of self-similarity and modularity in complex networks raises the fun- damental question of the growth process according to which these structures evolve. The possibility of a unique growth mechanism for biological networks,... more

The emergence of self-similarity and modularity in complex networks raises the fun- damental question of the growth process according to which these structures evolve. The possibility of a unique growth mechanism for biological networks, WWW and the Internet is of interest to the specialist and the laymen alike, as it promises to uncover the universal origins of collective behavior. Here,

Most methods proposed to uncover communities in complex networks rely on their structural properties. Here we introduce the stability of a network partition, a measure of its quality defined in terms of the statistical properties of a... more

Most methods proposed to uncover communities in complex networks rely on their structural properties. Here we introduce the stability of a network partition, a measure of its quality defined in terms of the statistical properties of a dynamical process taking place on the graph. The time-scale of the process acts as an intrinsic parameter that uncovers community structures at different resolutions. The stability extends and unifies standard notions for community detection: modularity and spectral partitioning can be seen as limiting cases of our dynamic measure. Similarly, recently proposed multi-resolution methods correspond to linearisations of the stability at short times. The connection between community detection and Laplacian dynamics enables us to establish dynamically motivated stability measures linked to distinct null models. We apply our method to find multi-scale partitions for different networks and show that the stability can be computed efficiently for large networks ...

Abstract—This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to... more

Abstract—This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node fail-ures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, dis-tributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and ...

A large variety of access network technologies and architectures that provide wide service portfolio to the customer are available for the network operators. Each of the potential access network architectures and technologies varies in... more

A large variety of access network technologies and architectures that provide wide service portfolio to the customer are available for the network operators. Each of the potential access network architectures and technologies varies in complexity, network functionality, services supported and overall network costs. A detailed comparison of the economic viability of different access network scenarios is crucial for operators due to the high cost of this network segment. This paper identifies all essential elements of a general framework for the techno-economic analysis of different access network technologies and architectures, as well as describes some specific issues/problems related to the techno-economic evaluation of next generation (NG) access networks. The goal is to have at operator's disposal a methodology allowing the techno-economic comparison of the proposed access network solutions and their introduction/rollout.

This paper presents a simple representation of traffic on a highway with a single entrance and exit. The representation can be used to predict traffic's evolution over time and space, including transient phenomena such as the... more

This paper presents a simple representation of traffic on a highway with a single entrance and exit. The representation can be used to predict traffic's evolution over time and space, including transient phenomena such as the building, propagation and dissipation of queues. The easy-to-solve difference equations used to predict traffic's evolution are shown to be the discrete analog of the differential equations arising from a special case of the hydrodynamic model of traffic flow. The proposed method automatically generates appropriate changes in density at locations where the hydrodynamic theory would call for a shockwave; i.e. a jump in density such as those typically seen at the end of every queue. The complex side calculations required by classical methods to keep track of shockwaves are thus eliminated. The paper also shows how the equations can mimic the real-life development of stop-and-go traffic within moving queues. The model predicts that the oscillation patter...

This article presents results from the first statistically significant study of cost escalation in transportation infrastructure projects. Based on a sample of 258 transportation infrastructure projects worth US$90 billion and... more

This article presents results from the first statistically significant study of cost escalation in transportation infrastructure projects. Based on a sample of 258 transportation infrastructure projects worth US$90 billion and representing different project types, geographical regions, and historical periods, it is found with overwhelming statistical significance that the cost estimates used to decide whether such projects should be built are highly and systematically misleading. Underestimation cannot be explained by error and is best explained by strategic misrepresentation, that is, lying. The policy implications are clear: legislators, administrators, investors, media representatives, and members of the public who value honest numbers should not trust cost estimates and cost-benefit analyses produced by project promoters and their analysts.

The Vol.4,2019 of International Journal of Mathematical Combinatorics.