On the public citation graph

Towards Topology Aware Networks

0 signed · 32 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.1007/978-1-4612-0323-0openalex-snapshot
Algorithms for Random Generation and Counting: A Markov Chain Approach
inferredcites →https://doi.org/10.1016/j.laa.2006.07.020openalex-snapshot
Spectral partitioning works: Planar graphs and finite element meshes
inferredcites →https://doi.org/10.1016/s0025-5610(96)00070-6openalex-snapshot
inferredcites →https://doi.org/10.1090/cbms/092openalex-snapshot
Spectral Graph Theory
inferredcites →https://doi.org/10.1109/focs.2006.5openalex-snapshot
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208688openalex-snapshot
Spectral analysis of Internet topologies
inferredcites →https://doi.org/10.1109/sfcs.1988.21958openalex-snapshot
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
inferredcites →https://doi.org/10.1109/sfcs.1996.548468openalex-snapshot
Spectral partitioning works: planar graphs and finite element meshes
inferredcites →https://doi.org/10.1137/050645452openalex-snapshot
Minimizing Effective Resistance of a Graph
inferredcites →https://doi.org/10.1137/s0036144503423264openalex-snapshot
Fastest Mixing Markov Chain on a Graph
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1073970.1073992openalex-snapshot
Peer-to-peer networks based on random transformations of connected regular undirected graphs
inferredcites →https://doi.org/10.1145/511334.511369openalex-snapshot
Search and replication in unstructured peer-to-peer networks

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10458-018-9397-9openalex-snapshot
A context-aware convention formation framework for large-scale networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.05.005openalex-snapshot
Tide: An effective and practical design for hierarchical-structured P2P model
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2012.07.002openalex-snapshot
A novel and efficient source-path discovery and maintenance method for application layer multicast
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.01.002openalex-snapshot
Efficient random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1016/j.sigpro.2012.12.002openalex-snapshot
Distributed computation of the Fiedler vector with application to topology inference in ad hoc networks
inferred← citeshttps://doi.org/10.1109/fgcn.2007.197openalex-snapshot
Routing Based Load Balancing for Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1109/hpcc.2008.49openalex-snapshot
SLUP: A Semantic-Based and Location-Aware Unstructured P2P Network
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413713openalex-snapshot
Estimating Fiedler Value on Large Networks Based on Random Walk Observations
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218619openalex-snapshot
On the efficiency of social recommender networks
inferred← citeshttps://doi.org/10.1109/msp.2012.2232713openalex-snapshot
Seeing the Bigger Picture: How Nodes Can Learn Their Place Within a Complex Ad Hoc Network Topology
inferred← citeshttps://doi.org/10.1109/paciia.2009.5406405openalex-snapshot
A novel fault detection mechanism of topology-aware ALM
inferred← citeshttps://doi.org/10.1109/smc.2013.752openalex-snapshot
Design and Analysis of the Gateway-Level Topology Map in Topology-Aware ALM Systems
inferred← citeshttps://doi.org/10.1109/tnet.2015.2475616openalex-snapshot
On the Efficiency of Social Recommender Networks
inferred← citeshttps://doi.org/10.1145/1835698.1835745openalex-snapshot
Efficient distributed random walks with applications
inferred← citeshttps://doi.org/10.1145/2335470.2335475openalex-snapshot
On distributed computation of information potentials
inferred← citeshttps://doi.org/10.1145/2432622.2432624openalex-snapshot
Distributed Random Walks
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9434openalex-snapshot
Fast Convention Formation in Dynamic Networks Using Topological Knowledge
inferred← citeshttps://doi.org/10.48550/arxiv.0911.3195openalex-snapshot
Efficient Distributed Random Walks with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1302.4544openalex-snapshot
Distributed Random Walks
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.