A Method for Design of a Growing Complex Network

SUMMARY A complex network design method that finds a desired network structure can be a powerful tool in large‐scale system design. Conventional complex network design methods tackle only static networks, that is, they do not consider growth of the target network. In this paper, we propose a new met...

Full description

Saved in:
Bibliographic Details
Published in:Electronics and communications in Japan 2014-01, Vol.97 (1), p.70-81
Main Authors: Mizuno, Haruki, Okamoto, Takashi, Koakutsu, Seiichi, Hirata, Hironori
Format: Article
Language:English
Subjects:
complex network
Design engineering
growing network
Joints
Mathematical analysis
Mathematical models
multi-objective genetic algorithm
multi-objective optimization
network design
Networks
Online
Optimization
Systems design
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c3662-a0989d46eaf1e3d0743a8b93cc879dd0b7feca99eefa1fa5c51309c934ce6b643
container_end_page 81
container_issue 1
container_start_page 70
container_title Electronics and communications in Japan
container_volume 97
creator Mizuno, Haruki
Okamoto, Takashi
Koakutsu, Seiichi
Hirata, Hironori
description SUMMARY A complex network design method that finds a desired network structure can be a powerful tool in large‐scale system design. Conventional complex network design methods tackle only static networks, that is, they do not consider growth of the target network. In this paper, we propose a new method for the design of a growing complex network. First, we consider evaluation functions which quantitatively represent the characteristics of desired structures by using feature quantities. Then, we formulate the design problem of a growing complex network as a multi‐objective optimization problem in order to determine the connection targets of new nodes by using the evaluation functions. By solving the problem, we grow the network, thus obtaining the desired network. We try to generate networks which have the desired clustering coefficient and average path length concurrently. Through numerical experiments, we confirm that the proposed method is effective as a method for the design of growing complex networks. © 2013 Wiley Periodicals, Inc. Electron Comm Jpn, 97(1): 70–81, 2014; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.10382
doi_str_mv 10.1002/ecj.10382
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1629357469</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1629357469</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3662-a0989d46eaf1e3d0743a8b93cc879dd0b7feca99eefa1fa5c51309c934ce6b643</originalsourceid><addsrcrecordid>eNp1kEtTwjAURjOOzojown-QpS4qSZOmzZJBxAfi-Bpn3GRCeoOFQjApA_x7q1V2ru63OOcuDkKnlFxQQuIOmGk9WBbvoRaVPI5kwun-bjN2iI5CmBIieMJZC5Euvofqw-XYOo8vIRSTBXYWazzwbl0sJrjn5ssSNngE1dr52TE6sLoMcPJ72-j1qv_Su46GD4ObXncYGSZEHGkiM5lzAdpSYDlJOdPZWDJjslTmORmnFoyWEsBqanViEsqINJJxA2IsOGujs-bv0rvPFYRKzYtgoCz1AtwqKCpiyZKUC1mj5w1qvAvBg1VLX8y13ypK1HcVVVdRP1VqttOw66KE7f-g6vdu_4yoMYpQwWZnaD9TImVpot5GAyXvnt6fM5KoR_YFT0pxOA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1629357469</pqid></control><display><type>article</type><title>A Method for Design of a Growing Complex Network</title><source>Business Source Ultimate【Trial: -2024/12/31】【Remote access available】</source><source>Wiley-Blackwell Read &amp; Publish Collection</source><creator>Mizuno, Haruki ; Okamoto, Takashi ; Koakutsu, Seiichi ; Hirata, Hironori</creator><creatorcontrib>Mizuno, Haruki ; Okamoto, Takashi ; Koakutsu, Seiichi ; Hirata, Hironori</creatorcontrib><description>SUMMARY A complex network design method that finds a desired network structure can be a powerful tool in large‐scale system design. Conventional complex network design methods tackle only static networks, that is, they do not consider growth of the target network. In this paper, we propose a new method for the design of a growing complex network. First, we consider evaluation functions which quantitatively represent the characteristics of desired structures by using feature quantities. Then, we formulate the design problem of a growing complex network as a multi‐objective optimization problem in order to determine the connection targets of new nodes by using the evaluation functions. By solving the problem, we grow the network, thus obtaining the desired network. We try to generate networks which have the desired clustering coefficient and average path length concurrently. Through numerical experiments, we confirm that the proposed method is effective as a method for the design of growing complex networks. © 2013 Wiley Periodicals, Inc. Electron Comm Jpn, 97(1): 70–81, 2014; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.10382</description><identifier>ISSN: 1942-9533</identifier><identifier>EISSN: 1942-9541</identifier><identifier>DOI: 10.1002/ecj.10382</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc., A Wiley Company</publisher><subject>complex network ; Design engineering ; growing network ; Joints ; Mathematical analysis ; Mathematical models ; multi-objective genetic algorithm ; multi-objective optimization ; network design ; Networks ; Online ; Optimization ; Systems design</subject><ispartof>Electronics and communications in Japan, 2014-01, Vol.97 (1), p.70-81</ispartof><rights>2013 Wiley Periodicals, Inc.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c3662-a0989d46eaf1e3d0743a8b93cc879dd0b7feca99eefa1fa5c51309c934ce6b643</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Mizuno, Haruki</creatorcontrib><creatorcontrib>Okamoto, Takashi</creatorcontrib><creatorcontrib>Koakutsu, Seiichi</creatorcontrib><creatorcontrib>Hirata, Hironori</creatorcontrib><title>A Method for Design of a Growing Complex Network</title><title>Electronics and communications in Japan</title><addtitle>Electron. Comm. Jpn</addtitle><description>SUMMARY A complex network design method that finds a desired network structure can be a powerful tool in large‐scale system design. Conventional complex network design methods tackle only static networks, that is, they do not consider growth of the target network. In this paper, we propose a new method for the design of a growing complex network. First, we consider evaluation functions which quantitatively represent the characteristics of desired structures by using feature quantities. Then, we formulate the design problem of a growing complex network as a multi‐objective optimization problem in order to determine the connection targets of new nodes by using the evaluation functions. By solving the problem, we grow the network, thus obtaining the desired network. We try to generate networks which have the desired clustering coefficient and average path length concurrently. Through numerical experiments, we confirm that the proposed method is effective as a method for the design of growing complex networks. © 2013 Wiley Periodicals, Inc. Electron Comm Jpn, 97(1): 70–81, 2014; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.10382</description><subject>complex network</subject><subject>Design engineering</subject><subject>growing network</subject><subject>Joints</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>multi-objective genetic algorithm</subject><subject>multi-objective optimization</subject><subject>network design</subject><subject>Networks</subject><subject>Online</subject><subject>Optimization</subject><subject>Systems design</subject><issn>1942-9533</issn><issn>1942-9541</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp1kEtTwjAURjOOzojown-QpS4qSZOmzZJBxAfi-Bpn3GRCeoOFQjApA_x7q1V2ru63OOcuDkKnlFxQQuIOmGk9WBbvoRaVPI5kwun-bjN2iI5CmBIieMJZC5Euvofqw-XYOo8vIRSTBXYWazzwbl0sJrjn5ssSNngE1dr52TE6sLoMcPJ72-j1qv_Su46GD4ObXncYGSZEHGkiM5lzAdpSYDlJOdPZWDJjslTmORmnFoyWEsBqanViEsqINJJxA2IsOGujs-bv0rvPFYRKzYtgoCz1AtwqKCpiyZKUC1mj5w1qvAvBg1VLX8y13ypK1HcVVVdRP1VqttOw66KE7f-g6vdu_4yoMYpQwWZnaD9TImVpot5GAyXvnt6fM5KoR_YFT0pxOA</recordid><startdate>201401</startdate><enddate>201401</enddate><creator>Mizuno, Haruki</creator><creator>Okamoto, Takashi</creator><creator>Koakutsu, Seiichi</creator><creator>Hirata, Hironori</creator><general>Wiley Subscription Services, Inc., A Wiley Company</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201401</creationdate><title>A Method for Design of a Growing Complex Network</title><author>Mizuno, Haruki ; Okamoto, Takashi ; Koakutsu, Seiichi ; Hirata, Hironori</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3662-a0989d46eaf1e3d0743a8b93cc879dd0b7feca99eefa1fa5c51309c934ce6b643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>complex network</topic><topic>Design engineering</topic><topic>growing network</topic><topic>Joints</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>multi-objective genetic algorithm</topic><topic>multi-objective optimization</topic><topic>network design</topic><topic>Networks</topic><topic>Online</topic><topic>Optimization</topic><topic>Systems design</topic><toplevel>online_resources</toplevel><creatorcontrib>Mizuno, Haruki</creatorcontrib><creatorcontrib>Okamoto, Takashi</creatorcontrib><creatorcontrib>Koakutsu, Seiichi</creatorcontrib><creatorcontrib>Hirata, Hironori</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Electronics and communications in Japan</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mizuno, Haruki</au><au>Okamoto, Takashi</au><au>Koakutsu, Seiichi</au><au>Hirata, Hironori</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Method for Design of a Growing Complex Network</atitle><jtitle>Electronics and communications in Japan</jtitle><addtitle>Electron. Comm. Jpn</addtitle><date>2014-01</date><risdate>2014</risdate><volume>97</volume><issue>1</issue><spage>70</spage><epage>81</epage><pages>70-81</pages><issn>1942-9533</issn><eissn>1942-9541</eissn><abstract>SUMMARY A complex network design method that finds a desired network structure can be a powerful tool in large‐scale system design. Conventional complex network design methods tackle only static networks, that is, they do not consider growth of the target network. In this paper, we propose a new method for the design of a growing complex network. First, we consider evaluation functions which quantitatively represent the characteristics of desired structures by using feature quantities. Then, we formulate the design problem of a growing complex network as a multi‐objective optimization problem in order to determine the connection targets of new nodes by using the evaluation functions. By solving the problem, we grow the network, thus obtaining the desired network. We try to generate networks which have the desired clustering coefficient and average path length concurrently. Through numerical experiments, we confirm that the proposed method is effective as a method for the design of growing complex networks. © 2013 Wiley Periodicals, Inc. Electron Comm Jpn, 97(1): 70–81, 2014; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.10382</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc., A Wiley Company</pub><doi>10.1002/ecj.10382</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1942-9533
ispartof Electronics and communications in Japan, 2014-01, Vol.97 (1), p.70-81
issn 1942-9533
1942-9541
language eng
recordid cdi_proquest_miscellaneous_1629357469
source Business Source Ultimate【Trial: -2024/12/31】【Remote access available】; Wiley-Blackwell Read & Publish Collection
subjects complex network
Design engineering
growing network
Joints
Mathematical analysis
Mathematical models
multi-objective genetic algorithm
multi-objective optimization
network design
Networks
Online
Optimization
Systems design
title A Method for Design of a Growing Complex Network
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T05%3A12%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Method%20for%20Design%20of%20a%20Growing%20Complex%20Network&rft.jtitle=Electronics%20and%20communications%20in%20Japan&rft.au=Mizuno,%20Haruki&rft.date=2014-01&rft.volume=97&rft.issue=1&rft.spage=70&rft.epage=81&rft.pages=70-81&rft.issn=1942-9533&rft.eissn=1942-9541&rft_id=info:doi/10.1002/ecj.10382&rft_dat=%3Cproquest_cross%3E1629357469%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c3662-a0989d46eaf1e3d0743a8b93cc879dd0b7feca99eefa1fa5c51309c934ce6b643%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1629357469&rft_id=info:pmid/&rfr_iscdi=true