On the public citation graph

Topological properties of the one dimensional exponential random geometric graph

0 signed · 38 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/(sici)1098-2418(199909)15:2<145::aid-rsa2>3.0.co;2-gopenalex-snapshot
Onk-connectivity for a geometric random graph
inferredcites →https://doi.org/10.1002/9781118165676openalex-snapshot
An Introduction to Probability and Statistics
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-1-4757-2539-1openalex-snapshot
Probability
inferredcites →https://doi.org/10.1007/bf02719777openalex-snapshot
Topological properties of random wireless networks
inferredcites →https://doi.org/10.1016/s0167-5060(08)70379-0openalex-snapshot
Probability Models for Random Multigraphs with Applications in Cluster Analysis
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/s0963548304006121openalex-snapshot
Threshold Functions for Random Graphs on a Line Segment
inferredcites →https://doi.org/10.1023/b:wine.0000013081.09837.c0openalex-snapshot
The Number of Neighbors Needed for Connectivity of Wireless Networks
inferredcites →https://doi.org/10.1093/acprof:oso/9780198506263.001.0001openalex-snapshot
Random Geometric Graphs
inferredcites →https://doi.org/10.1109/26.31170openalex-snapshot
Critical connectivity phenomena in multihop radio models
inferredcites →https://doi.org/10.1109/lcomm.2002.804241openalex-snapshot
On the connectivity in finite ad hoc networks
inferredcites →https://doi.org/10.1109/wiopt.2005.33openalex-snapshot
On Range Matrices and Wireless Networks in d Dimensions
inferredcites →https://doi.org/10.2307/1428076openalex-snapshot
The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]d
inferredcites →https://doi.org/10.2307/1428077openalex-snapshot
The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d
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/2669658openalex-snapshot
Introduction to Probability Models
inferredcites →https://doi.org/10.5860/choice.30-4451openalex-snapshot
A first course in order statistics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-22543-7_19openalex-snapshot
A New Graph Model for Heterogeneous WSN
inferred← citeshttps://doi.org/10.1007/s10955-018-2059-0openalex-snapshot
Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures
inferred← citeshttps://doi.org/10.1007/s11277-020-07706-3openalex-snapshot
Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach
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/s42045-019-00027-5openalex-snapshot
Resilient and secure wireless sensor network under non-full visibility
inferred← citeshttps://doi.org/10.1016/j.spl.2009.06.011openalex-snapshot
Vertex degree of random geometric graph on exponentially distributed points
inferred← citeshttps://doi.org/10.1017/s0001867800050382openalex-snapshot
Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
inferred← citeshttps://doi.org/10.1109/cict.2013.6558080openalex-snapshot
A graph theory based energy efficient clustering techniques in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/cyberc.2009.5342212openalex-snapshot
Exponential random geometric graph process models for mobile wireless networks
inferred← citeshttps://doi.org/10.1109/ivs.2014.6856464openalex-snapshot
Connectivity analysis for vehicular ad hoc network based on the Exponential Random Geometric Graphs
inferred← citeshttps://doi.org/10.1109/mahss.2008.4660068openalex-snapshot
The benefits of directional antennas in heterogeneouswireless ad-hoc networks
inferred← citeshttps://doi.org/10.1109/wiopt.2005.33openalex-snapshot
On Range Matrices and Wireless Networks in d Dimensions
inferred← citeshttps://doi.org/10.1214/11-aap823openalex-snapshot
Nonuniform random geometric graphs with location-dependent radii
inferred← citeshttps://doi.org/10.4108/eai.13-7-2018.163974openalex-snapshot
Energy Efficiency to Improve Network Life Time Using Particle Swarm Optimization Algorithm
inferred← citeshttps://doi.org/10.5121/jgraphoc.2011.3304openalex-snapshot
Connectivity and Coverage in Hybrid Wireless Sensor Networks using Dynamic Random Geometric Graph Model
inferred← citeshttps://doi.org/10.7287/peerj-cs.269v0.1/reviews/1openalex-snapshot
Peer Review #1 of "A survey on exponential random graph models: an application perspective (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.269v0.1/reviews/2openalex-snapshot
Peer Review #2 of "A survey on exponential random graph models: an application perspective (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.269v0.1/reviews/3openalex-snapshot
Peer Review #3 of "A survey on exponential random graph models: an application perspective (v0.1)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.269openalex-snapshot
A survey on exponential random graph models: an application perspective
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.