Об асимптотике кратчайшего расстояния между крайними вершинами в обобщенном графе Барака–Эрдеша

We consider a generalization of the Barak–Erdös random graph, which is a graph with an ordered set of vertices $ \{ 0, 1, \ldots n \} $ and with directed edges from $ i $ to $ j $ for $ i < j $ only, where each edge is present with a given probability $ p \in (0, 1) $. In our setting, probabilities $ p=p_{i,j} $ depend on distances $ j - i $ and may tend to $ 0 $ as $ j - i \to \infty $. We study the asymptotics for the distribution of the minimal path length between $ 0 $ and $ n $, when $ n $ becomes large.