A Growing Complex Network Design Method
Haruki Mizuno, Takashi Okamoto, Seiichi Koakutsu, Hironori Hirata
Abstract
Open-access reader
Haruki Mizuno, Takashi Okamoto, Seiichi Koakutsu, Hironori Hirata
Abstract
Open-access reader
A complex network design method that finds a desired network structure can become one of strong tools in large-scale system designs. Conventional complex network design methods only tackle static networks, that is, they do not consider the growth of a target network. In this study, we propose a new growing complex network design method. First, let us consider evalution functions which quantitatively express characteristics of desired stuructures using feature quantities. Then, we formulate a growing complex network design problem as a multi-objective optimization problem in order to determine connection targets of a new node using the evaluation functions. Solving the problem, we grow the network, then, we obtain a desired network. We try to generate networks which have desired clustering coefficient and average path concurrently. Through numerical experiments, we confirmed the proposed method is effective as a growing complex network design method.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A complex network design method that finds a desired network structure can become one of strong tools in large-scale system designs. Conventional complex network design methods only tackle static networks, that is, they do not consider the growth of a target network. In this study, we propose a new growing complex network design method. First, let us consider evalution functions which quantitatively express characteristics of desired stuructures using feature quantities. Then, we formulate a growing complex network design problem as a multi-objective optimization problem in order to determine connection targets of a new node using the evaluation functions. Solving the problem, we grow the network, then, we obtain a desired network. We try to generate networks which have desired clustering coefficient and average path concurrently. Through numerical experiments, we confirmed the proposed method is effective as a growing complex network design method.
Key concepts: Complex network, Computer science, Network planning and design, Node (physics), Clustering coefficient, Path (computing), Average path length, Cluster analysis