
doi: 10.1002/rsa.1014
AbstractWe study parkings with n places, where m(n) cars are placed according to a nonuniform probability. The aim of this paper is to show a threshold function (depending on the distribution) for the emergence of a giant component. The size of the largest blocks of consecutive occupied places and the total displacement of the cars are also studied. ©2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 364–380, 2001.
giant component, Analysis of algorithms and problem complexity, parking, Search theory, Searching and sorting, threshold function
giant component, Analysis of algorithms and problem complexity, parking, Search theory, Searching and sorting, threshold function
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
