The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Mining market data: A network approach
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,983
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Small worlds: the dynamics of networks between order and randomness
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5722 · Cited by 2,360
An Introduction to Econophysics: Correlations and Complexity in Finance
Mantegna, R. N., Stanley, H. E., & Chriss, N. A. (2000) · Physics Today · doi:10.1063/1.1341926 · Cited by 2,297
Introduction to Econophysics: Correlations and Complexity in Finance
Mantegna, R. N., & Stanley, H. E. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755767 · Cited by 1,817
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
Handbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Self-citationSmall Worlds: The Dynamics of Networks between Order and Randomness.
Grossman, J. W., & Watts, D. J. (2000) · The American Mathematical Monthly · doi:10.2307/2589138 · Cited by 474
Clique is hard to approximate within n/sup 1-ε/
Hastad, J. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548522 · Cited by 458
Statistical analysis of financial networks
Boginski, V., Butenko, S., & Pardalos, P. M. (2005) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.02.004 · Cited by 409
Self-citationA Random Graph Model for Power Law Graphs
Aiello, W., Chung, F., & Lu, L. (2001) · Experimental Mathematics · doi:10.1080/10586458.2001.10504428 · Cited by 405
The large-scale organization of metabolic networks
Jeong, H., Tombort, B., Albert, R., Oltvai, L. N., & Barabási, A.-L. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.211 · Cited by 279
Probabilistic checking of proofs; a new characterization of NP
Arora, S., & Safra, S. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267824 · Cited by 275
Mathematical Programming for Data Mining: Formulations and Challenges
Bradley, P. S., Fayyad, U. M., & Mangasarian, O. L. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.3.217 · Cited by 247
On maximum clique problems in very large graphs
Abello, J., Pardalos, P., & Resende, M. (1999) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/050/06 · Cited by 221
Self-citationGraph Theory in Practice: Part II
Hayes, B. (2000) · American Scientist · doi:10.1511/2000.2.104 · Cited by 76
Cited by
A review on algorithms for maximum clique problems
Wu, Q., & Hao, J.-K. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.09.064 · Cited by 314
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Balasundaram, B., Butenko, S., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 302
Self-citationArtificial Intelligence Applied to Stock Market Trading: A Review
Ferreira, F. G. D. C., Gandomi, A. H., & Cardoso, R. T. N. (2021) · IEEE Access · doi:10.1109/access.2021.3058133 · Cited by 187
Applications of near-term photonic quantum computers: software and algorithms
Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8504 · Cited by 128
Metadata
- Authors
- Boginski, V., Butenko, S., & Pardalos, P. M.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2006-11
- Volume
- 33
- Issue
- 11
- Pages
- 3171-3184
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2123963758
- Cited by
- 283
- References
- 23
- FWCI
- 14.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.