On the public citation graph

On the Cover Time of Random Geometric Graphs

https://doi.org/10.1007/11523468_55
0 signed · 90 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(199612)9:4<403::aid-rsa4>3.0.co;2-0openalex-snapshot
Multiple cover time
inferredcites →https://doi.org/10.1002/rsa.3240060406openalex-snapshot
A tight lower bound on the cover time for random walks on graphs
inferredcites →https://doi.org/10.1007/3-540-49543-6_10openalex-snapshot
Robotic Exploration, Brownian Motion and Electrical Resistance
inferredcites →https://doi.org/10.1007/3-540-63248-4openalex-snapshot
Randomization and Approximation Techniques in Computer Science
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/bf01048272openalex-snapshot
Lower bounds for covering times for reversible Markov chains and random walks on graphs
inferredcites →https://doi.org/10.1007/bf01048273openalex-snapshot
Bounds on the cover time
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1017/s0963548398003538openalex-snapshot
On the Cover Time for Random Walks on Random Graphs
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.1090/qam/42958openalex-snapshot
The fundamental theorem of electrical networks
inferredcites →https://doi.org/10.1093/acprof:oso/9780198506263.001.0001openalex-snapshot
Random Geometric Graphs
inferredcites →https://doi.org/10.1109/ewsn.2005.1461994openalex-snapshot
Bounds on the mixing time and partial cover of ad-hoc and sensor networks
inferredcites →https://doi.org/10.1109/infcom.2004.1354487openalex-snapshot
Random walks in peer-to-peer networks
inferredcites →https://doi.org/10.1109/reldis.2002.1180175openalex-snapshot
Random walk for self-stabilizing group communication in ad-hoc networks
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1109/sfcs.2003.1238221openalex-snapshot
Gossip-based computation of aggregate information
inferredcites →https://doi.org/10.1137/0405007openalex-snapshot
A Technique for Lower Bounding the Cover Time
inferredcites →https://doi.org/10.1145/100216.100249openalex-snapshot
A technique for lower bounding the cover time
inferredcites →https://doi.org/10.1145/1007352.1007441openalex-snapshot
Sharp thresholds For monotone properties in random geometric graphs
inferredcites →https://doi.org/10.1145/313451.313556openalex-snapshot
Next century challenges
inferredcites →https://doi.org/10.1145/332833.332838openalex-snapshot
Wireless integrated network sensors
inferredcites →https://doi.org/10.1145/570738.570741openalex-snapshot
Constrained random walks on random graphs
inferredcites →https://doi.org/10.1145/570738.570742openalex-snapshot
Rumor routing algorthim for sensor networks
inferredcites →https://doi.org/10.1145/73007.73062openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferredcites →https://doi.org/10.1145/93385.93409openalex-snapshot
Token management schemes and random walks yield self-stabilizing mutual exclusion
inferredcites →https://doi.org/10.1145/984622.984663openalex-snapshot
Efficient and robust query processing in dynamic environments using random walk techniques
inferredcites →https://doi.org/10.1145/989459.989461openalex-snapshot
Asymptotic critical transmission radius and critical neighbor number for k -connectivity in wireless ad hoc 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/aop/1176991894openalex-snapshot
Covering Problems for Brownian Motion on Spheres
inferredcites →https://doi.org/10.1214/ecp.v5-1022openalex-snapshot
On the Cover Time of Planar Graphs
inferredcites →https://doi.org/10.48550/arxiv.math/0408103openalex-snapshot
The spectrum of a random geometric graph is concentrated
inferredcites →https://doi.org/10.5555/1070432.1070575openalex-snapshot
The bin-covering technique for thresholding random geometric graph properties
inferredcites →https://doi.org/10.5948/upo9781614440222openalex-snapshot
Random Walks and Electric Networks

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.4627056openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_6openalex-snapshot
Expander Properties and the Cover Time of Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79309-0_13openalex-snapshot
Frugal Routing on Wireless Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02427-6_18openalex-snapshot
Random Walks on Random Graphs
inferred← citeshttps://doi.org/10.1007/s00446-008-0075-zopenalex-snapshot
Broadcasting in UDG radio networks with unknown topology
inferred← citeshttps://doi.org/10.1007/s11276-017-1452-yopenalex-snapshot
Census: fast, scalable and robust data aggregation in MANETs
inferred← citeshttps://doi.org/10.1007/s11721-021-00205-6openalex-snapshot
Resource ephemerality influences effectiveness of altruistic behavior in collective foraging
inferred← citeshttps://doi.org/10.1016/j.adhoc.2019.101893openalex-snapshot
Multiple and replicated random walkers analysis for service discovery in fog computing IoT environments
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.01.026openalex-snapshot
Random walk with jumps in large-scale random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.01.001openalex-snapshot
Comparison of efficient random walk strategies for wireless multi-hop networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.09.012openalex-snapshot
The power of choice in random walks: An empirical study
inferred← citeshttps://doi.org/10.1016/j.procs.2013.09.311openalex-snapshot
Resilience Notions for Scale-free Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.028openalex-snapshot
Expander properties and the cover time of random intersection graphs
inferred← citeshttps://doi.org/10.1017/apr.2016.78openalex-snapshot
On the treewidth of random geometric graphs and percolated grids
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548311000125openalex-snapshot
Many Random Walks Are Faster Than One
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.1109/access.2019.2960075openalex-snapshot
Reliable Storage System With Priority Filter and Load Balance Collection Model for Large Scale Sensor Networks
inferred← citeshttps://doi.org/10.1109/ew.2010.5483528openalex-snapshot
Sink mobility schemes for data extraction in large scale WSNs under single or zero hop data forwarding
inferred← citeshttps://doi.org/10.1109/ewsn.2005.1461994openalex-snapshot
Bounds on the mixing time and partial cover of ad-hoc and sensor networks
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425590openalex-snapshot
On the Connectivity of Key-Distribution Strategies in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icns.2007.35openalex-snapshot
Ant Routing in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/iisa.2019.8900692openalex-snapshot
Random Walkers Coverage Experimentation and Evaluation in Low-Cost Wireless Home Networks
inferred← citeshttps://doi.org/10.1109/infcom.2007.215openalex-snapshot
Little Tom Thumb Went Straight Home: Asymptotic Behavior of a Routing Protocol in Ad-hoc Networks with a Mobile Access Point
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461902openalex-snapshot
Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/ipsn.2008.64openalex-snapshot
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/isit.2014.6874832openalex-snapshot
Minimum node degree and k-connectivity in wireless networks with unreliable links
inferred← citeshttps://doi.org/10.1109/jsac.2010.100215openalex-snapshot
Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/jsen.2013.2277720openalex-snapshot
Data Persistency in Wireless Sensor Networks Using Distributed Luby Transform Codes
inferred← citeshttps://doi.org/10.1109/jstsp.2011.2125776openalex-snapshot
A Token-Based Approach for Distributed Computation in Sensor Networks
inferred← citeshttps://doi.org/10.1109/lcomm.2010.02.091821openalex-snapshot
End-to-end delay in wireless random networks
inferred← citeshttps://doi.org/10.1109/pimrc.2012.6362587openalex-snapshot
Distributed data storage in sensor networks based on Raptor codes
inferred← citeshttps://doi.org/10.1109/sahcn.2009.5168944openalex-snapshot
Lukewarm Potato Forwarding: A Biased Random Walk Routing Protocol for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/smc.2017.8123176openalex-snapshot
Distributed TSCH scheduling: A comparative analysis
inferred← citeshttps://doi.org/10.1109/tit.2011.2104630openalex-snapshot
Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
inferred← citeshttps://doi.org/10.1109/tmc.2008.151openalex-snapshot
Biased Random Walks in Uniform Wireless Networks
inferred← citeshttps://doi.org/10.1109/tmc.2010.131openalex-snapshot
A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol
inferred← citeshttps://doi.org/10.1109/tmc.2011.54openalex-snapshot
Smooth Trade-Offs between Throughput and Delay in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/vtcfall.2014.6966187openalex-snapshot
Spreading Information in Mobile Wireless Networks
inferred← citeshttps://doi.org/10.1137/140961249openalex-snapshot
The Smallest Possible Interaction Radius for Synchronization of Self-Propelled Particles
inferred← citeshttps://doi.org/10.1145/1164717.1164757openalex-snapshot
The power of choice in random walks
inferred← citeshttps://doi.org/10.1145/1281100.1281130openalex-snapshot
Broadcasting in udg radio networks with unknown topology
inferred← citeshttps://doi.org/10.1145/1378533.1378557openalex-snapshot
Many random walks are faster than one
inferred← citeshttps://doi.org/10.1145/1400863.1400878openalex-snapshot
Distance graphs
inferred← citeshttps://doi.org/10.1145/3394231.3397914openalex-snapshot
Exploring Low-degree nodes first accelerates Network Exploration
inferred← citeshttps://doi.org/10.1155/2008/213185openalex-snapshot
Curvature of Indoor Sensor Network: Clustering Coefficient
inferred← citeshttps://doi.org/10.1155/2011/895398openalex-snapshot
VCG with Communities on Random Ad Hoc Networks
inferred← citeshttps://doi.org/10.1186/s13174-018-0077-4openalex-snapshot
EZ-AG: structure-free data aggregation in MANETs using push-assisted self-repelling random walks
inferred← citeshttps://doi.org/10.3390/technologies5020033openalex-snapshot
Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0705.0467openalex-snapshot
Many Random Walks Are Faster Than One
inferred← citeshttps://doi.org/10.48550/arxiv.0904.4057openalex-snapshot
Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.4479openalex-snapshot
Distributed Data Storage in Large-Scale Sensor Networks Based on LT Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1409.7368openalex-snapshot
Census: Fast, scalable and robust data aggregation in MANETs
inferred← citeshttps://doi.org/10.48550/arxiv.1708.07044openalex-snapshot
EZ-AG: Structure-free data aggregation in MANETs using push-assisted self-repelling random walks
inferred← citeshttps://doi.org/10.48550/arxiv.1708.07049openalex-snapshot
Coverage characteristics of self-repelling random walks in mobile ad-hoc networks
inferred← citeshttps://doi.org/10.5121/jgraphoc.2014.6101openalex-snapshot
Enhanced Random Walk With Choice: An Empirical Study
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.