Detecting different topologies immanent in scale-free networks with the same degree distribution

Abstract

The scale-free (SF) property is a major concept in complex networks, and it is based on the definition that an SF network has a degree distribution that follows a power-law (PL) pattern. This paper highlights that not all networks with a PL degree distribution arise through a Barabási−Albert (BA) preferential attachment growth process, a fact that, although evident from the literature, is often overlooked by many researchers. For this purpose, it is demonstrated, with simulations, that established measures of network topology do not suffice to distinguish between BA networks and other (random-like and latticelike) SF networks with the same degree distribution. Additionally, it is examined whether an existing self-similarity metric proposed for the definition of the SF property is also capable of distinguishing different SF topologies with the same degree distribution. To contribute to this discrimination, this paper introduces a spectral metric, which is shown to be more capable of distinguishing between different SF topologies with the same degree distribution, in comparison with the existing metrics.network science | Barabási−Albert networks | preferential attachment | pattern recognition | power-law degree distribution

A network-based method with privacy-preserving for identifying influential providers in large healthcare service systems

“…If the absolute value of the difference between the longitudes of two nodes, i.e., |X i -X j |, and the absolute value of the difference between the latitudes, i.e., |Y i -Y j |, are both within a certain range, then the two providers are considered potential neighbors; see Eq. (2).…”

“…Networks provide a useful abstraction of the structures of many complex systems, ranging from social systems and computer networks to biological networks and physical systems. Much research has been conducted to extract insights from network data especially based on the topology of networks [2].…”

Network stiffness: A new topological property in complex networks

“…An exemption from this pattern of negative analogy is the variable f (CC) of the clustering coefficient (CC) attribute, which is positively correlated with S (EIG) and Σ S/E , obviously due to the inverse definition if CC (see Table 2). Overall, the significant correlations observed for pairs (Φ T , S (EIG)) and (Φ T , Σ S/E ) imply that the force-alike concept of network stiffness is effective to be used as a measure of network topology because it includes at the same time information related to node stability, to the spectral configuration of the network due to its relevance with eigenvector centrality [5], and to the socioeconomic framework of the GTN s . This can be especially useful for multidisciplinary research in complex networks, because the force-alike measures of stiffness capture information that is not restricted to the reference attribute X but they include broader information about the spectral and socioeconomic configuration of the network.…”

“…Research in complex networks had diachronically the merit to be multidisciplinary, which obviously contributed to the evolution of this scientific field into an emerging academic discipline, the so-called network science (NS) [1,2]. Provided that synthesis is a major perspective for multidisciplinary modeling, the synthetic approach has also been proven fruitful in the study of complex networks [3–5]. Some indicative examples are the conceptualization of the preferential attachment mechanism [5,6] by statisticians [7], which emerged from the study of species per genus of flowering plants, the conceptualization of the small-world phenomenon by sociologists [8], which was introduced during social experiments of forwarding mails worldwide along groups of personal connections, the conceptualization of spatial networks from physicists and geographers [4], the conceptualization of visibility graphs by applied mathematicians [9], who introduced a method of transforming a time-series into a complex network, and many others.…”

Modeling and Forecasting the COVID-19 Temporal Spread in Greece: An Exploratory Approach Based on Complex Network Defined Splines

“…Transforming a time-series to a complex network is a modern approach that recently became popular with the emergence of network science in various fields of research [26,38,39]. The most popular method to transform a complex network to a time-series is the visibility graph algorithm that was proposed by [25], which became dominant due to its intuitive conceptualization.…”