%0 Conference Paper %1 yu:2004:nue:tyu %A Yu, Tina %B GECCO 2004 Workshop Proceedings %C Seattle, Washington, USA %D 2004 %E Poli, R. %E Cagnoni, S. %E Keijzer, M. %E Costa, E. %E Pereira, F. %E Raidl, G. %E Upton, S. C. %E Goldberg, D. %E Lipson, H. %E de Jong, E. %E Koza, J. %E Suzuki, H. %E Sawai, H. %E Parmee, I. %E Pelikan, M. %E Sastry, K. %E Thierens, D. %E Stolzmann, W. %E Lanzi, P. L. %E Wilson, S. W. %E O'Neill, M. %E Ryan, C. %E Yu, T. %E Miller, J. F. %E Garibay, I. %E Holifield, G. %E Wu, A. S. %E Riopka, T. %E Meysenburg, M. M. %E Wright, A. W. %E Richter, N. %E Moore, J. H. %E Ritchie, M. D. %E Davis, L. %E Roy, R. %E Jakiela, M. %K algorithms, cartesian genetic programming programming, %T ``Six Degrees of Separation'' in Boolean Function Networks with Neutrality %U http://www.cs.bham.ac.uk/~wbl/biblio/gecco2004/WNUE003.pdf %X We analyse two Boolean function networks with different degrees of neutrality. The results show that the one with explicit neutrality is a small-world network where each pair of possible solutions has a short distance and most of the possible solutions are highly clustered. These network structural properties owe their existence to the ``short cuts'' introduced by redundant genes in the genotypes. We explain some important small-world network structures, such as clusters, hubs and power law link distribution. These properties have potential to be useful in designing efficient evolutionary algorithms to navigate search in the network.

@inproceedings{yu:2004:nue:tyu, abstract = {We analyse two Boolean function networks with different degrees of neutrality. The results show that the one with explicit neutrality is a small-world network where each pair of possible solutions has a short distance and most of the possible solutions are highly clustered. These network structural properties owe their existence to the ``short cuts'' introduced by redundant genes in the genotypes. We explain some important small-world network structures, such as clusters, hubs and power law link distribution. These properties have potential to be useful in designing efficient evolutionary algorithms to navigate search in the network.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Seattle, Washington, USA}, author = {Yu, Tina}, biburl = {https://www.bibsonomy.org/bibtex/254894301b162b8782df762e20a28c95d/brazovayeye}, booktitle = {GECCO 2004 Workshop Proceedings}, editor = {Poli, R. and Cagnoni, S. and Keijzer, M. and Costa, E. and Pereira, F. and Raidl, G. and Upton, S. C. and Goldberg, D. and Lipson, H. and {de Jong}, E. and Koza, J. and Suzuki, H. and Sawai, H. and Parmee, I. and Pelikan, M. and Sastry, K. and Thierens, D. and Stolzmann, W. and Lanzi, P. L. and Wilson, S. W. and O'Neill, M. and Ryan, C. and Yu, T. and Miller, J. F. and Garibay, I. and Holifield, G. and Wu, A. S. and Riopka, T. and Meysenburg, M. M. and Wright, A. W. and Richter, N. and Moore, J. H. and Ritchie, M. D. and Davis, L. and Roy, R. and Jakiela, M.}, interhash = {1f08df573e78b40fc1be0e19f0f1f147}, intrahash = {54894301b162b8782df762e20a28c95d}, keywords = {algorithms, cartesian genetic programming programming,}, month = {26-30 June}, notes = {GECCO-2004WKS Distributed on CD-ROM at GECCO-2004 3 bit parity, XOR}, size = {12 pages}, timestamp = {2008-06-19T17:55:03.000+0200}, title = {``Six Degrees of Separation'' in Boolean Function Networks with Neutrality}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2004/WNUE003.pdf}, year = 2004 }