The real world surrounding us is full of complex systems from various types and categories. Internet, the World Wide Web, biological and biochemical networks, transport networks, communication networks, and many others are a few examples of the many existing kinds and types of networks.
In this work we propose a model for the diffusion of information in a complex network. The main assumption of the model is that the information is initially located at certain nodes and then is disseminated, with occasional losses when traversing the edges, to the rest of the network.
In this paper we extend the concept of Competitivity Graph to compare series of rankings with ties ( partial rankings). We extend the usual method used to compute Kendall’s coefficient for two partial rankings to the concept of evolutive Kendall’s coefficient for a series of partial rankings.
The uniqueness of the Perron vector of a nonnegative block matrix associated to a multiplex network is discussed. The conclusions come from the relationships between the irreducibility of some nonnegative block matrix associated to a multiplex network and the irreducibility of the corresponding matrices to each layer as well as the irreducibility of the adjacency matrix of the projection network.
The current development of cloud computing is completely changing the paradigm of data knowledge extraction in huge databases. An example of this technology in the cardiac arrhythmia field is the SCOOP platform, a national-level scientific cloud-based big data service for implantable cardioverter defibrillators.
Nowadays, embedded systems are provided with cache memories that are large enough to influence in both performance and energy consumption as never occurred before in this kind of systems.