The Min Mean-Weight Cycle in a Random Network

  title={The Min Mean-Weight Cycle in a Random Network},
  author={Claire Mathieu and David Bruce Wilson},
  journal={Combinatorics, Probability and Computing},
  pages={763 - 782}
  • C. Mathieu, D. Wilson
  • Published 19 January 2012
  • Mathematics
  • Combinatorics, Probability and Computing
The mean weight of a cycle in an edge-weighted graph is the sum of the cycle's edge weights divided by the cycle's length. We study the minimum mean-weight cycle on the complete graph on n vertices, with random i.i.d. edge weights drawn from an exponential distribution with mean 1. We show that the probability of the min mean weight being at most c/n tends to a limiting function of c which is analytic for c ≤ 1/e, discontinuous at c = 1/e, and equal to 1 for c > 1/e. We further show that if the… 
Supercritical minimum mean-weight cycles
We study the weight and length of the minimum mean-weight cycle in the stochastic mean-field distance model, i.e., in the complete graph on $n$ vertices with edges weighted by independent exponential
Percolation of averages in the stochastic mean field model: the near-supercritical regime
For a complete graph of size $n$ , assign each edge an i.i.d. \ exponential variable with mean $n$ . For $\lambda>0$ , consider the length of the longest path whose average weight is at most
Ergodic optimization of prevalent super-continuous functions
Given a dynamical system, we say that a performance function has property P if its time averages along orbits are maximized at a periodic orbit. It is conjectured by several authors that for


On the value of a random minimum spanning tree problem
Average-Case Analyses of Vickrey Costs
It is shown that whp ***(n ln n ) edges are necessary and sufficient for a spanning subgraph to give good all-pairs shortest paths approximations.
On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model
  • D. Aldous
  • Mathematics
    Combinatorics, Probability and Computing
  • 1998
It is shown that M(c, n) makes the transition from o(n) to Ω( n) around some critical value c(0), which can be specified in terms of a fixed point of a mapping on probability distributions.
The Birth of the Giant Component
A “uniform” model of random graphs, which allows self-loops and multiple edges, is shown to lead to formulas that are substanitially simpler than the analogous formulas for the classical random graphs of Erdos and Renyi.
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to $m$ uniformly chosen nodes in the complete graph of size $N$
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
  • S. Janson
  • Mathematics, Computer Science
    Combinatorics, Probability and Computing
  • 1999
It is shown that the minimal weights of paths between two points in a complete graph with random weights on the edges is log n/n for two given points, and that the maximum if one point is fixed and the other varies is 2 logn/n.
The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
The joint distribution of the pair (HN, WN) is considered and derive, after proper scaling, the joint limiting distribution and it is shown that HN and WN, properly scaled, are asymptotically independent.
On the Value of a Random Minimum Weight Steiner Tree
It is proved that with high probability the weight of the minimum weight Steiner tree is (1+o(1)(k-1)(log n-log k)/n when k =o(n) and n→∞.