Graph theory provides a primary tool for analyzing and designing computer communication networks. In the past few decades, Graph theory has been used to study various types of networks, including the Internet, wide Area Networks, Local Area Networks, and networking protocols such as border Gateway Protocol, Open shortest Path Protocol, and Networking Networks. In this paper, we present some key...

We consider the problem of determining how similar two networks, without known node-correspondences, are. This problem occurs frequently in real-world applications like transfer learning and change detection. Many network similarity measures exist, and it is unclear how one might select from amongst them. We provide the first empirical study on the relationships between different network simila...

This paper focuses on the seemingly routine but essential aspects of network formation by actors in an E-government context. A qualitative case study is used to explore portal development in public healthcare. The theoretical framework applied is Actor-Network Theory (ANT). The research question is: What factors contribute to the enrolment of strategic local actors in technology development in ...

The development of modern information technologies permits to collect and to analyze huge amounts of statistical data in different spheres of life. The main problem is not to only to collect but to process all relevant information. The purpose of our work is to show the example of intelligent data analysis in such complex and non-formalized field as science. Using the statistical data about sci...

We analyze the growth models for complex networks including preferential attachment (A.-L. Barabasi and R. Albert, Science 286, 509 (1999)) and fitness model (Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002)) and demonstrate that, under very general conditions, these two models yield the same dynamic equation of network growth, dK dt = A(t)(K +K0), where A(t) is the aging constant, K is th...

In this first chapter, we give an introduction to random graphs and complex networks. We discuss examples of realworld networks and their empirical properties, and give a brief introduction to the kinds of models that we investigate in this book. Further, we introduce the notation used throughout the book.

We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport thr...

This paper analyses the impact of random failure or attack on the public transit networks of London and Paris in a comparative study. In particular we analyze how the dysfunction or removal of sets of stations or links (rails, roads, etc.) affects the connectivity properties within these networks. We show how accumulating dysfunction leads to emergent phenomena that cause the transportation sys...

In events that are composed by many activities, there is a problem that involves retrieve and management the information of visitors that are visiting the activities. This management is crucial to find some activities that are drawing attention of visitors; identify an ideal positioning for activities; which path is more frequented by visitors. In this work, these features are studied using Com...

I will introduce some basic concepts of network theory, in particular the small-worldness and how the communication is though to flow in networks. Then, I will motivate and introduce the concept of communicability. I will show the way to formulate this concept mathematically. I will show a few applications of this concept in different areas, such as material sciences, human brain diseases and b...