ﻻ يوجد ملخص باللغة العربية
A defining feature of many large empirical networks is their intrinsic complexity. However, many networks also contain a large degree of structural repetition. An immediate question then arises: can we characterize essential network complexity while excluding structural redundancy? In this article we utilize inherent network symmetry to collapse all redundant information from a network, resulting in a coarse-graining which we show to carry the essential structural information of the `parent network. In the context of algebraic combinatorics, this coarse-graining is known as the emph{quotient}. We systematically explore the theoretical properties of network quotients and summarize key statistics of a variety of `real-world quotients with respect to those of their parent networks. In particular, we find that quotients can be substantially smaller than their parent networks yet typically preserve various key functional properties such as complexity (heterogeneity and hubs vertices) and communication (diameter and mean geodesic distance), suggesting that quotients constitute the essential structural skeleton of their parent network. We summarize with a discussion of potential uses of quotients in analysis of biological regulatory networks and ways in which using quotients can reduce the computational complexity of network algorithms.
This paper explores a variety of strategies for understanding the formation, structure, efficiency and vulnerability of water distribution networks. Water supply systems are studied as spatially organized networks for which the practical applications
Predicting the future evolution of complex systems is one of the main challenges in complexity science. Based on a current snapshot of a network, link prediction algorithms aim to predict its future evolution. We apply here link prediction algorithms
We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich--club connectivity are preserved. We consider three real networks, the AS--Internet, the protein interaction and the scientific co
Power Grids and other delivery networks has been attracted some attention by the network literature last decades. Despite the Power Grids dynamics has been controlled by computer systems and human operators, the static features of this type of networ
In this paper we prove that the etale sheafification of the functor arising from the quotient of an algebraic supergroup by a closed subsupergroup is representable by a smooth superscheme.