2011 IEEE Network Science Workshop 2011
DOI: 10.1109/nsw.2011.6004642
|View full text |Cite
|
Sign up to set email alerts
|

Generating scale-free networks with adjustable clustering coefficient via random walks

Abstract: Abstract-This paper presents an algorithm for generating scale-free networks with adjustable clustering coefficient. The algorithm is based on a random walk procedure combined with a triangle generation scheme which takes into account genetic factors; this way, preferential attachment and clustering control are implemented using only local information. Simulations are presented which support the validity of the scheme, characterizing its tuning capabilities.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
2
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(20 citation statements)
references
References 41 publications
0
20
0
Order By: Relevance
“…To do this, we first created a scale-free network (Supplementary Figure 4) using the algorithm of Herrera and Zufiria [18], and verified that the degree of connectivity follows the power law as expected in such a network ( P ( k ) ~ k −2.03 ). Next we allocated 150 differentially expressed proteins in local subnetworks (see Supplementary Information) so that these proteins are network neighbors with one another.…”
Section: Methodsmentioning
confidence: 99%
“…To do this, we first created a scale-free network (Supplementary Figure 4) using the algorithm of Herrera and Zufiria [18], and verified that the degree of connectivity follows the power law as expected in such a network ( P ( k ) ~ k −2.03 ). Next we allocated 150 differentially expressed proteins in local subnetworks (see Supplementary Information) so that these proteins are network neighbors with one another.…”
Section: Methodsmentioning
confidence: 99%
“…First, the traditional BA model does not produce the requisite levels of transitivity present in observed social networks (Ravasz and Barabási, 2003;Varga, 2015). Second, while M a n u s c r i p t modified versions of the BA model exist to try and make this property an adjustable parameter (Jin et al, 2001;Varga, 2015), as well as novel procedures to produce scale-free networks with tunable transitivity (Chakrabarti et al, 2017;Herrera and Zufiria, 2011), no method yet exists that accounts for the distribution of connection density in a way that mimics social networks, and/or allows for manipulation of that density measure beyond a narrow range. A key issue is that in large, scale-free human social networks, the local transitivity of an agent is inversely proportional to its number of connections, i.e.…”
Section: Network Architecture and Communicationmentioning
confidence: 99%
“…We envision this process as a post processing step where the graph is iteratively rewired until the desired values are achieved, in a hill climbing fashion. For similar techniques on this topic please refer to [8] and [20].…”
Section: Data Generationmentioning
confidence: 99%