Dominating Scale-Free Networks Using Generalized Probabilistic Methods
نویسندگان
چکیده
منابع مشابه
Dominating Scale-Free Networks Using Generalized Probabilistic Methods
We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for applications. We propose two novel probabilistic dominating set selection strategies that are applicable to heterogeneous networks. One of them obtains the smallest p...
متن کاملProbabilistic prediction in scale-free networks: diameter changes.
In complex systems, responses to small perturbations are too diverse to definitely predict how much they would be, and then such diverse responses can be predicted in a probabilistic way. Here we study such a problem in scale-free networks, for example, the diameter changes by the deletion of a single vertex for various in silico and real-world scale-free networks. We find that the diameter cha...
متن کاملGeneralized entropies and open random and scale-free networks
We propose the concept of open network as an arbitrary selection of nodes of a large unknown network. Using the hypothesis that information of the whole network structure can be extrapolated from an arbitrary set of its nodes, we use Rényi mutual entropies in different qorders to establish the minimum critical size of a random set of nodes that represents reliably the information of the main ne...
متن کاملPaths to globally generalized synchronization in scale-free networks.
We apply the auxiliary-system approach to study paths to globally generalized synchronization in scale-free networks of identical chaotic oscillators, including Hénon maps, logistic maps, and Lorentz oscillators. As the coupling strength epsilon between nodes of the network is increased, transitions from partially to globally generalized synchronization and intermittent behaviors near the synch...
متن کاملExactly scale-free scale-free networks
Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2014
ISSN: 2045-2322
DOI: 10.1038/srep06308