Classes of preferential attachment and triangle preferential attachment models with power-law spectra

2019 ◽  
Vol 8 (4) ◽  
Author(s):  
Nicole Eikmeier ◽  
David F Gleich

Abstract Preferential attachment (PA) models are a common class of graph models which have been used to explain why power-law distributions appear in the degree sequences of real network data. Among other properties of real-world networks, they commonly have non-trivial clustering coefficients due to an abundance of triangles as well as power laws in the eigenvalue spectra. Although there are triangle PA models and eigenvalue power laws in specific PA constructions, there are no results that existing constructions have both. In this article, we present a specific Triangle Generalized Preferential Attachment Model that, by construction, has non-trivial clustering. We further prove that this model has a power law in both the degree distribution and eigenvalue spectra.

2020 ◽  
Vol 117 (26) ◽  
pp. 14812-14818 ◽  
Author(s):  
Bin Zhou ◽  
Xiangyi Meng ◽  
H. Eugene Stanley

Whether real-world complex networks are scale free or not has long been controversial. Recently, in Broido and Clauset [A. D. Broido, A. Clauset,Nat. Commun.10, 1017 (2019)], it was claimed that the degree distributions of real-world networks are rarely power law under statistical tests. Here, we attempt to address this issue by defining a fundamental property possessed by each link, the degree–degree distance, the distribution of which also shows signs of being power law by our empirical study. Surprisingly, although full-range statistical tests show that degree distributions are not often power law in real-world networks, we find that in more than half of the cases the degree–degree distance distributions can still be described by power laws. To explain these findings, we introduce a bidirectional preferential selection model where the link configuration is a randomly weighted, two-way selection process. The model does not always produce solid power-law distributions but predicts that the degree–degree distance distribution exhibits stronger power-law behavior than the degree distribution of a finite-size network, especially when the network is dense. We test the strength of our model and its predictive power by examining how real-world networks evolve into an overly dense stage and how the corresponding distributions change. We propose that being scale free is a property of a complex network that should be determined by its underlying mechanism (e.g., preferential attachment) rather than by apparent distribution statistics of finite size. We thus conclude that the degree–degree distance distribution better represents the scale-free property of a complex network.


2004 ◽  
Vol 18 (17n19) ◽  
pp. 2725-2729 ◽  
Author(s):  
NING DING ◽  
YOUGUI WANG ◽  
JUN XU ◽  
NING XI

We introduce preferential behavior into the study on statistical mechanics of money circulation. The computer simulation results show that the preferential behavior can lead to power laws on distributions over both holding time and amount of money held by agents. However, some constraints are needed in generation mechanism to ensure the robustness of power-law distributions.


2019 ◽  
Vol 56 (2) ◽  
pp. 416-440 ◽  
Author(s):  
István Fazekas ◽  
Csaba Noszály ◽  
Attila Perecsényi

AbstractA new network evolution model is introduced in this paper. The model is based on cooperations of N units. The units are the nodes of the network and the cooperations are indicated by directed links. At each evolution step N units cooperate, which formally means that they form a directed N-star subgraph. At each step either a new unit joins the network and it cooperates with N − 1 old units, or N old units cooperate. During the evolution both preferential attachment and uniform choice are applied. Asymptotic power law distributions are obtained both for in-degrees and for out-degrees.


2020 ◽  
Vol 117 (46) ◽  
pp. 28582-28588
Author(s):  
Thomas Gessey-Jones ◽  
Colm Connaughton ◽  
Robin Dunbar ◽  
Ralph Kenna ◽  
Pádraig MacCarron ◽  
...  

Network science and data analytics are used to quantify static and dynamic structures in George R. R. Martin’s epic novels,A Song of Ice and Fire, works noted for their scale and complexity. By tracking the network of character interactions as the story unfolds, it is found that structural properties remain approximately stable and comparable to real-world social networks. Furthermore, the degrees of the most connected characters reflect a cognitive limit on the number of concurrent social connections that humans tend to maintain. We also analyze the distribution of time intervals between significant deaths measured with respect to the in-story timeline. These are consistent with power-law distributions commonly found in interevent times for a range of nonviolent human activities in the real world. We propose that structural features in the narrative that are reflected in our actual social world help readers to follow and to relate to the story, despite its sprawling extent. It is also found that the distribution of intervals between significant deaths in chapters is different to that for the in-story timeline; it is geometric rather than power law. Geometric distributions are memoryless in that the time since the last death does not inform as to the time to the next. This provides measurable support for the widely held view that significant deaths inA Song of Ice and Fireare unpredictable chapter by chapter.


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
István Fazekas ◽  
Bettina Porvázsnyik

