2024/03/21 by Roger Fan, Fan, Roger, N. Mani +1
Computer Science · #60C05 #FOS: Mathematics #Face and Expression Recognition #Machine Learning and Data Classification #Neural Networks and Applications #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2403.14051
openalex publication_date 2024/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we present a unified study of the limiting density in one-dimensional random sequential adsorption (RSA) processes where segment lengths are drawn from a given distribution. In addition to generic bounds, we are also able to characterize specific cases, including multidisperse RSA, in which we draw from a finite set of lengths, and power-law RSA, in which we draw lengths from a power-law distribution.