Wikipedia:Articles for deletion/Network capacity


 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review).  No further edits should be made to this page.

The result was Restored previous redirect as the new material is copyvio, too-close paraphrasing from http://link.springer.com/10.1140/epjb/e2016-70395-8 and https://doi.org/10.1016/j.physa.2016.09.034. — Diannaa 🍁 (talk) 14:16, 27 March 2018 (UTC)

Network capacity

 * – ( View AfD View log  Stats )

This is a paper presenting novel research, weakly disguised as an encyclopedic article. Of the references, two are to the author of the metric; all others predate its "introduction" (2016), often by decades, and deal with already well-covered concepts such as network bottlenecks and network traffic optimization. There's no indication that Kerner's approach is widely used or cited (main paper has 10 cites on Scholar, of which 7 are self-cites). Promotional OR. -- Elmidae (talk · contribs) 09:33, 26 March 2018 (UTC) Elmidae (talk · contribs) 09:33, 26 March 2018 (UTC)


 * Delete fails WP:NOT. Weakly disguised indeed. This is a scientific paper. It doesn't belong here. talk to ! dave 12:06, 26 March 2018 (UTC)
 * Note: This discussion has been included in the list of Technology-related deletion discussions. The Mighty Glen (talk) 13:31, 26 March 2018 (UTC)
 * Note: This discussion has been included in the list of Computing-related deletion discussions. The Mighty Glen (talk) 13:31, 26 March 2018 (UTC)


 * Delete I wouldn't call it OR by the strictest policy definition, since it did appear in a respectable journal first, but it definitely comes off as self-promotion. Indeed, the author has essentially copied blocks of text. In the Wikipedia article, we have the following:
 * Traffic breakdown in a traffic or transportation network occurs usually at some road locations of a traffic network called network bottlenecks. Traffic breakdown at a network bottleneck is a transition from free flow to congested traffic at the bottleneck (see, e.g., reviews and books about an analysis of traffic and transportation networks[2][3][4][5][6][7][8][9][10]). Network bottlenecks are caused, for example, by on- and off-ramps, road gradients, road-works, a decrease in the number of road lines (in the flow direction), traffic signals in city traffic, etc.
 * In, we read,
 * In known real field (empirical) traffic data, traffic breakdowns occur usually at the same road locations of a traffic network called network bottlenecks (e.g., [26, 27, 30–32]). Network bottlenecks are caused, for example, by on- and off-ramps, road gradients, road-works, a decrease in the number of road lines (in the flow direction), traffic signals in city traffic, etc.
 * So, yes, WP:COPYVIO. Furthermore, it presents a new, highly specific and not-yet-notable idea under the name of a very broad concept. This is just deceptive. XOR&#39;easter (talk) 18:04, 26 March 2018 (UTC)
 * Note: This discussion has been included in the list of Mathematics-related deletion discussions. XOR&#39;easter (talk) 18:14, 26 March 2018 (UTC)


 * If this is not a copyvio, then it should be transwikied to Wikiversity, which likes this sort of OR. Graeme Bartlett (talk) 23:30, 26 March 2018 (UTC)


 * Remain This is not a scientific paper: All results of this Wikipedia article have already several times been published in Literature (see “References” in this Wikipedia article). Rather than “promotion” of some research, this Wikipedia article can be very interesting for a very broad audience to readers that are interesting in the future development of traffic networks. There are two main reasons for this statement:
 * (i)	In the Wikipedia article, the importance of the application of a well-known minimum capacity of a road bottleneck for dynamic traffic assignment in a traffic network (rather than travel time) has been emphasized.
 * (ii)	In this Wikipedia article, a comparison of well-known of Wardrop’s equilibria used for standard dynamic traffic assignment with an alternative approach that is based on the maintenance of free flow conditions in the whole network has been made. In this approach, for any network link, the flow rate on the link should not exceed the minimum capacity of the link bottleneck.


 * Item (i) is well-known from the three-phase traffic theory that has been developed in 1996-2002. There are more than 1000 references to the book “The physics of traffic” (Springer, Berlin 2004) in which the theory of the relation of the minimum capacity with the probability of traffic breakdown has been explained (in general, there are more than 5000 references to publications related to the three-phase traffic theory).


 * Wardrop’s equilibria (item (ii)) are well-known since 1952. Since that time there are many thousands of references to Wardrop’s equilibria and their applications. All main approaches to dynamic traffic assignments are based on Wardrop’s equilibria. In this Wikipedia article, the standard approaches are questioned for reliable applications in the real world. The Wikipedia article should be interesting to a broad audience to readers that are interesting in the future development of traffic  networks. Mk85 2 (talk) 10:07, 27 March 2018 (UTC)
 * Sounds as if you could make a case for an article on the Wardrop equilibrium, which as of now is a section of the article on John Glen Wardrop - actually it has almost taken over that article; a spinoff might be useful for both sides of the equation. Or you could add material to any of the many articles that already exist on network traffic topics - start with the links in Network traffic and get browsing. However, you cannot make an article specifically based on a couple of little-cited papers and/or a neologistic coinage that has not seen wide uptake, and fill it with novel research. That's a job for a scientific journal, not an encyclopedia. -- Elmidae (talk · contribs) 11:19, 27 March 2018 (UTC)


 * Remain Although one can find a wide discussion of the term „network capacity“ in Web, there can be found no mathematical definitions what “network capacity“ is. I believe that in this Wikipedia article the first clear mathematical definition of the term “network capacity“ has been made. Therefore, I do believe that this article should as a Wikipedia article. — Preceding unsigned comment added by 141.113.3.13 (talk) 11:32, 27 March 2018 (UTC)
 * ...sigh... -- Elmidae (talk · contribs) 11:44, 27 March 2018 (UTC)


 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.