A random graph evolution mechanism is defined. The evolution studied is a combination of the preferential attachment model and the interaction of four vertices. The asymptotic behaviour of the graph is described. It is proved that the graph exhibits a power law degree distribution; in other words, it is scale-free. It turns out that any exponent in(2,∞)can be achieved. The proofs are based on martingale methods.


Author(s):  
M. E. J. Newman ◽  
R. G. Palmer

In chapters 2 to 4 we discussed several models of extinction which make use of ideas drawn from the study of critical phenomena. The primary impetus for this approach was the observation of apparent power-law distributions in a variety of statistics drawn from the fossil record, as discussed in section 1.2; in other branches of science such power laws are often indicators of critical processes. However, there are also a number of other mechanisms by which power laws can arise, including random multiplicative processes (Montroll and Shlesinger 1982; Sornette and Cont 1997), extremal random processes (Sibani and Littlewood 1993), and random barrier-crossing dynamics (Sneppen 1995). Thus the existence of power-law distributions in the fossil data is not on its own sufficient to demonstrate the presence of critical phenomena in extinction processes. Critical models also assume that extinction is caused primarily by biotic effects such as competition and predation, an assumption which is in disagreement with the fossil record. As discussed in section 1.2.2.1, all the plausible causes for specific prehistoric extinctions are abiotic in nature. Therefore an obvious question to ask is whether it is possible to construct models in which extinction is caused by abiotic environmental factors, rather than by critical fluctuations arising out of biotic interactions, but which still give power-law distributions of the relevant quantities. Such models have been suggested by Newman (1996, 1997) and by Manrubia and Paczuski (1998). Interestingly, both of these models are the result of attempts at simplifying models based on critical phenomena. Newman's model is a simplification of the model of Newman and Roberts (see section 3.6), which included both biotic and abiotic effects; the simplification arises from the realization that the biotic part can be omitted without losing the power-law distributions. Manrubia and Paczuski's model was a simplification of the connection model of Solé and Manrubia (see section 4.1), but in fact all direct species-species interactions were dropped, leaving a model which one can regard as driven only by abiotic effects. We discuss these models in turn. The model proposed by Newman (1996, 1997) has a fixed number N of species which in the simplest case are noninteracting.


2007 ◽  
Vol 18 (09) ◽  
pp. 1435-1442 ◽  
Author(s):  
XIANMIN GENG ◽  
GUANGHUI WEN

In this paper, we introduce the concept of intrinsic strength which is used to describe the node's intrinsic property. Furthermore, we present a single preferential attachment model for the evolution of weighted networks in which the network growth is coupled with dynamical evolution of weights and intrinsic strength. The model yields a nontrivial time evolution of nodes' properties and generalized power law distributions for the weight, strength and degree, as confirmed in many real networks. The numerical simulation results are in good agreement with the analytical expressions.


Fractals ◽  
2000 ◽  
Vol 08 (01) ◽  
pp. 73-83
Author(s):  
TOMOHIRO MATSUOKA ◽  
TOSHIHIDE UENO ◽  
TAKASHI ADACHI ◽  
MASAMI OKADA

Data with power law distributions are studied by a scaling argument. Then related weak lp sequences are characterized. As an application we can show in a transparent way that the wavelet de-noising theory holds under a mild assumption which is given by means of weak lp (quasi-)norms.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Zhimin Li ◽  
Zhaolin He ◽  
Chunhua Hu

We propose a kind of evolving network which shows tree structure. The model is a combination of preferential attachment model and uniform model. We show that the proportional degree sequencepkk>1obeys power law, exponential distribution, and other forms according to the relation ofkand parameterm.


Sign in / Sign up

Export Citation Format

Share Document