Reference health

On the Eigenvalue Power Law

https://doi.org/10.1007/3-540-45726-7_20
CiteStamped reference-health badge
15/15 checkable references clean · checked 2026-08-08

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

15 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 15 checked references that resolve
resolves10.1109/SFCS.2001.959926
Web search via hub synthesis
resolves10.1080/10586458.2001.10504428
A Random Graph Model for Power Law Graphs
resolves10.1109/SFCS.2001.959927
Random evolution in massive graphs
resolves10.1145/380752.380859
Spectral analysis of data
resolves10.1126/science.286.5439.509
Emergence of Scaling in Random Networks
resolves10.1002/rsa.1009
The degree sequence of a scale‐free random graph process
resolves10.1007/3-540-44676-1_42
A General Model of Undirected Web Graphs
resolves10.1080/00018730110112519
Evolution of networks
resolves10.1145/316194.316229
On power-law relationships of the Internet topology
resolves10.1103/PhysRevE.64.051903
Spectra and eigenvectors of scale-free networks
resolves10.1145/324133.324140
Authoritative sources in a hyperlinked environment
resolves10.1016/S1389-1286(99)00040-7
Trawling the Web for emerging cyber-communities
resolves10.1109/SFCS.2000.892065
Stochastic models for the Web graph
resolves10.1145/505680.505683
On the origin of power laws in Internet topologies
resolves10.1006/jcss.2000.1711
Latent Semantic Indexing: A Probabilistic Analysis
The 15 references without a DOI — listed, not checked
no DOI — not checkedBroder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomikns, A. and Wiener, J., “Graph structure in the Web”, Proc. 9th International World Wide Web Conference (WWW9)/Computer Networks, 33(1-6), 2000, pp. 309–320.
no DOI — not checkedChung, F.R.K. and Lu, L., “Connected components in random graphs with given degree sequences”, Available at http://www.math.ucsd.edu/fan .
no DOI — not checkedDill, S., Kumar, R., McCurley, K., Rajagopalan, S., Sivakumar, D. and Tomkins, A., “Self-similarity in the Web”, In Proceedings of International Conference on Very Large Data Bases, Rome, 2001, pp. 69–78.
no DOI — not checkedErdös. P. and Rényi, A., “On the Evolution of Random Graphs”, Publications of the Mathematical Institute of the Hungarian Academy of Science 5, (1960), pp17–61.
no DOI — not checkedFabrikant, A., Koutsoupias, E. and Papadimitriou, C.H. “Heuristically Optimized Tradeoffs”, Available at http://www.cs.berkeley.edu/christos .
no DOI — not checkedFarkas, I.J., Derényi, I., Barabási, A.L. and Vicsek, T., “Spectra of Real-World Graphs: Beyond the Semi-Circle Law”, e-print cond-mat/0102335.
no DOI — not checkedHusbands, P., Simon, H. and Ding, C., “On the use of the Singular Value Decomposition for Text Retrieval”, 1st SIAM Computational Information Retrieval Workshop, October 2000, Raleigh, NC.
no DOI — not checkedJin, C., Chen, Q. and Jamin, S., “Inet: Internet Topology Generator”, University of Michigan technical Report, CSE-TR-433-00. Available at http://irl.eecs.umich.edu/jamin .
no DOI — not checkedLovász, L., Combinatorial Problems and Exercises, North-Holland Publishing Co., Amsterdam-New York, 1979.
no DOI — not checkedMedina, A., Lakhina, A., Matta, I. and Byers, J., BRITE: Universal Topology Generation from a User’s Perspective. Technical Report BUCS-TR2001-003, Boston University, 2001. Available at http://www.cs.bu.edu/brite/publications .
no DOI — not checkedGkantsidis, C., Mihail, M. and Zegura, E., “Spectral Analysis of Internet Topologies”, Georgia Institute of Technology, Technical Report GIT-CC-0710.
no DOI — not checkedPalmer, C. and Steffan, J., “Generating network topologies that obey power laws”, In Proceedings of Globecom 2000.
no DOI — not checkedSpencer, J., Ten Lecture Notes on the Probabilistic Method, SIAM Lecture Notes, Philadelphia, 1987.
no DOI — not checkedStewart, G. W. and Sun, J., Matrix Perturbation Theory, Academic Press, 1990.
no DOI — not checkedWilkinson, J. H., The Algebraic Eigenvalue Problem, Numerical Mathematics and Scientific Computation, Oxford University Press, 1965.
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-08 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1007/3-540-45726-7_20"><img src="https://citestamp.com/citestamped/10.1007/3-540-45726-7_20/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/3-540-45726-7_20/badge.svg)](https://citestamp.com/citestamped/10.1007/3-540-45726-7_20)