<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-17T15:55:22Z</responseDate>
  <request identifier="23567" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:23567</identifier>
        <datestamp>2025-07-28T05:57:18Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Drawing and Recolouring</dc:title>
          <dc:creator>Jacobs, Bart</dc:creator>
          <dc:creator>Széles, Márk</dc:creator>
          <dc:subject>Markov-chain</dc:subject>
          <dc:subject>Urn model</dc:subject>
          <dc:subject>Multiset</dc:subject>
          <dc:description>Drawing a ball from an urn filled with balls of different colours is one of the basic models in probability theory. The probability of drawing a ball of a particular colour is determined by the proportion / fraction of balls of that colour. This paper introduces a new stochastic model for such urns: draw a ball, recolour (repaint) it, and put it back into the urn. One can distinguish four modes of drawing-and-recolouring, namely whether done proportionally or uniformly (both for drawing and recolouring). These modes can be reformulated in financial terms as redistribution of wealth or in biological terms as evolutionary drift. The resulting four operations form a coalgebra for the distribution monad, on the set of multisets of a fixed size. In fact they form a Markov chain and even a hidden Markov model, in combination with the frequentist learning map as emission channel. This paper identifies fixed points, capturing stable situations, for these four modes of drawing-and-recolouring.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Bart Jacobs and Márk Széles</dc:contributor>
          <dc:date>2025</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 342, 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.CALCO.2025.8</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-235674</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2025.8</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
