On Distances in Uniformly Random Networks
From MaRDI portal
Publication:3546972
DOI10.1109/TIT.2005.855610zbMath1316.94141MaRDI QIDQ3546972
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Combinatorial probability (60C05) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)
Related Items (6)
How to Apply Large Deviation Theory to Routing in WSNs ⋮ On the distance between random events on a network ⋮ Unnamed Item ⋮ Unbounded graph-Laplacians in energy space, and their extensions ⋮ Scaling limits for shortest path lengths along the edges of stationary tessellations ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
This page was built for publication: On Distances in Uniformly Random Networks
