Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLocal structure of directed networks
228
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Previous work on undirected small-world networks established the paradigm that locally structured networks tend to have high density of short loops. On the other hand, many realistic networks are directed. Here we investigate the local organization of directed networks and find, surprisingly, that real networks often have very few short loops as compared to random models. We develop a theory and derive conditions for determining if a given network has more or less loops than its randomized counterpart. These findings carry broad implications for structural and dynamical processes sustained by directed networks.
rate research
Read More
We introduce and analyze a model of a multi-directed Eulerian network, that is a directed and weighted network where a path exists that passes through all the edges of the network once and only once. Networks of this type can be used to describe information networks such as human language or DNA chains. We are able to calculate the strength and degree distribution in this network and find that they both exhibit a power law with an exponent between 2 and 3. We then analyze the behavior of the accelerated version of the model and find that the strength distribution has a double slope power law behavior. Finally we introduce a non-Eulerian version of the model and find that the statistical topological properties remain unchanged. Our analytical results are compared with numerical simulations.
It has been shown recently that a specific class of path-dependent stochastic processes, which reduce their sample space as they unfold, lead to exact scaling laws in frequency and rank distributions. Such Sample Space Reducing processes (SSRP) offer an alternative new mechanism to understand the emergence of scaling in countless processes. The corresponding power law exponents were shown to be related to noise levels in the process. Here we show that the emergence of scaling is not limited to the simplest SSRPs, but holds for a huge domain of stochastic processes that are characterized by non-uniform prior distributions. We demonstrate mathematically that in the absence of noise the scaling exponents converge to $-1$ (Zipfs law) for almost all prior distributions. As a consequence it becomes possible to fully understand targeted diffusion on weighted directed networks and its associated scaling laws law in node visit distributions. The presence of cycles can be properly interpreted as playing the same role as noise in SSRPs and, accordingly, determine the scaling exponents. The result that Zipfs law emerges as a generic feature of diffusion on networks, regardless of its details, and that the exponent of visiting times is related to the amount of cycles in a network could be relevant for a series of applications in traffic-, transport- and supply chain management.
The complexity of many biological, social and technological systems stems from the richness of the interactions among their units. Over the past decades, a great variety of complex systems has been successfully described as networks whose interacting pairs of nodes are connected by links. Yet, in face-to-face human communication, chemical reactions and ecological systems, interactions can occur in groups of three or more nodes and cannot be simply described just in terms of simple dyads. Until recently, little attention has been devoted to the higher-order architecture of real complex systems. However, a mounting body of evidence is showing that taking the higher-order structure of these systems into account can greatly enhance our modeling capacities and help us to understand and predict their emerging dynamical behaviors. Here, we present a complete overview of the emerging field of networks beyond pairwise interactions. We first discuss the methods to represent higher-order interactions and give a unified presentation of the different frameworks used to describe higher-order systems, highlighting the links between the existing concepts and representations. We review the measures designed to characterize the structure of these systems and the models proposed in the literature to generate synthetic structures, such as random and growing simplicial complexes, bipartite graphs and hypergraphs. We introduce and discuss the rapidly growing research on higher-order dynamical systems and on dynamical topology. We focus on novel emergent phenomena characterizing landmark dynamical processes, such as diffusion, spreading, synchronization and games, when extended beyond pairwise interactions. We elucidate the relations between higher-order topology and dynamical properties, and conclude with a summary of empirical applications, providing an outlook on current modeling and conceptual frontiers.
The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets of nodes having the same $H(n)$, within the annealed network approximation. The connection between the Hirsch indices and the degree is highlighted. Numerical tests in synthetic uncorrelated networks and real-world correlated ones validate the findings. We also test the use of the Hirsch index for the identification of influential spreaders in networks, finding that it is in general outperformed by the recently introduced Non-Backtracking centrality.
We explore depth measures for flow hierarchy in directed networks. We define two measures -- rooted depth and relative depth, and discuss differences between them. We investigate how the two measures behave in random Erdos-Renyi graphs of different sizes and densities and explain obtained results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
