{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T10:10:43Z","timestamp":1684059043026},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T00:00:00Z","timestamp":1191456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10710-007-9038-6","type":"journal-article","created":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T18:58:20Z","timestamp":1191437900000},"page":"109-123","source":"Crossref","is-referenced-by-count":8,"title":["Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm"],"prefix":"10.1007","volume":"9","author":[{"given":"Boris","family":"Mitavskiy","sequence":"first","affiliation":[]},{"given":"Jonathan E.","family":"Rowe","sequence":"additional","affiliation":[]},{"given":"Alden","family":"Wright","sequence":"additional","affiliation":[]},{"given":"Lothar M.","family":"Schmitt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,4]]},"reference":[{"key":"9038_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00406-0","volume":"259","author":"L. Schmitt","year":"2001","unstructured":"Schmitt, L.: Theory of genetic algorithms. Theor. Comput. Sci. 259, 1\u201361 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9038_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0304-3975(03)00393-1","volume":"310","author":"L. Schmitt","year":"2004","unstructured":"Schmitt, L.: Theory of genetic algorithms ii: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theor. Comput. Sci. 310, 181\u2013231 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9038_CR3","doi-asserted-by":"crossref","unstructured":"Vose, M.: The Simple Genetic Algorithm: Foundations and Theory. MIT Press (1999)","DOI":"10.7551\/mitpress\/6229.001.0001"},{"key":"9038_CR4","unstructured":"Coffey, S.: An Applied Probabilist\u2019s Guide to Genetic Algorithms. A Thesis Submitted to The University of Dublin for the degree of Master in Science (1999)"},{"issue":"1","key":"9038_CR5","first-page":"87","volume":"14","author":"B. Mitavskiy","year":"2006","unstructured":"Mitavskiy, B., Rowe, J.: An Extension of Geiringer Theorem for a wide class of evolutionary search algorithms. Evol. Comput. 14(1), 87\u2013118 (2006)","journal-title":"Evol. Comput."},{"key":"9038_CR6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/11513575_9","volume":"8","author":"B. Mitavskiy","year":"2005","unstructured":"Mitavskiy, B.: A schema-based version of Geiringer\u2019s Theorem for nonlinear Genetic Programming with homologous crossover. Found. Gen. Algorithms 8, 156\u2013175 Springer-Verlag (2005)","journal-title":"Found. Gen. Algorithms"},{"issue":"1","key":"9038_CR7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2006.04.006","volume":"361","author":"B. Mitavskiy","year":"2006","unstructured":"Mitavskiy, B., Rowe, J.: Some results about the Markov chains associated to GPs and general EAs. Theor. Comput. Sci. 361(1), 72\u2013110 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9038_CR8","unstructured":"Davis, T., Principe, J.: A simulated annealing like convergence theory for the simple genetic algorithm. In: Belew, R., Bookers, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 174\u2013181. Morgan Kaufmann (1991)"},{"issue":"1","key":"9038_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/3477.658583","volume":"28","author":"J. Suzuki","year":"1998","unstructured":"Suzuki, J.: A further result on the Markov chain model of genetic algorithm and its application to simulated annealing-like strategy. IEEE Trans. Syst. Man Cybernet. 28(1), 95\u2013102 (1998)","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"9038_CR10","doi-asserted-by":"crossref","unstructured":"Mitavskiy, B., Rowe, J., Wright, A., Schmitt, L.: Exploiting quotients of Markov chains to derive properties of the stationary distribution of the markov chain associated to an evolutionary algorithm. In: Simulated Evolution and Learning, Proceedings of SEAL 2006, Lecture Notes in Computer Science v. 4247, pp. 726\u2013733. Springer Verlag (2006)","DOI":"10.1007\/11903697_91"},{"key":"9038_CR11","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (unpublished book) (2001) http:\/\/www.stat.berkeley.edu\/"},{"key":"9038_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.tcs.2006.04.007","volume":"361","author":"J. Rowe","year":"2006","unstructured":"Rowe, J., Vose, M., Wright, A.: Differentiable coarse graining. Theor. Comput. Sci. 361, 111\u2013129 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9038_CR13","unstructured":"Spears, W., De Jong, K.: Analyzing GAs using Markov chain models with semantically ordered and lumped states. In: Belew, R., Vose, M. (eds.) Foundations of Genetic Algorithms 4, pp. 85\u2013100. Morgan Kaufmann (1997)"},{"key":"9038_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:NACO.0000023414.30362.8a","volume":"3","author":"C. Moey","year":"2004","unstructured":"Moey, C., Rowe, J.: Population aggregation based on fitness. Nat. Comput. 3, 5\u201319 (2004)","journal-title":"Nat. Comput."},{"key":"9038_CR15","unstructured":"Moey, C.: Investigating state aggregation for Markov models of genetic algorithms. Thesis, The University of Birmingham (2006)"},{"key":"9038_CR16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"N. Radcliffe","year":"1994","unstructured":"Radcliffe, N.: The algebra of genetic algorithms. Ann. Math. Artif. Intel. 10, 339\u2013384 (1994)","journal-title":"Ann. Math. Artif. Intel."},{"issue":"1","key":"9038_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1162\/evco.2004.12.1.19","volume":"12","author":"B. Mitavskiy","year":"2004","unstructured":"Mitavskiy, B.: Crossover invariant subsets of the search space for evolutionary algorithms. Evol. Comput. 12(1), 19\u201346 (2004)","journal-title":"Evol. Comput."},{"key":"9038_CR18","unstructured":"Antonisse, J.: A new interpretation of schema notation that overturns the binary encoding constraint. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 86\u201397. Morgan Kaufmann (1989)"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-007-9038-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-007-9038-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-007-9038-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T09:37:03Z","timestamp":1684057023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-007-9038-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9038"],"URL":"https:\/\/doi.org\/10.1007\/s10710-007-9038-6","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,4]]}}}