On Distances in Uniformly Random Networks

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)

zbMATH Keywords

Poisson point processrandom graphswireless networksstochastic geometry

Mathematics Subject Classification ID

Communication theory (94A05) Combinatorial probability (60C05) Applications of graph theory to circuits and networks (94C15)

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

Cited in

(23)

• Shortest path distance in Manhattan Poisson line Cox process
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Nodal distance distributions in cluster flight spacecraft network
• Distance distributions for graphs modeling computer networks
• On the distance between random events on a network
• When do wireless network signals appear Poisson?
• How to apply large deviation theory to routing in WSNs
• Universality for distances in power-law random graphs
• \(k\)th distance distributions for generalized Gauss-Poisson process in \(\mathbb{R}^n\)
• Distances in random graphs with finite variance degrees
• Probability distribution of multi-hop-distance in one-dimensional sensor networks
• Unbounded graph-Laplacians in energy space, and their extensions
• Nearest neighbor distance in three-dimensional space
• Joint distribution of distances in large random regular networks
• The structure of distances in networks
• Resistance distance distribution in large sparse random graphs
• Degrees and distances in random and evolving Apollonian networks
• The Gromov–Wasserstein distance between networks and stable network invariants
• Distance-sum heterogeneity in graphs and complex networks
• scientific article; zbMATH DE number 6701955 (Why is no real title available?)
• 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
• On the event distance of Poisson processes with applications to sensors

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)