184 research outputs found

    Engineering shortest paths and layout algorithms for large graphs

    Get PDF

    Upper large deviations for power-weighted edge lengths in spatial random networks

    Get PDF
    We study the large-volume asymptotics of the sum of power-weighted edge lengths ∑e∈E∣e∣α\sum_{e \in E}|e|^\alpha in Poisson-based spatial random networks. In the regime α>d\alpha > d, we provide a set of sufficient conditions under which the upper large deviations asymptotics are characterized by a condensation phenomena, meaning that the excess is caused by a negligible portion of Poisson points. Moreover, the rate function can be expressed through a concrete optimization problem. This framework encompasses in particular directed, bidirected and undirected variants of the kk-nearest neighbor graph, as well as suitable β\beta-skeletons.Comment: 27 pages, 5 figure
    • …
    corecore