Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The coverage holes of the largest component of random geometric graph

From MaRDI portal
Publication:277050
Jump to:navigation, search

DOI10.1007/s10255-015-0515-zzbMath1338.60239OpenAlexW2287004202MaRDI QIDQ277050

Tian-de Guo, Chang-long Yao

Publication date: 4 May 2016

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-015-0515-z

zbMATH Keywords

coveragecontinuum percolationrandom geometric graphwireless sensor networks


Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)




Cites Work

  • Sentry Selection in Wireless Networks
  • Percolation
  • Co-Existence of the occupied and vacant phase in boolean models in three or more dimensions
  • Random Geometric Graphs
  • Continuum Percolation
  • Large Deviations for the Graph Distance in Supercritical Continuum Percolation
  • Random Networks for Communication
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:277050&oldid=12162681"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki