TY - JOUR
T1 - Generation of networks with prescribed degree-dependent clustering
AU - Gounaris, Chrysanthos E.
AU - Rajendran, Karthikeyan
AU - Kevrekidis, Ioannis G.
AU - Floudas, Christodoulos A.
N1 - Funding Information:
Acknowledgments The work of I.G.K and K.R. was partially supported by the US DOE (DE-SC0002097) and DTRA (HDTRA1-07-1-0005). C.A.F. acknowledges support from the National Science Foundation (CBET-0827907).
PY - 2011/8
Y1 - 2011/8
N2 - We propose a systematic, rigorous mathematical optimization methodology for the construction, "on demand," of network structures that are guaranteed to possess a prescribed collective property: the degree-dependent clustering. The ability to generate such realizations of networks is important not only for creating artificial networks that can perform desired functions, but also to facilitate the study of networks as part of other algorithms. This problem exhibits large combinatorial complexity and is difficult to solve with off-the-shelf commercial optimization software. To that end, we also present a customized preprocessing algorithm that allows us to judiciously fix certain problem variables and, thus, significantly reduce computational times. Results from the application of the framework to data sets resulting from simulations of an acquaintance network formation model are presented.
AB - We propose a systematic, rigorous mathematical optimization methodology for the construction, "on demand," of network structures that are guaranteed to possess a prescribed collective property: the degree-dependent clustering. The ability to generate such realizations of networks is important not only for creating artificial networks that can perform desired functions, but also to facilitate the study of networks as part of other algorithms. This problem exhibits large combinatorial complexity and is difficult to solve with off-the-shelf commercial optimization software. To that end, we also present a customized preprocessing algorithm that allows us to judiciously fix certain problem variables and, thus, significantly reduce computational times. Results from the application of the framework to data sets resulting from simulations of an acquaintance network formation model are presented.
KW - Clustering
KW - Graph theory
KW - Mathematical optimization
KW - Networks
UR - http://www.scopus.com/inward/record.url?scp=79960148531&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960148531&partnerID=8YFLogxK
U2 - 10.1007/s11590-011-0319-x
DO - 10.1007/s11590-011-0319-x
M3 - Article
AN - SCOPUS:79960148531
SN - 1862-4472
VL - 5
SP - 435
EP - 451
JO - Optimization Letters
JF - Optimization Letters
IS - 3
ER -