On Distances in Uniformly Random Networks
From MaRDI portal
Publication:3546972
DOI10.1109/TIT.2005.855610zbMATH Open1316.94141MaRDI QIDQ3546972FDOQ3546972
Authors: Martin Haenggi
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Topological properties of random wireless networks
- When do wireless network signals appear Poisson?
- \(k\)th distance distributions for generalized Gauss-Poisson process in \(\mathbb{R}^n\)
- Limit distributions of extremal distances to the nearest neighbor
- Joint distribution of distances in large random regular networks
Communication theory (94A05) Combinatorial probability (60C05) Applications of graph theory to circuits and networks (94C15)
Cited In (17)
- The structure of distances in networks
- Universality for distances in power-law random graphs
- Unbounded graph-Laplacians in energy space, and their extensions
- Degrees and distances in random and evolving Apollonian networks
- The Gromov–Wasserstein distance between networks and stable network invariants
- Title not available (Why is that?)
- Probability distribution of multi-hop-distance in one-dimensional sensor networks
- Distance-sum heterogeneity in graphs and complex networks
- On the distance between random events on a network
- Resistance distance distribution in large sparse random graphs
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- Connected spatial networks over random points and a route-length statistic
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
- Title not available (Why is that?)
- Distances in random graphs with finite variance degrees
- How to Apply Large Deviation Theory to Routing in WSNs
- Distance distributions for graphs modeling computer networks
This page was built for publication: On Distances in Uniformly Random Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546972)