On the public citation graph

https://doi.org/10.5281/zenodo.4627056

0 signed · 15 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/rsa.3240060406openalex-extracted
A tight lower bound on the cover time for random walks on graphs
inferredcites →https://doi.org/10.1007/11523468_55openalex-extracted
On the Cover Time of Random Geometric Graphs
inferredcites →https://doi.org/10.1007/978-1-4612-1784-8_33openalex-extracted
Critical Power for Asymptotic Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1007/bf01048272openalex-extracted
Lower bounds for covering times for reversible Markov chains and random walks on graphs
inferredcites →https://doi.org/10.1007/bf01048273openalex-extracted
Bounds on the cover time
inferredcites →https://doi.org/10.1109/71.963420openalex-extracted
The power of two choices in randomized load balancing
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-extracted
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1137/s0097539795288490openalex-extracted
Balanced Allocations
inferredcites →https://doi.org/10.1145/100216.100249openalex-extracted
A technique for lower bounding the cover time
inferredcites →https://doi.org/10.1145/1164717.1164757openalex-extracted
The power of choice in random walks
inferredcites →https://doi.org/10.1145/73007.73062openalex-extracted
The electrical resistance of a graph captures its commute and cover times
inferredcites →https://doi.org/10.1145/984622.984663openalex-extracted
Efficient and robust query processing in dynamic environments using random walk techniques
inferredcites →https://doi.org/10.1214/aop/1176991894openalex-extracted
Covering Problems for Brownian Motion on Spheres
inferredcites →https://doi.org/10.1214/ecp.v5-1022openalex-extracted
On the Cover Time of Planar Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1109/wispnet.2017.8300006openalex-snapshot
A centrality based random walk approach for topology formation in 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.