On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension

DOI10.1561/1300000029MaRDI QIDQ5396758zbMATH OpenOpenAlexFDO

Authors Armand M. Makowski, Guang Han

Publication date 3 February 2014

Published in Foundations and Trends® in Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1561/1300000029

zbMATH Keywords

connectivityzero-one lawsgeometric random graphscritical transmission rangeone-dimensional disk models

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• The Denseness of the Far Field Patterns for the Transmission Problem
• Sensitivity of anomalous localized resonance phenomena with respect to dissipation
• Continuous dependence of the transmission eigenvalues in one dimension
• Transmission of a single impurity system: a comprehensive pedagogical tutorial
• On the existence of transmission eigenvalues
• Sensitivity in spectral structures
• Ultrasensitivity in independent multisite systems
• Analytic bounds on transmission probabilities

Cited in

(3)

• Critical density thresholds in distributed wireless networks
• Critical node lifetimes in random networks via the Chen-Stein method
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity

This page was built for publication: On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396758)