Results 41 to 50 of about 1,692,270 (273)
In practical application, the generation and evolution of many real networks always do not follow rigorous mathematical model, making network topology optimization a great challenge in the field of complex networks.
Feng Su +3 more
doaj +1 more source
Classification of scale-free networks [PDF]
While the emergence of a power-law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the betweenness centrality displays a power-law distribution with an exponent η, which is robust, and use it to classify the scale-free networks.
Goh, K.-I. +4 more
openaire +4 more sources
Robustness of preferential-attachment graphs
The widely used characterization of scale-free networks as “robust-yet-fragile” originates primarily from experiments on instances generated by preferential attachment.
Rouzbeh Hasheminezhad, Ulrik Brandes
doaj +1 more source
Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Construction
Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties.
Mikhail V. Tamm +2 more
doaj +1 more source
Scale-free network of earthquakes [PDF]
The district of southern California and Japan are divided into small cubic cells, each of which is regarded as a vertex of a graph if earthquakes occur therein. Two successive earthquakes define an edge and a loop, which replace the complex fault-fault interaction. In this way, the seismic data are mapped to a random graph.
Abe, Sumiyoshi, Suzuki, Norikazu
openaire +2 more sources
Synchronization in interacting Scale Free Networks [PDF]
We study the fluctuations of the interface, in the steady state, of the Surface Relaxation Model (SRM) in two scale free interacting networks where a fraction $q$ of nodes in both networks interact one to one through external connections. We find that as
Braunstein, L. A. +3 more
core +2 more sources
Simulation of scale-free networks [PDF]
In this paper, we present a new simulation tool for scale-free networks composed of a high number of nodes. The tool, based on discrete-event simulation, enables the definition of scale-free networks composed of heterogeneous nodes and complex application-level protocols.
D'ANGELO, GABRIELE, FERRETTI, STEFANO
openaire +2 more sources
Highly clustered scale-free networks [PDF]
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative correlation between the age of a node and its link attachment rate.
Klemm, Konstantin +1 more
openaire +5 more sources
Are scale-free networks robust to measurement errors?
Background Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false negative links in the observed networks, especially in biological networks ...
Zhao Hongyu, Lin Nan
doaj +1 more source
Geographical Embedding of Scale-Free Networks [PDF]
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links.
Albert +26 more
core +4 more sources

