Results 271 to 280 of about 10,677,913 (302)
Some of the next articles are maybe not open access.
The Complexity of Terrorist Networks
2008 12th International Conference Information Visualisation, 2008Complexity science affords a number of novel tools for examining terrorism, particularly network analysis and NK-Boolean fitness landscapes. The following paper explores various aspects of terrorist networks which can be illuminated through applications of non-linear dynamical systems modeling to terrorist network structures. Of particular interest are
openaire +2 more sources
Controllability of complex networks
Nature, 2011The ultimate proof of our understanding of natural or technological systems is reflected in our ability to control them. Although control theory offers mathematical tools for steering engineered and natural systems towards a desired state, a framework to control complex self-organized systems is lacking.
Yang-Yu, Liu +2 more
openaire +2 more sources
2018
[Excerpt] In recent years, the emergence of a large amount of data dispersed in several types of databases enabled the extraction of information on a never seen scale. Complex networks allow the connection of a vast amount of scattered and unstructured data in order to understand relations, construct models for their interpretation, analyze structures,
openaire +2 more sources
[Excerpt] In recent years, the emergence of a large amount of data dispersed in several types of databases enabled the extraction of information on a never seen scale. Complex networks allow the connection of a vast amount of scattered and unstructured data in order to understand relations, construct models for their interpretation, analyze structures,
openaire +2 more sources
Advances in Complex Systems, 2009
This topical issue features regular submissions to Advances in Complex Systems focusing on ‘Complex Networks’ from different perspectives. They have been selected by the editors to appear together in this issue, to highlight current research trends. ‘Complex Networks’ is a booming research area for quite a few years now.
Enrico Scalas, Frank Schweitzer
openaire +3 more sources
This topical issue features regular submissions to Advances in Complex Systems focusing on ‘Complex Networks’ from different perspectives. They have been selected by the editors to appear together in this issue, to highlight current research trends. ‘Complex Networks’ is a booming research area for quite a few years now.
Enrico Scalas, Frank Schweitzer
openaire +3 more sources
Clustering in Complex Networks
2004Real, mostly socially rooted networks have the tendency to form the simplest morphological structures observable: triangles, or in other words mutually linked triples of nodes. This is captured by the concept of clustering. We review a few milestones in the quantitative description of this feature, together with selected models that reproduce certain ...
Szabó, G, Alava, M J, Kertész, János
openaire +2 more sources
On the Complexity of Network Synchronization
SIAM Journal on Computing, 2004We show that if a minimal-time solution to a fundamental distributed computation primitive, synchronizing a network path of finite-state processors, exists on the three-dimensional, undirected grid, then we can conclude the purely complexity-theoretic result P=NP. Every previous result on network synchronization for various network topologies either
Darin Goldstein, Kojiro Kobayashi
openaire +3 more sources
Correlations in Complex Networks
2007This book is the culmination of three years of research effort on a multidisciplinary project in which physicists, mathematicians, computer scientists and social scientists worked together to arrive at a unifying picture of complex networks. The contributed chapters form a reference for the various problems in data analysis visualization and modeling ...
Serrano Moral, Maria Angeles +3 more
openaire +3 more sources
On the network complexity of selection
30th Annual Symposium on Foundations of Computer Science, 1989The sequential complexity of determining the kth largest out of a given set of n keys is known to be linear. Thus, given a p-processor parallel machine, it is asked whether or not an O(n/p) selection algorithm can be devised for that machine. An Omega ((n/p) log log p+log p) lower bound is obtained for selection on any network that satisfies a ...
openaire +1 more source
Provisioning in complex networks
Bell Labs Technical Journal, 2007IP Multimedia Subsystem (IMS) solutions emphasize services including all-Internet Protocol (IP) voice, data, video, multimedia, and other user-centric services. IMS applications allow network convergence among wireline, wireless, and packet networks and interaction of services in disparate, multivendor, multitechnology networks. This increased level of
openaire +1 more source
Complex-network-based traffic network analysis and dynamics: A comprehensive review
Physica A: Statistical Mechanics and Its Applications, 2022Zhaoxia Guo +2 more
exaly