Continuum percolation of polydisperse hyperspheres in infinite dimensions
Claudio Grimaldi

TL;DR
This paper investigates the percolation behavior of polydisperse hyperspheres in high dimensions, revealing that the critical connectivity depends on the largest spheres and that the percolation threshold is non-universal for unbounded size distributions.
Contribution
It provides a detailed analysis of continuum percolation in high dimensions, showing the influence of size distribution and the dominance of largest spheres on the percolation threshold.
Findings
Clusters are tree-like in high dimensions with no loops.
Percolation threshold approaches 2^{-d} for bounded sizes.
Unbounded size distributions can have thresholds smaller than 2^{-d}.
Abstract
We analyze the critical connectivity of systems of penetrable -dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers and edges are formed between any two overlapping spheres. Edge weights naturally arise from the different radii of two overlapping spheres. For the case in which the spheres have bounded size distributions, we show that clusters of connected spheres are tree-like for and they contain no closed loops. In this case, we find that the mean cluster size diverges at the percolation threshold density , independently of the particular size distribution. We also show that the mean number of overlaps for a particle at criticality is smaller than unity, while only for spheres with fixed…
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.
