Generating Scale-free Networks with Adjustable Clustering Coefficient Via Random Walks
Data(s) |
2011
|
---|---|
Resumo |
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. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
spa |
Publicador |
E.T.S.I. Telecomunicación (UPM) |
Relação |
http://oa.upm.es/11723/1/INVE_MEM_2011_98020.pdf http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6004642 |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
Proceedings of Network Science Workshop (NSW), 2011 IEEE | Network Science Workshop (NSW), 2011 IEEE | 22/06/2011 - 24/06/2011 | West Point ,NY, EEUU |
Palavras-Chave | #Matemáticas #Informática |
Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |