NK景观流域连通性的网络分析
The Connectivity of NK Landscapes' Basins: A Network Analysis
摘要:
我们提出了一个网络表征的组合健身景观适应的概念,提出了能量表面的固有网络。我们以著名的NK景观家族为例。在我们的例子中,固有网络是这样一个图,其中顶点代表景观中的局部最大值,而边则说明了它们相应的吸引盆之间的转移概率。我们详尽地提取了这样的网络代表性的小NK景观的情况下,并进行了统计特征的属性。我们发现,这些网络属性中的大多数可以与具有不同K值的底层NK景观上的搜索难度相关。
英文摘要:
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of NK landscapes as an example. In our case the inherent network is the graph where the vertices represent the local maxima in the landscape, and the edges account for the transition probabilities between their corresponding basins of attraction. We exhaustively extracted such networks on representative small NK landscape instances, and performed a statistical characterization of their properties. We found that most of these network properties can be related to the search difficulty on the underlying NK landscapes with varying values of K.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。