Introduction

Drugs are at the centre of a complexly entangled web of science, politics, economics and culture. They are the product of scientific in- novation, and are usually brought to the bedside by private com- panies, following regulations issued by national and international authorities. These regulations are in turn the product of health poli- cies usually reflecting local cultures and ideologies

Number of loops of size h in growing scale-free networks

The hierarchical structure of scale-free networks has been investigated focusing on the scaling of the number $N_h(t)$ of loops of size h as a function of the system size. In particular we have found the analytic expression for the scaling of $N_h(t)$ in the Barab\'asi-Albert (BA) scale-free network. We have performed numerical simulations on the scaling law for $N_h(t)$ in the BA network and in other growing scale free networks, such as the bosonic network (BN) and the aging nodes (AN) network. We show that in the bosonic network and in the aging node network the phase transitions in the topology of the network are accompained by a change in the scaling of the number of loops with the system size.Comment: 4 pages, 3 figure

Computation of the conformal algebra of 1+3 decomposable spacetimes

The conformal algebra of a 1+3 decomposable spacetime can be computed from the conformal Killing vectors (CKV) of the 3-space. It is shown that the general form of such a 3-CKV is the sum of a gradient CKV and a Killing or homothetic 3-vector. It is proved that spaces of constant curvature always admit such conformal Killing vectors. As an example, the complete conformal algebra of a G\"odel-type spacetime is computed. Finally it is shown that this method can be extended to compute the conformal algebra of more general non-decomposable spacetimes.Comment: 15 pages Latex, no figures. Minor mistakes correcte

Quantitative description and modeling of real networks

In this letter we present data analysis and modeling of two particular cases of study in the field of growing networks. We analyze WWW data set and authorship collaboration networks in order to check the presence of correlation in the data. The results are reproduced with a pretty good agreement through a suitable modification of the standard AB model of network growth. In particular, intrinsic relevance of sites plays a role in determining the future degree of the vertex.Comment: 4 pages, 3 figure

Diversification and limited information in the Kelly game

Financial markets, with their vast range of different investment opportunities, can be seen as a system of many different simultaneous games with diverse and often unknown levels of risk and reward. We introduce generalizations to the classic Kelly investment game [Kelly (1956)] that incorporates these features, and use them to investigate the influence of diversification and limited information on Kelly-optimal portfolios. In particular we present approximate formulas for optimizing diversified portfolios and exact results for optimal investment in unknown games where the only available information is past outcomes.Comment: 11 pages, 4 figure

Analysis of weighted networks

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such weighted networks, which are often perceived as being harder to analyze than their unweighted counterparts. Here we point out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighted graphs to weighted ones as well. We give a number of examples of the method, including an algorithm for detecting community structure in weighted networks and a new and simple proof of the max-flow/min-cut theorem.Comment: 9 pages, 3 figure

The Conformal Penrose Limit and the Resolution of the pp-curvature Singularities

We consider the exact solutions of the supergravity theories in various dimensions in which the space-time has the form M_{d} x S^{D-d} where M_{d} is an Einstein space admitting a conformal Killing vector and S^{D-d} is a sphere of an appropriate dimension. We show that, if the cosmological constant of M_{d} is negative and the conformal Killing vector is space-like, then such solutions will have a conformal Penrose limit: M^{(0)}_{d} x S^{D-d} where M^{(0)}_{d} is a generalized d-dimensional AdS plane wave. We study the properties of the limiting solutions and find that M^{(0)}_{d} has 1/4 supersymmetry as well as a Virasoro symmetry. We also describe how the pp-curvature singularity of M^{(0)}_{d} is resolved in the particular case of the D6-branes of D=10 type IIA supergravity theory. This distinguished case provides an interesting generalization of the plane waves in D=11 supergravity theory and suggests a duality between the SU(2) gauged d=8 supergravity of Salam and Sezgin on M^{(0)}_{8} and the d=7 ungauged supergravity theory on its pp-wave boundary.Comment: 20 pages, LaTeX; typos corrected, journal versio

Analysis of Neighbourhoods in Multi-layered Dynamic Social Networks

Social networks existing among employees, customers or users of various IT systems have become one of the research areas of growing importance. A social network consists of nodes - social entities and edges linking pairs of nodes. In regular, one-layered social networks, two nodes - i.e. people are connected with a single edge whereas in the multi-layered social networks, there may be many links of different types for a pair of nodes. Nowadays data about people and their interactions, which exists in all social media, provides information about many different types of relationships within one network. Analysing this data one can obtain knowledge not only about the structure and characteristics of the network but also gain understanding about semantic of human relations. Are they direct or not? Do people tend to sustain single or multiple relations with a given person? What types of communication is the most important for them? Answers to these and more questions enable us to draw conclusions about semantic of human interactions. Unfortunately, most of the methods used for social network analysis (SNA) may be applied only to one-layered social networks. Thus, some new structural measures for multi-layered social networks are proposed in the paper, in particular: cross-layer clustering coefficient, cross-layer degree centrality and various versions of multi-layered degree centralities. Authors also investigated the dynamics of multi-layered neighbourhood for five different layers within the social network. The evaluation of the presented concepts on the real-world dataset is presented. The measures proposed in the paper may directly be used to various methods for collective classification, in which nodes are assigned to labels according to their structural input features.Comment: 16 pages, International Journal of Computational Intelligence System

Cliques and duplication-divergence network growth

A population of complete subgraphs or cliques in a network evolving via duplication-divergence is considered. We find that a number of cliques of each size scales linearly with the size of the network. We also derive a clique population distribution that is in perfect agreement with both the simulation results and the clique statistic of the protein-protein binding network of the fruit fly. In addition, we show that such features as fat-tail degree distribution, various rates of average degree growth and non-averaging, revealed recently for only the particular case of a completely asymmetric divergence, are present in a general case of arbitrary divergence.Comment: 7 pages, 6 figure