On the public citation graph

Sharp thresholds For monotone properties in random geometric graphs

0 signed · 104 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<137::aid-rsa9>3.0.co;2-yopenalex-snapshot
On the connectivity of a random interval graph
inferredcites →https://doi.org/10.1002/9781118032718.scardopenalex-snapshot
Wiley‐Interscience Series in Discrete Mathematics and Optimization
inferredcites →https://doi.org/10.1007/978-1-4757-3789-9openalex-snapshot
Communications, Information and Network Security
inferredcites →https://doi.org/10.1007/978-1-4757-3789-9_14openalex-snapshot
Critical Density Thresholds in Distributed Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-642-15074-6openalex-snapshot
Stochastic Analysis
inferredcites →https://doi.org/10.1007/bf02124678openalex-snapshot
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
inferredcites →https://doi.org/10.1007/s000390050015openalex-snapshot
Influences of Variables and Threshold Intervals under Group Symmetries
inferredcites →https://doi.org/10.1016/j.adhoc.2004.02.001openalex-snapshot
Unreliable sensor grids: coverage, connectivity and diameter
inferredcites →https://doi.org/10.1016/s0167-7152(02)00233-xopenalex-snapshot
The connectivity of a graph on uniform points on [0,1]d
inferredcites →https://doi.org/10.1017/cbo9780511814068openalex-snapshot
Random Graphs
inferredcites →https://doi.org/10.1017/s0963548304006121openalex-snapshot
Threshold Functions for Random Graphs on a Line Segment
inferredcites →https://doi.org/10.1090/s0002-9939-96-03732-xopenalex-snapshot
Every monotone graph property has a sharp threshold
inferredcites →https://doi.org/10.1093/acprof:oso/9780198506263.001.0001openalex-snapshot
Random Geometric Graphs
inferredcites →https://doi.org/10.1109/18.825799openalex-snapshot
The capacity of wireless networks
inferredcites →https://doi.org/10.1214/aoap/1034625335openalex-snapshot
The longest edge of the random minimal spanning tree
inferredcites →https://doi.org/10.1214/aoap/1050689601openalex-snapshot
Covering algorithms, continuum percolation and the geometry of wireless networks
inferredcites →https://doi.org/10.1214/aop/1176990347openalex-snapshot
Minimax Grid Matching and Empirical Measures
inferredcites →https://doi.org/10.1214/ecp.v8-1066openalex-snapshot
Trees and Matchings from Point Processes
inferredcites →https://doi.org/10.2307/1999405openalex-snapshot
The Evolution of Random Graphs
inferredcites →https://doi.org/10.2307/2531522openalex-snapshot
Graphs as Structural Models: The Application of Graphs and Multigraphs in Cluster Analysis.
inferredcites →https://doi.org/10.2307/2532227openalex-snapshot
Probability: Theory and Examples.
inferredcites →https://doi.org/10.4310/cis.2001.v1.n1.a3openalex-snapshot
Internets in the sky: The capacity of three-dimensional wireless networks
inferredcites →https://doi.org/10.5555/1070432.1070575openalex-snapshot
The bin-covering technique for thresholding random geometric graph properties

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-31173-4_20openalex-snapshot
The Critical Neighbourhood Range for Asymptotic Overlay Connectivity in Dense Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/11516798_26openalex-snapshot
Directional Versus Omnidirectional Antennas for Energy Consumption and k-Connectivity of Networks of Sensors
inferred← citeshttps://doi.org/10.1007/11523468_55openalex-snapshot
On the Cover Time of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/11561071_73openalex-snapshot
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
inferred← citeshttps://doi.org/10.1007/11940128_53openalex-snapshot
Balanced Cut Approximation in Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-1-84800-131-2_64openalex-snapshot
Performability Issues in Wireless Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_1openalex-snapshot
Plane and Planarity Thresholds for Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-52989-9_6openalex-snapshot
Phase Transitions in Large Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_9openalex-snapshot
Labeling Smart Dust
inferred← citeshttps://doi.org/10.1007/978-3-540-74871-7_5openalex-snapshot
Randomized Algorithms and Probabilistic Analysis in Wireless Networking
inferred← citeshttps://doi.org/10.1007/978-3-642-40066-7_8openalex-snapshot
Coverage and Connectivity in 3D Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_35openalex-snapshot
Connectivity of Random High Dimensional Geometric Graphs
inferred← citeshttps://doi.org/10.1007/bf02719777openalex-snapshot
Topological properties of random wireless networks
inferred← citeshttps://doi.org/10.1007/s00205-015-0929-zopenalex-snapshot
Continuum Limit of Total Variation on Point Clouds
inferred← citeshttps://doi.org/10.1007/s00454-006-1268-5openalex-snapshot
Low-Dimensional Embedding with Extra Information
inferred← citeshttps://doi.org/10.1007/s00454-009-9227-6openalex-snapshot
Some Results on Greedy Embeddings in Metric Spaces
inferred← citeshttps://doi.org/10.1007/s10959-006-0049-7openalex-snapshot
The Spectrum of a Random Geometric Graph is Concentrated
inferred← citeshttps://doi.org/10.1007/s12046-007-0046-2openalex-snapshot
A tutorial survey of topics in wireless networking: Part I
inferred← citeshttps://doi.org/10.1007/s12046-007-0047-1openalex-snapshot
A tutorial survey of topics in wireless networking: Part II
inferred← citeshttps://doi.org/10.1007/s12083-021-01286-0openalex-snapshot
Efficient path-sense transmission based on IoT system in opportunistic social networks
inferred← citeshttps://doi.org/10.1016/j.acha.2016.09.003openalex-snapshot
A variational approach to the consistency of spectral clustering
inferred← citeshttps://doi.org/10.1016/j.adhoc.2005.11.007openalex-snapshot
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.01.002openalex-snapshot
Thresholding random geometric graph properties motivated by ad hoc sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.065openalex-snapshot
On the cover time and mixing time of random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.037openalex-snapshot
Balanced cut approximation in random geometric graphs
inferred← citeshttps://doi.org/10.1017/apr.2016.31openalex-snapshot
On the relation between graph distance and Euclidean distance in random geometric graphs
inferred← citeshttps://doi.org/10.1017/s0963548308009334openalex-snapshot
Line-of-Sight Networks
inferred← citeshttps://doi.org/10.1049/cmu2.12254openalex-snapshot
Effective path prediction and data transmission in opportunistic social networks
inferred← citeshttps://doi.org/10.1049/iet-com.2009.0553openalex-snapshot
Problem of localisation in networks of randomly deployed nodes: asymptotic and finite analysis, and thresholds
inferred← citeshttps://doi.org/10.1080/15427951.2008.10129164openalex-snapshot
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxq030openalex-snapshot
The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing in Wireless Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919798openalex-snapshot
Spectral Analysis of the Adjacency Matrix of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1109/focs.2008.18openalex-snapshot
Some Results on Greedy Embeddings in Metric Spaces
inferred← citeshttps://doi.org/10.1109/glocom.2008.ecp.67openalex-snapshot
Phase Transition Properties in K-Connected Wireless Multi-Hop Networks
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425885openalex-snapshot
Phase Transition Width of Connectivity of Wireless Multi-Hop Networks in Shadowing Environment
inferred← citeshttps://doi.org/10.1109/glosic.2018.8570063openalex-snapshot
Simulation of Wireless Networks Based on Artificial Intelligence Approaches
inferred← citeshttps://doi.org/10.1109/i-span.2009.20openalex-snapshot
On Succinctness of Geometric Greedy Routing in Euclidean Plane
inferred← citeshttps://doi.org/10.1109/icc.2006.254730openalex-snapshot
Very sharp transitions in one-dimensional MANETs
inferred← citeshttps://doi.org/10.1109/icdcs.2011.86openalex-snapshot
An Energy-Efficient Markov Chain-Based Randomized Duty Cycling Scheme for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icuas.2017.7991506openalex-snapshot
Cooperative and non-cooperative UAS traffic volumes
inferred← citeshttps://doi.org/10.1109/infocom.2006.156openalex-snapshot
Trust Evaluation in Anarchy: A Case Study on Autonomous Networks
inferred← citeshttps://doi.org/10.1109/syscon.2017.7934758openalex-snapshot
A threshold based airspace capacity estimation method for UAS traffic management
inferred← citeshttps://doi.org/10.1109/tifs.2012.2191963openalex-snapshot
Anomaly Detection Using Proximity Graph and PageRank Algorithm
inferred← citeshttps://doi.org/10.1109/tmc.2004.23openalex-snapshot
Extremal properties of three-dimensional sensor networks with applications
inferred← citeshttps://doi.org/10.1109/tmc.2008.170openalex-snapshot
On the Phase Transition Width of K-Connectivity in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1109/tmc.2008.68openalex-snapshot
Coverage in Hybrid Mobile Sensor Networks
inferred← citeshttps://doi.org/10.1109/tsmcc.2007.897484openalex-snapshot
Mobile Network Analysis Using Probabilistic Connectivity Matrices
inferred← citeshttps://doi.org/10.1109/twc.2010.02.060736openalex-snapshot
Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks
inferred← citeshttps://doi.org/10.1109/twc.2010.5403542openalex-snapshot
Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks
inferred← citeshttps://doi.org/10.1109/wcnc.2007.531openalex-snapshot
A Mobile Delay-Tolerant Approach to Long-Term Energy-Efficient Underwater Sensor Networking
inferred← citeshttps://doi.org/10.1109/wcnc.2008.524openalex-snapshot
The Localization Problem in Networks of Uniformly Deployed Nodes
inferred← citeshttps://doi.org/10.1109/wiopt.2009.5291570openalex-snapshot
Finite random geometric graphs by circular and square coverage
inferred← citeshttps://doi.org/10.1137/060665300openalex-snapshot
Sharp Threshold for Hamiltonicity of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611972993.2openalex-snapshot
Coloring Geographical Threshold Graphs
inferred← citeshttps://doi.org/10.1137/120874448openalex-snapshot
On Treewidth and Related Parameters of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1142/s1793830920500056openalex-snapshot
Plane and planarity thresholds for random geometric graphs
inferred← citeshttps://doi.org/10.1145/1287853.1287860openalex-snapshot
Trade-offs between mobility and density for coverage in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1400863.1400878openalex-snapshot
Distance graphs
inferred← citeshttps://doi.org/10.1145/1525856.1525861openalex-snapshot
Deployment-aware modeling of node compromise spread in wireless sensor networks using epidemic theory
inferred← citeshttps://doi.org/10.1145/1597036.1597040openalex-snapshot
Bootstrapping a hop-optimal network in the weak sensor model
inferred← citeshttps://doi.org/10.1145/2367736.2367740openalex-snapshot
Energy-efficient markov chain-based duty cycling schemes for greener wireless sensor networks
inferred← citeshttps://doi.org/10.1145/997817.997866openalex-snapshot
Low-dimensional embedding with extra information
inferred← citeshttps://doi.org/10.21203/rs.2.24596/v1openalex-snapshot
Effective Data Transmission Based on Path Prediction in Opportunistic Social Networks
inferred← citeshttps://doi.org/10.25777/e1r5-yp32openalex-snapshot
Algorithms for Vertex-Weighted Matching in Graphs
inferred← citeshttps://doi.org/10.3390/s21186149openalex-snapshot
Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN
inferred← citeshttps://doi.org/10.37236/7159openalex-snapshot
Clique Colourings of Geometric Graphs
inferred← citeshttps://doi.org/10.4108/icst.valuetools2008.4510openalex-snapshot
A Survey of Message Diffusion Protocols in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.500openalex-snapshot
On Sharp Thresholds in Random Geometric Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.610openalex-snapshot
Connectivity for line-of-sight networks in higher dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.0710.0531openalex-snapshot
The Problem of Localization in Networks of Randomly Deployed Nodes: Asymptotic and Finite Analysis, and Thresholds
inferred← citeshttps://doi.org/10.48550/arxiv.1005.1117openalex-snapshot
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6590openalex-snapshot
Consistency of Cheeger and Ratio Graph Cuts
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02511openalex-snapshot
Design of Stochastic Robotic Swarms for Target Performance Metrics in Boundary Coverage Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0411027openalex-snapshot
Extremal Properties of Three Dimensional Sensor Networks with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702074openalex-snapshot
Dynamic Random Geometric Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0408103openalex-snapshot
The spectrum of a random geometric graph is concentrated
inferred← citeshttps://doi.org/10.5555/1283383.1283487openalex-snapshot
Line-of-sight networks
inferred← citeshttps://doi.org/10.5555/2946645.3053463openalex-snapshot
Consistency of cheeger and ratio graph cuts
inferred← citeshttps://doi.org/10.70675/d64bbc1az8defz4790zad0cz0dcd6494e310openalex-snapshot
Spectral analysis of random geometric graphs
inferred← citeshttps://doi.org/10.7282/t35d8s8xopenalex-snapshot
Algorithms and LP-duality based lower bounds in ad-hoc radio networks
inferred← citeshttps://doi.org/10.7282/t3pz5985openalex-snapshot
Upper and lower bounds in radio networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.