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 条
  • [21] Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi-Albert Networks with Degree-Dependent Guilt Mechanism
    Wang Xian-Jia
    Quan Ji
    Liu Wei-Bing
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2012, 57 (05) : 897 - 903
  • [22] Relations, models and a memetic approach for three degree-dependent spanning tree problems
    Cerrone, C.
    Cerulli, R.
    Raiconi, A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (03) : 442 - 453
  • [23] A Degree-Dependent Polynomial-Based Reciprocally Convex Matrix Inequality and Its Application to Stability Analysis of Delayed Neural Networks
    Wang, Chen-Rui
    Long, Fei
    Xie, Ke-You
    Wang, Hui-Ting
    Zhang, Chuan-Ke
    He, Yong
    IEEE TRANSACTIONS ON CYBERNETICS, 2024, 54 (07) : 4164 - 4176
  • [24] Network resilience against intelligent attacks constrained by the degree-dependent node removal cost
    Annibale, A.
    Coolen, A. C. C.
    Bianconi, G.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2010, 43 (39)
  • [25] A novel saturation degree-dependent adaptive event-triggered control for systems with asymmetric saturation
    Li, Hongchao
    Jiang, Qiancheng
    Liu, Jiao
    ASIAN JOURNAL OF CONTROL, 2025, 27 (02) : 716 - 727
  • [26] Generation and analysis of networks with a prescribed degree sequence and subgraph family: Higher-order structure matters
    Ritchie M.
    Berthouze L.
    Kiss I.Z.
    Kiss, Istvan Z. (I.Z.Kiss@sussex.ac.uk), 2017, Oxford University Press (05) : 1 - 31
  • [27] The generation of random directed networks with prescribed 1-node and 2-node degree correlations
    Zamora-Lopez, Gorka
    Zhou, Changsong
    Zlatic, Vinko
    Kurths, Juergen
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2008, 41 (22)
  • [28] Geometric randomization of real networks with prescribed degree sequence
    Starnini, Michele
    Ortiz, Elisenda
    Serrano, M. Angeles
    NEW JOURNAL OF PHYSICS, 2019, 21 (05)
  • [29] Premixing degree-dependent reaction mechanisms of premixed Ni/Al nanolaminates under shock loading
    Xie, Yifan
    Zhu, Kexin
    Xue, Fengning
    Shao, Jian-Li
    Chen, Pengwan
    PHYSICS OF FLUIDS, 2024, 36 (08)
  • [30] Generating bipartite networks with a prescribed joint degree distribution
    Boroojeni A.A.
    Dewar J.
    Wu T.
    Hyman J.M.
    Boroojeni, Asma Azizi (aazizibo@tulane.edu), 1600, Oxford University Press (05): : 839 - 857