2008
DOI: 10.1016/j.physa.2007.12.010
|View full text |Cite
|
Sign up to set email alerts
|

Connectivity degrees in the threshold preferential attachment model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 38 publications
0
6
0
Order By: Relevance
“…In other words, the degree distribution P(k) of a network measures the probability of finding a node with connectivity degree k in the network. Alternatively, the product NP(k) measures the average number of nodes in the network with a given connectivity degree k (Santiago and Benito, 2007b). Figure 5 shows the degree k histograms.…”
Section: Model Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In other words, the degree distribution P(k) of a network measures the probability of finding a node with connectivity degree k in the network. Alternatively, the product NP(k) measures the average number of nodes in the network with a given connectivity degree k (Santiago and Benito, 2007b). Figure 5 shows the degree k histograms.…”
Section: Model Resultsmentioning
confidence: 99%
“…In this model, we interpret porous soils as heterogeneous networks where pores are abstracted as nodes, characterized by their size and spatial location, and the links representing connections between them. The networks of pores are generated by a model known as the heterogeneous preferential attachment (HPA) (Santiago and Benito, 2007a, 2007b), a generalization of the Barabási-Albert model (Barabási and Albert, 1999) to heterogeneous networks. Developing an exhaustive analysis of the model, we obtained analytical solutions for the degree densities and degree distribution of the pore networks generated by the model approaching the limit of highest number of nodes (thermodynamic limit) and have shown that the networks can exhibit similar properties to those observed in other complex networks (Santiago and Benito, 2007a).…”
mentioning
confidence: 99%
“…There are many parameters and values that can be chosen to represent and analyze networks [6][7][8][21][22][23][24][25][26][27][28][29][30][31][32]. For our simplest possible semantic network we sought the minimal set of measures needed to distinguish between fictional and non-fictional written storytelling, and found the power law exponents γ 1 , γ 2 , γ 3 to be optimal.…”
Section: A Fitting Methods and Fisher's Linear Discriminantmentioning
confidence: 99%
“…Master equations for evolution model with birth and death are analyzed by Alvarez-Martı´nez et al 9 As for preferential attachment, popular strategies include fitness model, 10,11 attractiveness model, 12,13 energy-aware model, 6,[14][15][16] and threshold preferential attachment model. 17 Moreover, Jin et al 18 proposed a survival topology evolution model in consideration of node survivability. A local-world model based on random walk and policy attachment is presented by Jiang.…”
Section: Introductionmentioning
confidence: 99%