No Arabic abstract
What is a complex network? How do we characterize complex networks? Which systems can be studied from a network approach? In this text, we motivate the use of complex networks to study and understand a broad panoply of systems, ranging from physics and biology to economy and sociology. Using basic tools from statistical physics, we will characterize the main types of networks found in nature. Moreover, the most recent trends in network research will be briefly discussed.
We suggest an underlying mechanism that governs the growth of a network of concepts, a complex network that reflects the connections between different scientific concepts based on their co-occurrences in publications. To this end, we perform empirical analysis of a network of concepts based on the preprints in physics submitted to the arXiv.org. We calculate the network characteristics and show that they cannot follow as a result of several simple commonly used network growth models. In turn, we suggest that a simultaneous account of two factors, i.e., growth by blocks and preferential selection, gives an explanation of empirically observed properties of the concepts network. Moreover, the observed structure emerges as a synergistic effect of these both factors: each of them alone does not lead to a satisfactory picture.
Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.
This is a brief review of some of the basic concepts of perturbative QCD, including infrared safety and factorization, relating them to more familiar ideas from quantum mechanics and relativity. It is intended to offer perspective on methods and terms whose use is commonplace, but whose physical origins are sometimes obscure.
The growth of world population, limitation of resources, economic problems and environmental issues force engineers to develop increasingly efficient solutions for logistic systems. Pure optimization for efficiency, however, has often led to technical solutions that are vulnerable to variations in supply and demand, and to perturbations. In contrast, nature already provides a large variety of efficient, flexible and robust logistic solutions. Can we utilize biological principles to design systems, which can flexibly adapt to hardly predictable, fluctuating conditions? We propose a bio-inspired BioLogistics approach to deduce dynamic organization processes and principles of adaptive self-control from biological systems, and to transfer them to man-made logistics (including nanologistics), using principles of modularity, self-assembly, self-organization, and decentralized coordination. Conversely, logistic models can help revealing the logic of biological processes at the systems level.
Community structure is one of the most important features of real networks and reveals the internal organization of the nodes. Many algorithms have been proposed but the crucial issue of testing, i.e. the question of how good an algorithm is, with respect to others, is still open. Standard tests include the analysis of simple artificial graphs with a built-in community structure, that the algorithm has to recover. However, the special graphs adopted in actual tests have a structure that does not reflect the real properties of nodes and communities found in real networks. Here we introduce a new class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes. We use this new benchmark to test two popular methods of community detection, modularity optimization and Potts model clustering. The results show that the new benchmark poses a much more severe test to algorithms than standard benchmarks, revealing limits that may not be apparent at a first analysis.