Asymptotics of Parking Search in Hyperfractal Networks
Pith reviewed 2026-05-08 01:50 UTC · model grok-4.3
The pith
In hyperfractal Manhattan networks the expected parking search distance decays as a power law with exponent equal to the inverse hyperfractal dimension.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that the expected distance to the first available parking slot exhibits a power-law decay with exponent equal to the inverse of the hyperfractal dimension as the total intensity grows. This is established by applying Mellin-transform asymptotics to the self-similar harmonic sums that arise in the recursive Manhattan network under Poisson slot releases. The exponent depends solely on the large-scale geometry, and the result extends to the variance, the number of turns, and a modified search strategy, while remaining robust to mild random modulations of street intensities.
What carries the argument
The self-similar harmonic sums derived from the hyperfractal intensity measure on the recursive Manhattan network, whose asymptotics are extracted via Mellin transforms.
If this is right
- The scaling exponent is determined exclusively by the large-scale geometry of the network.
- Random multiplicative changes to street intensities alter only the multiplicative prefactor, not the exponent.
- The same power-law scaling applies to the variance of the distance and to the number of turns required before parking.
- A jump-over variant of the search strategy exhibits similar scaling behavior.
Where Pith is reading between the lines
- This scaling may generalize to other resource-location problems in self-similar urban infrastructures.
- Finite-size effects in practical networks could be quantified by truncating the recursive construction at a given depth.
- The robustness to heterogeneity suggests that approximate models of real cities could still capture the leading asymptotics.
Load-bearing premise
The intensity measure must be exactly hyperfractal with self-similarity holding at every scale in the recursive Manhattan geometry.
What would settle it
Simulate the parking search process on a large but finite recursive Manhattan grid with hyperfractal intensities and increasing total rate lambda; the measured average distance should scale proportionally to lambda to the power of minus one over the hyperfractal dimension.
Figures
read the original abstract
We study the asymptotic behaviour of the distance to the first available parking slot in a recursive Manhattan street network endowed with a hyperfractal intensity structure, where slot-release events occur according to Poisson processes along the streets. We establish, by analysing the associated self-similar harmonic sums via Mellin-transform asymptotics, a power-law decay of the expected distance as the total intensity grows, with exponent equal to the inverse of the hyperfractal dimension. In particular, the scaling exponent depends only on the large-scale geometry of the network. We further prove that this exponent is robust under random multiplicative modulations of the street intensities: mild stochastic heterogeneity affects only the multiplicative constant. Similar scaling behaviour holds for the variance, the number of turns before parking, and for a jump-over variant of the search strategy.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the asymptotic behaviour of the distance to the first available parking slot in a recursive Manhattan street network endowed with a hyperfractal intensity structure, where slot-release events occur according to Poisson processes along the streets. By analysing the associated self-similar harmonic sums via Mellin-transform asymptotics, the authors establish a power-law decay of the expected distance as the total intensity grows, with exponent equal to the inverse of the hyperfractal dimension. They further prove that this exponent is robust under random multiplicative modulations of the street intensities (affecting only the multiplicative constant) and show similar scaling behaviour for the variance, the number of turns before parking, and for a jump-over variant of the search strategy.
Significance. If the Mellin-transform analysis is carried through with full control of error terms, the result supplies a clean, geometry-driven asymptotic for search distances on exactly self-similar recursive networks. The fact that the leading exponent is extracted directly from the location of the dominant pole and remains insensitive to multiplicative intensity perturbations is a genuine strength; it isolates the contribution of large-scale fractal geometry from local fluctuations. The extension to variance and auxiliary quantities broadens the applicability. The stress-test concern about missing derivation does not land once the full proofs are examined; the technique is standard for self-similar sums and appears to be applied correctly.
major comments (2)
- §4 (Mellin asymptotics of the self-similar sums): the leading-term extraction from the dominant pole is stated to give exactly the claimed exponent, but the manuscript must supply an explicit contour-integral remainder estimate showing that contributions from other poles or the horizontal line are o(λ^{-1/D}) uniformly in the modulation parameters; without this, the power-law claim is not fully justified for the expected distance.
- Theorem 3.2 (robustness under multiplicative modulations): the argument that the pole location is unchanged relies on the intensity measure remaining hyperfractal after modulation; the proof should verify that the Mellin transform of the modulated sum still admits an analytic continuation to the same half-plane with the identical rightmost pole, or provide a counter-example when the modulation variance exceeds a threshold.
minor comments (3)
- The definition of the hyperfractal dimension D (presumably via the similarity equation for the intensity measure) should be stated explicitly in §2 before it is used in the exponent; cross-reference to the recursive construction of the Manhattan network would help.
- Notation for the total intensity λ and the local street intensities should be introduced once and used consistently; occasional switches between λ and Λ create unnecessary ambiguity in the asymptotic statements.
- The jump-over variant is introduced only in the abstract and §6; a short paragraph in the model section describing how the search rule differs from the standard nearest-slot rule would improve readability.
Simulated Author's Rebuttal
We thank the referee for the positive assessment and the recommendation for minor revision. The comments are constructive and we address each one below, indicating the revisions we will make to strengthen the manuscript.
read point-by-point responses
-
Referee: §4 (Mellin asymptotics of the self-similar sums): the leading-term extraction from the dominant pole is stated to give exactly the claimed exponent, but the manuscript must supply an explicit contour-integral remainder estimate showing that contributions from other poles or the horizontal line are o(λ^{-1/D}) uniformly in the modulation parameters; without this, the power-law claim is not fully justified for the expected distance.
Authors: We agree that an explicit remainder estimate strengthens the justification. The analysis in Section 4 extracts the leading asymptotic from the dominant pole using standard Mellin-transform methods for self-similar sums. In the revision we will add a new lemma providing the required contour-integral bound, confirming that the error term is o(λ^{-1/D}) uniformly in the modulation parameters (under the bounded-moment assumptions already stated in the paper). This will be placed immediately after the leading-term extraction. revision: yes
-
Referee: Theorem 3.2 (robustness under multiplicative modulations): the argument that the pole location is unchanged relies on the intensity measure remaining hyperfractal after modulation; the proof should verify that the Mellin transform of the modulated sum still admits an analytic continuation to the same half-plane with the identical rightmost pole, or provide a counter-example when the modulation variance exceeds a threshold.
Authors: We thank the referee for requesting this clarification. The proof of Theorem 3.2 shows that the modulated intensity measure preserves the hyperfractal structure (via the recursive construction and the moment conditions on the multipliers), which directly implies that the Mellin transform admits the same analytic continuation and retains the identical rightmost pole. In the revised version we will insert a short paragraph (or short appendix note) explicitly verifying the continuation to the half-plane Re(s) > -1/D under the stated bounded-variance assumption. We will also add a remark noting that if the modulation variance becomes unbounded in a way that destroys the hyperfractal property, the theorem no longer applies; no counter-example is needed inside the theorem's hypotheses. revision: yes
Circularity Check
No significant circularity detected in derivation
full rationale
The paper applies standard Mellin-transform asymptotics to self-similar harmonic sums generated by the recursive Manhattan hyperfractal intensity model with independent Poisson releases. The claimed power-law exponent for expected distance is derived as the reciprocal of the hyperfractal dimension, which enters as a fixed geometric input parameter of the intensity measure rather than being fitted or redefined within the analysis. No steps reduce the target result to a fitted constant, self-citation chain, or ansatz smuggled from prior work; the robustness claims under multiplicative perturbations are likewise obtained analytically from the same pole-location argument. The derivation is self-contained against the model assumptions.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The intensity measure on the recursive Manhattan network is exactly hyperfractal (self-similar at every scale).
- domain assumption Slot-release events occur as independent Poisson processes along streets.
Reference graph
Works this paper leans on
-
[1]
Fractal Cities: A Geometry of Form and Function
Michael Batty and Paul Longley. Fractal Cities: A Geometry of Form and Function . Academic Press, 1994
work page 1994
-
[3]
Mellin transforms and asymptotics: Harmonic sums
Philippe Flajolet, Xavier Gourdon, and Philippe Dumas. Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science , 144(1--2):3--58, 1995
work page 1995
-
[4]
Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity
Christine Fricker and Nicolas Gast. Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity. EURO Journal on Transportation and Logistics , 5(3):261--291, 2016
work page 2016
-
[5]
Christine Fricker, Hanene Mohamed, and Alessia Rigonat. Stochastic averaging and mean-field for a large system with fast varying environment with applications to free-floating car-sharing. Queueing Systems , 109(4):1--27, 2025
work page 2025
-
[6]
Self-similar geometry for ad-hoc wireless networks: Hyperfractals
Philippe Jacquet and Dalia Popescu. Self-similar geometry for ad-hoc wireless networks: Hyperfractals. In Geometric Science of Information , Lecture Notes in Computer Science, pages 522--529. Springer, 2017
work page 2017
-
[7]
Does car-sharing reduce car ownership? empirical evidence from germany
Aaron Kolleck. Does car-sharing reduce car ownership? empirical evidence from germany. Sustainability , 13(13):7384, 2021
work page 2021
-
[8]
Sarah Toy, Lorraine Whitmarsh, and Yixian Sun. Zero-car households---constraint or lifestyle choice? a systematic literature review of the factors affecting non-car ownership. Transport Reviews , 45(3):390--412, 2025
work page 2025
-
[9]
Generating random hyperfractal cities
Geoffrey Deperle and Philippe Jacquet. Generating random hyperfractal cities. arXiv preprint , arXiv:2512.01505, 2025. URL: https://arxiv.org/abs/2512.01505
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.