title: Hierarchy in directed random networks.
abstract: In recent years, the theory and application of complex networks have been quickly developing in a markable way due to the increasing amount of data from real systems and the fruitful application of powerful methods used in statistical physics. Many important characteristics of social or biological systems can be described by the study of their underlying structure of interactions. Hierarchy is one of these features that can be formulated in the language of networks. In this paper we present some (qualitative) analytic results on the hierarchical properties of random network models with zero correlations and also investigate, mainly numerically, the effects of different types of correlations. The behavior of the hierarchy is different in the absence and the presence of giant components. We show that the hierarchical structure can be drastically different if there are one-point correlations in the network. We also show numerical results suggesting that the hierarchy does not change monotonically with the correlations and there is an optimal level of nonzero correlations maximizing the level of hierarchy.
authors.affiliation: Department of Biological Physics, Eötvös Loránd University, Pázmány Péter Sétány 1/A, H-1117 Budapest, Hungary. enys@hal.elte.hu
authors.forename: Enys
authors.initials: E
authors.lastname: Mones
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D015233:Models, Statistical