Vida Vukašinović: Redundant binary representations with rigorous trade-off between connectivity and locality

Date of publication: 6. 12. 2020
Discrete mathematics seminar
Torek, 8. 12. 2020, ob 10:15, na daljavo

Join Zoom Meeting

Meeting ID: 973 0040 7489
Passcode: 602471

Povzetek. Kimura's theory of neutral evolution has inspired researchers from evolutionary computation community to use representations with neutrality with a hope that neutral networks can help improving search quality by establishing alternative paths for the evolution of population. The effects of neutrality on evolutionary search have been considering substantial attention in number of studies, however the results are many times contradictory.

In this work we attempt to shed some light on neutrality by designing a general mathematical framework of redundant binary representations that are easy to apply for evolutionary algorithms and are efficient with respect to several measures such as synonymity, connectivity, and locality. The proposed representations are easy to scale for any problem dimension and any level of neutrality. For a given problem dimension and level of neutrality, they can exhibit different values of connectivity and locality.


All the participants are also invited to join the Algebraic Graph Theory International Webinar, also on December 8th 2020 at 7pm Central European Time, for the next presentation delivered by Joy Morris.

She will speak on Graphs that are Cayley on more than one group.

Join Zoom Meeting at
Meeting ID: 958 3586 3635
Passcode: 235813

Further details may be found at