Topological and Geometrical Random Walks on Bidisperse Random Sphere Packings
Abstract
Motivated by a problem arising from pharmaceutical science [B. Baeumer et al., Discr. Contin. Dyn. Sys. B 12], we study random walks on the contact graph of a bidisperse random sphere packing. For a random walk on the unweighted graph that terminates in a specified target set, we compare the number of steps and the total euclidean length of the walk. We find a linear relationship between the two metrics with a proportionality constant that can be calculated from the edge length probabilities of the contact graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.