Horizontal visibility graph of a random restricted growth sequence
Abstract
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size n. Our main results are formulas expressing the expected degree of graph nodes in terms of simple explicit functions of a finite collection of Stirling and Bernoulli numbers.
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.