Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

International Journal of Intelligent Computing and Cybernetics

Volumn 2, Issue 2, 2009, Pages 243-284

  Mitavskiy, Boris ^a   Rowe, Jonathan ^b   Cannings, Chris ^c  

^a BIOINFORMATICS INSTITUTE   (Singapore)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Communication; Optimization

Indexed keywords

BUSINESS NETWORKS; DESIGN/METHODOLOGY/APPROACH; ERGODICITY; ERGODICS; FORMAL FRAMEWORK; LOCAL SEARCH ALGORITHM; LOCAL SEARCH STRATEGY; MATHEMATICAL FRAMEWORKS; NETWORK COMMUNICATIONS; NON-ZERO PROBABILITY; PREFERENTIAL ATTACHMENTS; SCALE-FREE;

COMMUNICATION; LEARNING ALGORITHMS; OPTIMIZATION; WORLD WIDE WEB;

SET THEORY;

EID: 78549238266     PISSN: 1756378X     EISSN: 17563798     Source Type: Journal    
DOI: 10.1108/17563780910959893     Document Type: Article

References (28)

1. Aldous, D. and Fill, J. (2002), available at: www.stat.berkeley.edu/aldous/RWG/book.html, Reversible Markov Chains and Random Walks on Graphs.
2. Anshelevich, E., Dasgupta, A., Tardos, E. and Wexler, T. (2003), Near optimal network design with selfish agents, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), San Diego, CA, USA, pp. 511-20.
3. Bala, V. and Goyal, S. (2000), A noncooperative model of network formation, Econometrica, Vol. 68, pp. 1181-230.
4. Barabási, A.-L. (2001), The physics of the web, Physics World, Vol. 14, No.33.
5. Cannings, C. and Sheehan, N. (2002), On a misconception about irreducubility of the single-site Gibb's sampler in a pedigree application, Genetics, Vol. 162, pp. 993-6.
6. Chu, D. (2008), The evolution of group-level pathogenic traits, Journal of Theoretical Biology, Vol. 253, No.2, pp. 355-62.
7. Chu, D. (2009), Modes of evolution in a parasite-host interaction: disentangling factors determining the evolution of regulated fimbriation in E. coli, Biosystems, Vol. 95, No.1, pp. 67-74.
8. Doar, M. (1996), A better mode for generating test networks, Proceedings of the Global Telecommunication Conference (GLOBECOM'96), London, UK, pp. 86-95.
9. Fabrikant, A., Luthra, A., Maneva, E. and Papadimitriou, C. (2003), On a network creation game, Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC '03), Boston, MA, USA, pp. 347-51.
10. Garey, M. and Johnson, D. (1979), Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, NY.
11. Geman, S. and Geman, D. (1984), Stochastic relaxation, Gibbs distribution and Bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 6, pp. 721-41.
12. Gomory, R. and Hu, T. (1969), Multiterminal network flows, SIAM Journal on Applied Mathematics, Vol. 9, pp. 551-70.
13. Hajek, B. (1982), Hitting time and occupation time bounds implied by drift analysis with applications, Advances in Applied Probability, Vol. 14, pp. 502-25.
14. He, J. and Yao, X. (2004), A study of drift analysis for estimating computation time of evolutionary algorithms, Natural Computing: An International Journal, Vol. 3, No.1, pp. 21-35.
15. Hu, T. (1974), Optimum communication spanning trees, SIAM Journal on Computing, Vol. 3, No.3, pp. 188-95.
16. Jansen, T. and Theile, M. (2007), Stability in the self-organized evolution of networks, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 931-8, ACM Press, New York, NY.
17. Lehmann, K. and Kaufmann, M. (2005), Evolutionary algorithms for the self-organized evolution of networks, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005), Washington, DC, USA, pp. 563-70.
18. Mitavskiy, B. and Rowe, J. (2005), A schema-based version of Geiringer's theorem for nonlinear genetic programming with homologous crossover, Lecture Notes in Computer Science, Wright, A.H., Vose, M.D., de Jong, K.A., Schmitt, L.M. (Eds.), Foundations of Genetic Algorithms 8 (FOGA 2008), Vol. 3469, pp. 156-75, Springer, Berlin.
19. Mitavskiy, B. and Rowe, J. (2006a), An extension of Geiringer theorem for a wide class of evolutionary search algorithms, Evolutionary Computation, Vol. 14, No.1, pp. 87-118.
20. Mitavskiy, B. and Rowe, J. (2006b), Some results about the Markov chains associated to GPs and general EAs, Theoretical Computer Science, Vol. 361, No.1, pp. 72-110.
21. Motwani, R. and Raghavan, P. (1995), Randomized Algorithms, Cambridge University Press, New York, NY.
22. Nisan, N. (1999), Algorithms for selfish agents: mechanism design for distributed computation, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), Vol. 1563, pp. 1-17, Springer, Berlin.
23. Rodionov, A. and Choo, H. (2003), On generating random network structures: connected graphs, Computational Science (ICCS 2003), pp. 1611-3349.
24. Sheehan, N. and Thomas, A. (1993), On the irreducibility of a Markov chain defined on a space of genotypic configurations by a sampling scheme, Biometrics, Vol. 49, pp. 163-75.
25. Syski, R. (1992), Passage Times for Markov Chains, IOS Press, Amsterdam.
26. Toh, C. (1996), Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs, Proceedings of the IEEE Conference on Computer Communications (INFO-COM'96), March, pp. 1386-7.
27. Watts, D. (2004), Small Worlds: The dynamics of Networks between Order and Randomness, Princeton University Press, Princeton, NJ.
28. Waxman, B. (1993), Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, Vol. 9, pp. 1617-22.