Generation of networks with prescribed degree-dependent clustering

被引:0
|
作者
Chrysanthos E. Gounaris
Karthikeyan Rajendran
Ioannis G. Kevrekidis
Christodoulos A. Floudas
机构
[1] Princeton University,Department of Chemical and Biological Engineering
[2] Princeton University,Program in Applied and Computational Mathematics
来源
Optimization Letters | 2011年 / 5卷
关键词
Networks; Graph theory; Mathematical optimization; Clustering;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:435 / 451
页数:16
相关论文
共 50 条
  • [41] The Global Mean First-Passage Time for Degree-Dependent Random Walks in a Class of Fractal Scale-Free Trees
    Gao, Long
    Peng, Junhao
    Tang, Chunming
    Xu, Qiuxia
    Chen, Qi
    FRACTAL AND FRACTIONAL, 2024, 8 (11)
  • [42] Efficient and simple generation of random simple connected graphs with prescribed degree sequence
    Viger, Fabien
    Latapy, Matthieu
    JOURNAL OF COMPLEX NETWORKS, 2016, 4 (01) : 15 - 37
  • [43] Efficient and simple generation of random simple connected graphs with prescribed degree sequence
    Viger, F
    Latapy, M
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 440 - 449
  • [44] Polymerization degree-dependent changes in the effects of in vitro chitosan treatments on photosynthetic pigment, protein, and dry matter contents of Ipomoea purpurea
    Acemi, Ruhiye Kiran
    Acemi, Arda
    EUROBIOTECH JOURNAL, 2019, 3 (04): : 197 - 202
  • [45] Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
    Wu, CW
    PHYSICS LETTERS A, 2005, 346 (04) : 281 - 287
  • [46] Roles of clustering properties for degree-mixing pattern networks
    Yu, Pei
    Guo, Qiang
    Li, Ren-De
    Han, Jing-Ti
    Liu, Jian-Guo
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2017, 28 (03):
  • [47] Mechanisms for tuning clustering and degree-correlations in directed networks
    Kashyap, G.
    Ambika, G.
    JOURNAL OF COMPLEX NETWORKS, 2018, 6 (05) : 767 - 787
  • [48] A simple model for complex networks with arbitrary degree distribution and clustering
    Handcock, Mark S.
    Morris, Martina
    STATISTICAL NETWORK ANALYSIS: MODELS, ISSUES, AND NEW DIRECTIONS, 2007, 4503 : 103 - +
  • [49] A Spatial Approach to Network Generation for Three Properties: Degree Distribution, Clustering Coefficient and Degree Assortativity
    Badham, Jennifer
    Stocker, Rob
    JASSS-THE JOURNAL OF ARTIFICIAL SOCIETIES AND SOCIAL SIMULATION, 2010, 13 (01):
  • [50] IDEALS WITH PRESCRIBED DEGREE OF GOODNESS
    KEISLER, HJ
    ANNALS OF MATHEMATICS, 1965, 81 (01) : 112 - &