English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we study the complete graph $K_n$ with n vertices, where weattach an independent and identically distributed (i.i.d.) weight to each ofthe n(n-1)/2 edges. We focus on the weight $W_n$ and the number of edges $H_n$of the minimal weight path between vertex 1 and vertex n. It is shown in (Ann.Appl. Probab. 22 (2012) 29-69) that when the weights on the edges are i.i.d.with distribution equal to that of $E^s$, where $s>0$ is some parameter, and Ehas an exponential distribution with mean 1, then $H_n$ is asymptoticallynormal with asymptotic mean $s\log n$ and asymptotic variance $s^2\log n$. Inthis paper, we analyze the situation when the weights have distribution$E^{-s},s>0$, in which case the behavior of $H_n$ is markedly different as$H_n$ is a tight sequence of random variables. More precisely, we use themethod of Stein-Chen for Poisson approximations to show that, for almost all$s>0$, the hopcount $H_n$ converges in probability to the nearest integer ofs+1 greater than or equal to 2, and identify the limiting distribution of therecentered and rescaled minimal weight. For a countable set of special s valuesdenoted by $\mathcal{S}=\{s_j\}_{j\geq2}$, the hopcount $H_n$ takes on thevalues j and j+1 each with positive probability.

Weak disorder in the stochastic mean-field model of distance II