A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters allow false positives but the space savings often outweigh this drawback when the probability of an error is controlled. Bloom filters have been used in database applications since the 1970s, but only in…
Internet Mathematics Template
Write in a clean editor, then format for Internet Mathematics in one click — DocuGuru applies the official Taylor & Francis template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
About the Internet Mathematics format
Internet Mathematics is a peer-reviewed journal published by Taylor & Francis, covering Complex Network Analysis Techniques, Opinion Dynamics and Social Influence, Stochastic processes and statistical mechanics.
| Publisher | Taylor & Francis |
|---|---|
| Reference style | Author–year (Chicago, T&F) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Internet Mathematics 12 (3): 45–58.
Formats any DOI in Internet Mathematics style. No sign-up. |
| Publishes research in | Complex Network Analysis Techniques Opinion Dynamics and Social Influence Stochastic processes and statistical mechanics Graph theory and applications Game Theory and Applications |
| ISSN | 1542-7951 |
| h-index | 52 |
| i10-index | 148 |
| Total citations | 16,106 |
| Open access | Yes |
| Top institutions publishing here | University of California San Diego |
| Journal website | www.internetmathematics.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Papers published in Internet Mathematics per year
Citation impact of Internet Mathematics by publication year
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Most-cited papers in Internet Mathematics
A large body of work has been devoted to defining and identifying clusters or communities in social and information networks, i.e., in graphs in which the nodes represent underlying social entities and the edges represent some sort of interaction between pairs of nodes. Most such research begins with the premise that a community or a…
Recently, I became interested in a current debate over whether file size distributions are best modelled by a power law distribution or a lognormal distribution. In trying to learn enough about these distributions to settle the question, I found a rich and long history, spanning many fields. Indeed, several recently proposed models from the computer…
This paper serves as a companion or extension to the "Inside PageRank" paper by Bianchini et al. [Bianchini et al. 03]. It is a comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model,…
There is a large, popular, and growing literature on "scale-free" networks with the Internet along with metabolic networks representing perhaps the canonical examples. While this has in many ways reinvigorated graph theory, there is unfortunately no consistent, precise definition of scale-free graphs and few rigorous proofs of many of their claimed properties. In fact, it…