Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Assemgul Kozhabek

dblp:370/7341 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0008-6762-640XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 50% Network measurement and analytics · 25% Internet of things and sensor networks · 25%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network topology
autonomous system topology
1.012026
A 27-Year Longitudinal Study on the Structure of the Internet Topology: Scale-Freeness and Preferential Attachment · IEEE Trans. Netw. 2026
Internet architecture and protocols › network topology
internet topology
1.012026
A 27-Year Longitudinal Study on the Structure of the Internet Topology: Scale-Freeness and Preferential Attachment · IEEE Trans. Netw. 2026
Internet of things and sensor networks › wireless sensor network
scale-free network
1.012026
A 27-Year Longitudinal Study on the Structure of the Internet Topology: Scale-Freeness and Preferential Attachment · IEEE Trans. Netw. 2026
Network measurement and analytics
topology analysis
1.012026
A 27-Year Longitudinal Study on the Structure of the Internet Topology: Scale-Freeness and Preferential Attachment · IEEE Trans. Netw. 2026
Graph algorithms and graph theory › random graph models
preferential attachment
0.312026
A 27-Year Longitudinal Study on the Structure of the Internet Topology: Scale-Freeness and Preferential Attachment · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

maximum-likelihood fitting · 2.0kolmogorov-smirnov test · 2.0
YearPublicationVenuePosition
2026 A 27-Year Longitudinal Study on the Structure of the Internet Topology: Scale-Freeness and Preferential Attachment
abstract
In this paper, we present a 27-year longitudinal study of the Internet topology at Autonomous System (AS)-level, from 1998 to 2025. The Internet has been claimed to be scale-free exhibiting power-law degree distribution. This claim has been challenged from several fronts (e.g., rigor of the statistical method, assumptions made on finiteness of the network, completeness of available data). Using the latest statistical methodology, we revisit and verify whether this claim still holds. Using power-law as the reference distribution, we use maximum-likelihood fitting method with goodness-of-fit tests based on the Kolmogorov-Smirnov statistic and likelihood ratios to identify the best fitting distribution among several common statistical distributions. In fact, being scale-free directly implies the property would remain over the passage of time and hence, we investigate how this has evolved over the past nearly three decades.We found that power-law is not the best fit for the degree distribution of the Internet. For most years, truncated power-law offers better fit while log-normal is often better than power-law. Furthermore, the simple preferential attachment model has been attributed as the underlying generative mechanism that consequently results in the topology we have today. Based on the two methods we used, we found that while there is indication of preferential attachment as previously discovered, this is only true for smaller values of degree rather than the entire distribution and that the attachment behavior hovers between both sub-linear and super-linear attachment regimes at different time points. Finally, we also found that new links do not only tend to attach to high-degree nodes. There is also a large number of new links that join low-degree nodes, contradicting the claim on new nodes prefer to join high-degree nodes. Nevertheless, when weighted by the number of nodes with specific degree ranges, the net effect of “rich-gets-richer” still stands due to imbalance node population across different degrees.
Wei Koong Chai, Assemgul Kozhabek, Benjamin Paul Dodwell
IEEE Trans. Netw.2