Electrostatics on Branching Processes
Christopher D. Sinclair

TL;DR
This paper studies a probabilistic model of particles on a random tree generated by a branching process, introducing new partition functions that average over the randomness and exhibit algebraic properties.
Contribution
It introduces a novel framework for analyzing electrostatic interactions on random trees using mean partition functions and recursion relations.
Findings
Mean partition functions satisfy recursive relations.
Partition functions exhibit algebraic properties depending on the branching law.
Generalizes known properties from non-random and p-adic cases.
Abstract
We introduce a random probability measure on the profinite completion of the random tree of a branching process and introduce the canonical and grand canonical ensembles of random repelling particles on this random profinite completion at inverse temperature . We think of this as a random spatial process of particles in a random tree, and we introduce the notion of the {\em mean} canonical and grand canonical partition functions where in this context `mean' means averaged over the random environment. We give a recursion for these mean partition functions and demonstrate that in certain instances, determined by the law for the branching process, these partition functions as a function of have algebraic properties which generalize those that appear in the non-random and -adic environments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdhesion, Friction, and Surface Interactions · Cellular Automata and Applications · Theoretical and Computational Physics
