A reachability threshold for random partial orders with a power-law gap kernel

We study a directed random graph whose vertices have independent times drawn from a strictly positive smooth density on a compact interval. The edge probability depends on the time gap through a fixed nonnegative power. At the scale rn = c(log n)α+1/n, we prove a two-sided reachability threshold for a fixed pair. The threshold is determined by the integral of the density raised to the power 1/(α+1), with an explicit gamma normalization. It implies a vanishing mean fraction of differing relations from a corresponding semiorder and convergence of the laws of restrictions to a fixed number of random vertices. The proof covers every fixed real α ≥ 0, without asserting uniformity in the exponent or near the threshold boundary. The deposit contains the complete proof and a plain-language reader’s guide. The source archive includes the English and Russian mathematical texts and the materials required to reproduce the PDFs. Preprint, version 0.1. AI systems assisted with the mathematical work and preparation of the text under the author’s direction. These checks do not constitute independent human expert review; no human specialist has yet checked the proof. Worldwide priority is not claimed.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24333796
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A reachability threshold for random partial orders with a power-law gap kernel

Oleg Dolgikh
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

A reachability threshold for random partial orders with a power-law gap kernel

Oleg Dolgikh
preprint en

Abstract

We study a directed random graph whose vertices have independent times drawn from a strictly positive smooth density on a compact interval. The edge probability depends on the time gap through a fixed nonnegative power. At the scale rn = c(log n)α+1/n, we prove a two-sided reachability threshold for a fixed pair. The threshold is determined by the integral of the density raised to the power 1/(α+1), with an explicit gamma normalization. It implies a vanishing mean fraction of differing relations from a corresponding semiorder and convergence of the laws of restrictions to a fixed number of random vertices. The proof covers every fixed real α ≥ 0, without asserting uniformity in the exponent or near the threshold boundary. The deposit contains the complete proof and a plain-language reader’s guide. The source archive includes the English and Russian mathematical texts and the materials required to reproduce the PDFs. Preprint, version 0.1. AI systems assisted with the mathematical work and preparation of the text under the author’s direction. These checks do not constitute independent human expert review; no human specialist has yet checked the proof. Worldwide priority is not claimed.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon