Update on ripple-spreading (or wave-spreading) representation scheme: Plans by the end of this year
Posted by xh28 on November 3, 2007
Just had some talks with Ezequiel, Lionel and Patricia, discussing how to push ahead the study on the ripple-spreading representation scheme. Basically, we have two lines to follow.
The first line is to study the potential of using this ripple-spreading representation scheme to model random networks. A good thing about this ripple-spreading model of random networks is: it may be a deterministic model as required, i.e., once a set of ripple-spreading related parameters are fixed, the resulted network topology will be unique. This is unlike many other complex network properties, such as degree distribution and preferential attachment, which can only roughly determine the category of the resulted network, but can not give a unique topology. Another thing is, this ripple-spreading model can easily integrate spatial factors, as well as temporal factors if required, into the network topology. Actually, one of Lionel’s suggestions is we should compare the ripple-spreading model with his spatial model of random networks, in order to better understand the mechanism and features of the ripple-spreading model. Last but not least, the new model is expected to be very friendly to the design of genetic algorithms (GAs) for optimizing network topology, because, owing to the deterministic ripple-spreading model of random networks, rather than to record the entire network connection information, a chromosome only needs to represent a few ripple-spreading related parameters, and, rather than to evolve the network topology directly, the GA only needs to evolve these parameters. This will probably result in a higher memory-efficiency, less feasibility problems, and a simpler design of evolutionary operators. Actually, to design a highly efficient GA to optimize network topology is an important motivation for studying the ripple-spreading model.
In the first stage, we will study a simple model with a few key ripple-spreading related parameters, such as epicentres of initial stimulating ripples, threshold of nodes, and amplifying factor of nodes. Two behaviours (being activated and being linked) and three sub-models (deterministic sub-model, semi-deterministic sub-model, and stochastic sub-model) will be initially investigated. Theoretical study and statistic analysis of the features of the model and the effects of the parameters will be the focus. We probably start with a fixed distribution of nodes, and then move onto random distribution of nodes. To do this work, I will collaborate with Ezequiel and Lionel, and also Seth, if you would like to : ), closely in the next few months.
Potential papers: I’m now working on a conference paper for the WCCI2008. This paper will explain the basic idea of the ripple-spreading model of random networks and the associated GA for network topology optimization. When we finish the work of the first stage, we plan to write a paper on the statistic features of the simple ripple-spreading model.
The second line is to apply the idea of combining binary GAs with a problem casting process based on the ripple-spreading scheme to a wide range of combinatory optimization problems. Of course those ATC (air traffic control) problems will be our first choice. Actually, work is now going on or will start soon to design some effective ripple-spreading GAs for aircraft arrival sequencing, airport gate assignment and airline route network management. Another case study of applying this ripple-spreading GA is to work with Patricia to see if it is of any use for constructing neural-networks.
Potential papers: There could be another conference paper for the WCCI2008, which will talk about the preliminary study of applying the ripple-spreading GA to the airport gate assignment problem. Probably, Patricia and I will do a co-authored paper on her study on the design of neural-networks.
Posted in Research Updates | No Comments »