DocumentCode
3079561
Title
Generating scale-free networks with adjustable clustering coefficient via random walks
Author
Herrera, Carlos ; Zufiria, Pedro J.
Author_Institution
Depto. Mat. Aplic. a las Tecnol. de la Informacion, Univ. Politec. de Madrid, Madrid, Spain
fYear
2011
fDate
22-24 June 2011
Firstpage
167
Lastpage
172
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.
Keywords
complex networks; network theory (graphs); pattern clustering; adjustable clustering coefficient; genetic factors; random walk selection schemes; scale-free networks; triangle generation scheme; Analytical models; Barium; Erbium; Genetics; Mathematical model; Simulation; Social network services;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Science Workshop (NSW), 2011 IEEE
Conference_Location
West Point, NY
Print_ISBN
978-1-4577-1049-0
Type
conf
DOI
10.1109/NSW.2011.6004642
Filename
6004642
Link To Document