Results 21 to 30 of about 504,897 (286)
A surrogate for networks—How scale-free is my scale-free network? [PDF]
Complex networks are now being studied in a wide range of disciplines across science and technology. In this paper we propose a method by which one can probe the properties of experimentally obtained network data. Rather than just measuring properties of a network inferred from data, we aim to ask how typical is that network?
Small, Michael +2 more
openaire +2 more sources
Subnets of scale-free networks are not scale-free: Sampling properties of networks [PDF]
Most studies of networks have only looked at small subsets of the true network. Here, we discuss the sampling properties of a network's degree distribution under the most parsimonious sampling scheme. Only if the degree distributions of the network and randomly sampled subnets belong to the same family of probability distributions is it possible to ...
Stumpf, MPH, Wiuf, Carsten, May, RM
openaire +3 more sources
Scale-Free Networks on Lattices [PDF]
We suggest a method for embedding scale-free networks, with degree distribution P(k) k^-lambda, in regular Euclidean lattices. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to an (Euclidean) distance xi which can ...
Rozenfeld, Alejandro F. +3 more
openaire +3 more sources
Scale-Free Networks Are Ultrasmall [PDF]
Latex, 4 pages, 2 eps figures, small corrections, added ...
Cohen, Reuven, Havlin, Shlomo
openaire +3 more sources
Traditional classification of real complex networks on biological, technological and social is incomplete, as there is a huge variety of artworks, which structure also can be presented in the form of networks.
Igor Alexeevich Yevin +3 more
doaj +1 more source
Impact of interaction style and degree on the evolution of cooperation on Barabási-Albert scale-free network. [PDF]
In this work, we study an evolutionary prisoner's dilemma game (PDG) on Barabási-Albert scale-free networks with limited player interactions, and explore the effect of interaction style and degree on cooperation.
Fengjie Xie, Jing Shi, Jun Lin
doaj +1 more source
Quasistatic scale-free networks [PDF]
A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node, the other end being connected to any other node with degree $k$ randomly selected with an attachment probability ...
Mukherjee, G., Manna, S. S.
openaire +3 more sources
Chimeralike oscillation modes in excitable scale-free networks
A topological mechanism of the emergence of chimeralike oscillation modes (CLOMs) consisting of coherent synchronous firings and incoherent nonsynchronous oscillations is proposed in excitable scale-free networks (ESFNs). It is revealed that the topology
Zhao Lei +5 more
doaj +1 more source
Excitable scale free networks [PDF]
When a simple excitable system is continuously stimulated by a Poissonian external source, the response function (mean activity versus stimulus rate) generally shows a linear saturating shape. This is experimentally verified in some classes of sensory neurons, which accordingly present a small dynamic range (defined as the interval of stimulus ...
Copelli, M., Campos, P. R. A.
openaire +2 more sources
Effective Gravitation Path Routing Strategy on Scale-Free Networks
Information routing strategy is a hot issue in the study of complex network traffic dynamics. In this paper, we define a new gravitational centrality and introduce parameter $\alpha _{1}$ to control the centrality of nodes.
Jinlong Ma +2 more
doaj +1 more source

