<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Order statistics in population protocols via simple dynamics</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Niccolò</namePart>
  <namePart type="family">D&apos;Archivio</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Hind</namePart>
  <namePart type="family">Almahmoud</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Emanuele</namePart>
  <namePart type="family">Natale</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Frederik</namePart>
  <namePart type="family">Mallmann-Trenn</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">68748c44-84d5-11f1-b4f6-ca083374e553</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MoHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>PODC: Symposium on Principles of Distributed Computing</namePart>
</name>






<abstract lang="eng">We study simple dynamics in the population protocol model, in
which 𝑛 agents start with totally ordered initial opinions 𝑥1, 𝑥2, . . . ,
𝑥𝑛 and, in each round, a randomly chosen agent changes its opinion
as a function of the opinion of other randomly chosen agents. Such
dynamics often converge to consensus on a single fixation value 𝑋ˆ.
This paper asks how to control the distribution of 𝑋ˆ as a randomised
choice among the initial opinions by designing suitable simple
dynamics. Writing the sorted initial values as 𝑥(1) ≤ · · · ≤ 𝑥(𝑛)
,
we design two protocols that realise natural target laws over order
statistics.
First, for a parameter 𝑝 ∈ (0, 1), our geometric protocol biases
toward larger opinions and satisfies P

𝑋ˆ = 𝑥(𝑘)

∝ 𝑝
𝑛−𝑘
, for
𝑘 = 1, . . . , 𝑛. Equivalently, P

𝑋ˆ = 𝑥(𝑘)

= (1 − 𝑝)𝑝
𝑛−𝑘
/(1 − 𝑝
𝑛
).
Second, our binomial protocol assigns a shifted binomial law to the
ranks in ascending order: if 𝐾 −1 ∼ Bin(𝑛−1, 1−𝑝), then 𝑋ˆ = 𝑥(𝐾)
,
i.e., P

𝑋ˆ = 𝑥(𝑘)

=
𝑛−1
𝑘−1

𝑝
𝑛−𝑘
(1 − 𝑝)
𝑘−1
, for 𝑘 = 1, . . . , 𝑛.
Applications of this include computing the Top-𝑘 values for
small 𝑘 on general interaction graphs. A central contribution of
this work is that, in contrast to most population protocols, we can
characterise the fixation distribution in closed form. This is enabled
by a novel analysis technique, which also yields applications: we
derive new results for the Median protocol that extend the state of
the art.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_ACMPODC_dArchivio.pdf">https://research-explorer.ista.ac.at/download/22368/22379/2026_ACMPODC_dArchivio.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Association for Computing Machinery</publisher><dateIssued encoding="w3cdtf">2026</dateIssued><place><placeTerm type="text">Egham, United Kingdom</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</title></titleInfo>
  <identifier type="isbn">9798400725128</identifier><identifier type="doi">10.1145/3796701.3815922</identifier>
<part><extent unit="pages">425-436</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>N. D’Archivio, H. Almahmoud, E. Natale, F. Mallmann-Trenn, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 425–436.</short>
<ista>D’Archivio N, Almahmoud H, Natale E, Mallmann-Trenn F. 2026. Order statistics in population protocols via simple dynamics. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 425–436.</ista>
<apa>D’Archivio, N., Almahmoud, H., Natale, E., &amp;#38; Mallmann-Trenn, F. (2026). Order statistics in population protocols via simple dynamics. In &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt; (pp. 425–436). Egham, United Kingdom: Association for Computing Machinery. &lt;a href=&quot;https://doi.org/10.1145/3796701.3815922&quot;&gt;https://doi.org/10.1145/3796701.3815922&lt;/a&gt;</apa>
<ama>D’Archivio N, Almahmoud H, Natale E, Mallmann-Trenn F. Order statistics in population protocols via simple dynamics. In: &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;. Association for Computing Machinery; 2026:425-436. doi:&lt;a href=&quot;https://doi.org/10.1145/3796701.3815922&quot;&gt;10.1145/3796701.3815922&lt;/a&gt;</ama>
<mla>D’Archivio, Niccolò, et al. “Order Statistics in Population Protocols via Simple Dynamics.” &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, Association for Computing Machinery, 2026, pp. 425–36, doi:&lt;a href=&quot;https://doi.org/10.1145/3796701.3815922&quot;&gt;10.1145/3796701.3815922&lt;/a&gt;.</mla>
<ieee>N. D’Archivio, H. Almahmoud, E. Natale, and F. Mallmann-Trenn, “Order statistics in population protocols via simple dynamics,” in &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, Egham, United Kingdom, 2026, pp. 425–436.</ieee>
<chicago>D’Archivio, Niccolò, Hind Almahmoud, Emanuele Natale, and Frederik Mallmann-Trenn. “Order Statistics in Population Protocols via Simple Dynamics.” In &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, 425–36. Association for Computing Machinery, 2026. &lt;a href=&quot;https://doi.org/10.1145/3796701.3815922&quot;&gt;https://doi.org/10.1145/3796701.3815922&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22368</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-07-19T22:01:47Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-21T07:34:49Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
