On the public citation graph
Connectivity threshold of Bluetooth graphs
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.1377openalex-snapshot
On the connectivity of Bluetooth‐basedad hocnetworks
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-1-4612-1784-8_33openalex-snapshot
Critical Power for Asymptotic Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-540-28650-9_8openalex-snapshot
Introduction to Statistical Learning Theory
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_47openalex-snapshot
On the Expansion and Diameter of Bluetooth-Like Topologies
inferredcites →https://doi.org/10.1007/bf01197577openalex-snapshot
The critical probability of bond percolation on the square lattice equals 1/2
inferredcites →https://doi.org/10.1007/bf01198162openalex-snapshot
Surface order large deviations for high-density percolation
inferredcites →https://doi.org/10.1007/bf02579431openalex-snapshot
On the connectivity of randomm-orientable graphs and digraphs
inferredcites →https://doi.org/10.1007/s11276-006-1304-7openalex-snapshot
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks
inferredcites →https://doi.org/10.1016/0012-365x(83)90046-8openalex-snapshot
On the existence of Hamiltonian cycles in a class of random graphs
inferredcites →https://doi.org/10.1016/0097-3165(91)90021-8openalex-snapshot
Compressions and isoperimetric inequalities
inferredcites →https://doi.org/10.1016/j.adhoc.2004.02.002openalex-snapshot
Bluetooth scatternet formation: A survey
inferredcites →https://doi.org/10.1017/s0305004100019174openalex-snapshot
On Ising's model of ferromagnetism
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1093/acprof:oso/9780198506263.001.0001openalex-snapshot
Random Geometric Graphs
inferredcites →https://doi.org/10.1109/ipdps.2004.1303259openalex-snapshot
A new approach to device discovery and scatternet formation in bluetooth networks
inferredcites →https://doi.org/10.1145/1007912.1007959openalex-snapshot
Expansion properties of (secure) wireless networks
inferredcites →https://doi.org/10.1145/1073970.1073986openalex-snapshot
Irrigating ad hoc networks in constant time
inferredcites →https://doi.org/10.1214/aoap/1034625335openalex-snapshot
The longest edge of the random minimal spanning tree
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00224-012-9390-7openalex-snapshot
On the Expansion and Diameter of Bluetooth-Like Topologies
inferred← citeshttps://doi.org/10.1017/jpr.2020.21openalex-snapshot
Randomized near-neighbor graphs, giant components and applications in data science
inferred← citeshttps://doi.org/10.1103/wb8q-xv3xopenalex-snapshot
Effective conductivity of conduit networks with random conductivities
inferred← citeshttps://doi.org/10.1109/jiot.2015.2433938openalex-snapshot
Forming MS-Free and Outdegree-Limited Bluetooth Scatternets in Pessimistic Environments
inferred← citeshttps://doi.org/10.1109/lcn.2014.6925801openalex-snapshot
Forming MS-free and outdegree-limited Bluetooth scatternets in pessimistic environments
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2883457openalex-snapshot
Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925789openalex-snapshot
Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information
inferred← citeshttps://doi.org/10.1177/0278364918802957openalex-snapshot
New perspective on sampling-based motion planning via random geometric graphs
inferred← citeshttps://doi.org/10.1214/15-aap1110openalex-snapshot
Connectivity of soft random geometric graphs
inferred← citeshttps://doi.org/10.1214/15-aap1170openalex-snapshot
Almost optimal sparsification of random geometric graphs
inferred← citeshttps://doi.org/10.1214/17-ss117openalex-snapshot
Basic models and questions in statistical network analysis
inferred← citeshttps://doi.org/10.1214/ecp.v20-3644openalex-snapshot
Connectivity of sparse bluetooth networks
inferred← citeshttps://doi.org/10.15607/rss.2016.xii.003openalex-snapshot
New perspective on sampling-based motion planning via random geometric graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1202.5569openalex-snapshot
The Cover Time of Random Walks on Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05460openalex-snapshot
New perspective on sampling-based motion planning via random geometric graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.06479openalex-snapshot
Asymptotic adaptive threshold for connectivity in a random geometric social network
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.