betaFeedback

WorksMathematics

Exponential Ergodicity and Invariant Distribution of a Degenerate Reflected SDE with Stable Noise

Abstract

We study a two-dimensional degenerate stochastic differential equation with oblique reflection and spectrally positive strictly stable noise of index in (1,2)(1,2), motivated by join-the-shortest-queue systems with heavy-tailed interarrival times. A polynomial-exponential Lyapunov function and fixed-time minorization establish positive Harris recurrence and exponential ergodicity in weighted total variation. We construct the invariant law from a stable path and prove its absolute continuity. Regulator identities describe stationary dependence and recover the joint Laplace transform from the queue marginal. Idleness inherits the classical stable Ornstein-Uhlenbeck tail; the queue has a sharp exponential tail with a polynomial prefactor whose power is half the stable index and a positive constant represented through regeneration. Conditional on small idleness, idleness divided by the conditioning threshold and the queue converge to independent beta and size-biased limits. Under large-queue conditioning, normalized idleness and queue excess converge to independent Mittag-Leffler and exponential limits.

Introduction

In large-scale parallel server queueing networks, join-the-shortest-queue (JSQ) routing sends each arriving customer to a server with the fewest customers. Customers remain at their assigned server: a waiting customer is not transferred when another server becomes idle. Idle servers and waiting customers can therefore coexist, although arrivals always use an idle server when one is available. Understanding steady-state congestion thus requires a joint description of idleness and waiting. For parallel exponential servers with Poisson arrivals, Eschenfeldt and Gamarnik [16] give such a description via a two-dimensional reflected diffusion in the Halfin–Whitt regime.

Heavy-tailed interarrival times introduce a different source of variability. A long arrival gap allows many services to finish and can create substantial idleness. When the interarrival-time tail is regularly varying with index −α-\alpha, where 1<α<21 < \alpha< 2, stable limits for renewal processes motivate an α\alpha-stable Lévy process in place of Brownian noise ([40], Section 6.3). In the idleness equation, positive jumps represent increases in idle capacity caused by long arrival gaps. We study a reflected stochastic differential equation (SDE) with this stable input and positive spare-capacity parameter β\beta. The routing rule determines how arrival variability affects the two state variables. Let II denote the scaled number of idle servers and QQ the scaled number of servers with at least one waiting customer. When an idle server is available, arrivals enter service immediately rather than queue. Arrival fluctuations therefore change II without adding to QQ, while service completions reduce existing queues. At the scale motivating our model, service-completion fluctuations vanish, so QQ decays deterministically as long as I>0I > 0. When no server is idle, further arrivals must wait. In the limiting SDE, the nondecreasing regulator UU can increase only at I=0I = 0, offsetting any decrease that would make II negative and adding the same amount to QQ. Its increments act in direction (1,1)(1,1), rather than the inward normal (1,0)(1,0) to the boundary I=0I = 0, making the reflection oblique. Arrival variability thus affects queue growth through the regulator, although the queue equation has no separate noise term. We study how quickly this process approaches equilibrium and how arrival fluctuations and reflection shape its joint stationary law.

Main results and approach

We prove positive Harris recurrence and exponential convergence to equilibrium. Our convergence estimate allows observables with polynomial growth in idleness and exponential growth in the queue: it holds in the weighted total variation norm for (1+i)peθq(1+i)^{p}e^{\theta q} for every 0<p<α0 < p < \alpha and 0<θ<θc0 < \theta< \theta_c, where θc\theta_c is the positive zero of the input’s Laplace exponent after adding the spare-capacity drift. These thresholds also define the exact stationary polynomial–exponential moment domain (Theorems 1 and 4).

We construct a Lyapunov function that combines polynomial growth in idleness with the oblique derivative condition. Our fixed-time minorization uses boundary contact to transmit input randomness to the queue coordinate; two selected jump sizes then control the two terminal coordinates. Together with attraction of the zero-input dynamics, these estimates verify the hypotheses of continuous-time Harris theory [13, 34].

We use stationary queue balance to identify the regulator occupation measure, whose normalization is the size-biased stationary queue law. A separate idleness-weighting identity describes how observations change when weighted by idle capacity (Theorem 6). The regulator occupation identity expresses the boundary term in the joint-transform equation through the queue marginal. We use the idleness-weighting identity to obtain a queue density, then compare the stationary process with its reflection-free evolution and use the density of a stable stochastic convolution to prove joint absolute continuity (Proposition 9). Solving the joint-transform equation recovers the joint stationary law from the queue marginal (Theorem 7).

A complementary pathwise construction realizes a stationary state from a stable path on a fixed finite interval. Multiplying the queue coordinate by an exponential factor and changing time removes its linear decay. Successive integration and running-supremum operations then give a convergent recursion (Theorem 2). Using the same stable path for different values of spare capacity β\beta couples the stationary queue laws: the queue is stochastically nonincreasing in β\beta, and its mean is convex in β\beta. Thus equal increases in spare capacity yield nonincreasing reductions in the mean queue coordinate (Proposition 10).

The tail analysis shows how input asymmetry appears in stationarity. A convolution representation separates a stable Ornstein–Uhlenbeck (OU) term from an exponentially integrable correction. Idleness therefore inherits the power-law tail of the stable OU law, with constant cA/α2c_A/\alpha^2 under our normalization [22, 37]. In contrast, the queue tail is asymptotic to Cπxα/2e−θcxC_\pi x^{\alpha/2}e^{-\theta_c x} (Theorem 3). The Laplace exponent of the input with spare-capacity drift determines the exponential rate, while the oblique derivative condition determines the polynomial power. A regenerative decomposition represents the positive constant CπC_\pi. Conditioning on a large queue yields independent Mittag–Leffler and exponential limits for rescaled idleness and queue excess, with typical idleness smaller than its conditional-mean scale (Corollary 2).

Near the reflecting face, conditioning on I≤εI \le\varepsilon yields a joint limit: I/εI/\varepsilon becomes asymptotically independent of a queue with the size-biased stationary law as ε↓0\varepsilon\downarrow0 (Theorem 5). The size-biased queue law also arises by normalizing the regulator occupation measure, linking boundary conditioning to stationary balance identities.

Related literature

The Brownian JSQ diffusion is the closest benchmark. Our nonnegative idleness coordinate is the negative of the centered busy-server coordinate in the Brownian formulation [16]. Braverman [9] proves exponential ergodicity of this diffusion and tightness of the scaled stationary distributions of the queueing systems, using drift-based fluid limit Lyapunov functions within the generator expansion framework. Banerjee and Mukherjee [7] construct regenerative cycles and obtain Gaussian-type bounds for the idleness tail and exponential-type bounds for the queue tail. Their subsequent work studies stationary moments and sensitivity to the spare-capacity parameter [8]. The regulator and mixed-moment relations in that work, together with exponential integrability of the queue, imply the Brownian counterparts of our regulator-occupation and idleness-weighting identities. These identities describe structure shared by the Brownian and stable-driven equations.

Our stationary construction is related to the backward construction of Loynes [31] and to the correspondence between self-similarity and stationarity associated with Lamperti [30]. Transform methods and asymptotic analysis for Lévy-driven queues are surveyed and developed by Dębicki and Mandjes [11, 12]. Kella [24] studies stability and nonproduct stationary distributions for fluid networks with Lévy inputs. Konstantopoulos et al. [27] establish stability and stationary equations for multidimensional Lévy networks with oblique reflection.

For unreflected Lévy-driven OU processes, Wang [39] gives conditions for exponential ergodicity. Arapostathis et al. [3] identify polynomial and exponential convergence regimes for piecewise OU processes arising from many-server queues, including sharp polynomial rates in the absence of abandonment under their assumptions. Related controlled models admit polynomial convergence bounds uniform over suitable classes of stationary Markov controls [2]. For a one-dimensional reflected OU process with spectrally positive Lévy input, Xing et al. [41] obtain stationary-distribution and transform results; their existence theorem assumes a nonzero Brownian component.

For constrained Brownian diffusions, Atar et al. [5] give sufficient conditions for positive recurrence, whereas Kang and Ramanan [23] characterize stationary distributions through a sub-martingale formulation. Quantitative convergence results are also available for reflected processes. Sarantsev [36] obtains explicit exponential convergence rates for reflected jump-diffusions on the half-line under conditions including exponential moments of the jumps. Huang and Pang [20] establish exponential convergence in total variation and Wasserstein distance for a two-dimensional OU process with normal reflection and nondegenerate Brownian input. Our process instead has pure stable noise acting only on idleness and a common oblique regulator.

More broadly, this work relates to the ergodicity of degenerate SDEs, where random forcing acts only in certain directions. For uniformly elliptic diffusions, regularity and Harnack estimates provide routes to transition-density bounds used to verify irreducibility and minorization. When the noise is degenerate, estimates based on uniform ellipticity no longer apply directly, and a central question is how the dynamics transmit randomness to the unforced coordinates. In many unreflected models, coupling through the drift provides this transmission: perturbations of the forced variables influence the remaining coordinates as the system evolves. Control-theoretic approaches to recurrence and invariant measures for degenerate diffusions are developed by Kliemann [26] and Arnold and Kliemann [4].

For hypoelliptic particle models, Mattingly and Stuart [32] combine Lyapunov estimates with transition-density and accessibility arguments to prove geometric ergodicity. Mattingly et al. [33] develop related arguments for SDEs and analyze when numerical approximations preserve ergodicity. These approaches combine control of large excursions with local estimates ensuring that trajectories from different initial states can reach common regions of the state space.

The propagation of randomness is also central to stochastic fluid dynamics with degenerate forcing. Weinan E and Jonathan C. Mattingly [15] prove exponential ergodicity for finite-dimensional Galerkin approximations of the two-dimensional Navier–Stokes equations. For the infinite-dimensional equations, Hairer and Mattingly [18] establish unique ergodicity on the relevant invariant subspace using the asymptotic strong Feller property and a weak form of irreducibility. For unreflected degenerate jump-driven SDEs, related regularity questions are studied under Hörmander-type conditions by Zhang [42] and, using a parametrix approach, by Huang and Menozzi [21].

In our model, reflection rather than the interior drift transmits randomness to the queue coordinate. While the regulator is inactive, the queue decays deterministically; randomness reaches that coordinate through regulator increments at the reflecting face. Our minorization construction makes this transmission quantitative: boundary contact followed by reflection-free evolution yields a common lower bound with a two-dimensional density. The accompanying Lyapunov argument accommodates both the heavy-tailed jumps and the oblique derivative condition.

Organization and notation

Section 22 specifies the SDE and states the main results. Sections 33 and 44 develop the Lyapunov and minorization arguments, and Section 55 characterizes the invariant law. Section 66 establishes the tail and boundary asymptotics, and Section 77 concludes. Appendix A gives the pathwise comparison and minorization proofs, and Appendix B gives the supporting queue-tail estimates. Appendices C to F contain the well-posedness and stable-input details, localization arguments, and further properties of the invariant law.

We write E=R+2E = \mathbb{R}_{+}^{2}, where R+=[0,∞)\mathbb{R}_{+} = [0,\infty), set x+=max⁡{x,0}x^{+} = \max\{x,0\}, and use the Euclidean norm unless the ℓ1\ell^{1} norm ∥(i,q)∥1=∣i∣+∣q∣\|(i,q)\|_{1} = |i| + |q| is specified. We write A⋐BA \Subset B when A‾\overline{A} is compact and contained in BB. For S⊆RdS \subseteq\mathbb{R}^{d}, the space D([0,T],S)D([0,T],S) consists of càdlàg paths with values in SS, and ∥x∥T=sup⁡0≤s≤T∥x(s)∥\|x\|_{T} = \sup_{0\leq s\leq T}\|x(s)\| denotes the uniform norm. We use ⟹\Longrightarrow for convergence in distribution. By C2(E)C^{2}(E) we mean restrictions to EE of C2C^{2} functions on a neighbourhood of EE; derivatives at the boundary are their one-sided limits from the interior. Constants may depend on the fixed model parameters; additional dependencies are indicated when relevant. For a measure μ\mu and a μ\mu-integrable function ff, write μ(f):=∫f dμ\mu(f) := \int f\,d\mu. For positive functions, f∼gf \sim g means that f/g→1f/g \to1 in the stated limit, whereas f≍gf \asymp g means that their ratio is bounded above and below by positive constants; subscripts on ≍\asymp indicate which parameters the comparison constants may depend on.

The reflected SDE and main results

Dynamics and pathwise properties

Fix α∈(1,2)\alpha\in(1,2), β>0\beta> 0, and cA>0c_{A} > 0. Let SαS_{\alpha} be a spectrally positive strictly α\alpha-stable Lévy process started at zero, with Lévy measure

νA(dz)=cAz−1−α1(0,∞)(z) dz.\nu_{A}(dz) = c_{A} z^{-1-\alpha}\mathbf{1}_{(0,\infty)}(z)\,dz.

The coefficient cAc_A sets the stable input scale. Since α>1\alpha> 1, the input has a finite first absolute moment, and strict stability implies E[Sα(t)]=0\mathbb{E}[S_\alpha(t)] = 0. For an initial state Y0=(I0,Q0)∈EY_0 = (I_0,Q_0) \in E, independent of future increments of SαS_\alpha, consider the reflected SDE for Y=(I,Q)Y = (I,Q):

It=I0+Sα(t)+∫0t(β−Is−Qs) ds+Ut,Qt=Q0−∫0tQs ds+Ut.(1)\begin{aligned} I_t &= I_0 + S_\alpha(t) + \int_0^t (\beta- I_s - Q_s)\,\mathrm{d}s + U_t,\\ Q_t &= Q_0 - \int_0^t Q_s\,\mathrm{d}s + U_t. \tag*{(1)} \end{aligned}

The regulator UU is nondecreasing, U0=0U_0 = 0, and

It≥0,∫0T1{It>0} dUt=0,T<∞.(2)I_t \ge0,\qquad\int_0^T \mathbf{1}_{\{I_t>0\}}\,\mathrm{d}U_t = 0,\qquad T < \infty. \tag*{(2)}

It can increase only on the face I=0I = 0 and contributes equally to both coordinates, giving the reflection direction (1,1)(1,1). The inward normal is (1,0)(1,0); the queue displacement makes the reflection oblique.

Two identities describe how reflection affects the state. Variation of constants in the queue equation yields

Qt=e−tQ0+∫(0,t]e−(t−s) dUs≥0.(3)Q_t = \mathrm{e}^{-t}Q_0 + \int_{(0,t]} \mathrm{e}^{-(t-s)}\,\mathrm{d}U_s \ge0. \tag*{(3)}

Thus QQ decays exponentially while UU is constant, and regulator increments contribute through the exponential kernel. Reflection acts only at I=0I = 0; the formula ensures nonnegativity of QQ without a second regulator at Q=0Q = 0. The common regulator cancels from the coordinate difference, giving

It−Qt=I0−Q0+Sα(t)+∫0t(β−Is) ds.(4)I_t - Q_t = I_0 - Q_0 + S_\alpha(t) + \int_0^t (\beta- I_s)\,\mathrm{d}s. \tag*{(4)}

This gives the stationary mean-idleness balance and is used in the stationary construction and tail analysis.

Let y=(i,q)∈Ey = (i,q) \in E be a deterministic state and use the superscript yy to indicate a solution started from yy.

Proposition 1 (Well-posedness and Markov properties). For every initial state y∈Ey \in E, (1) and (2) have a pathwise unique, nonexplosive strong solution Yy=(Iy,Qy)Y^y = (I^y,Q^y). The process is càdlàg, Feller–Dynkin, Borel right, and strong Markov. Both UU and QQ are continuous.

For two solutions driven by the same input, the initial ℓ1\ell^1 separation bounds both their later distance and the accumulated absolute difference in their idleness.

Proposition 2 (Nonexpansiveness in the initial state). For any common càdlàg input starting at zero and having no negative jumps, the corresponding solutions satisfy

∥Yty−Yty~∥1+∫0t∣Isy−Isy~∣ ds≤∥y−y~∥1,t≥0,y,y~∈E.(5)\left\|Y_t^y-Y_t^{\widetilde y}\right\|_1+\int_0^t\left|I_s^y-I_s^{\widetilde y}\right|\,\mathrm{d}s\le\left\|y-\widetilde y\right\|_1,\qquad t\ge0,\quad y,\widetilde y\in E. \tag*{(5)}

Appendix § 10 proves Proposition 1 and gives the finite-horizon estimate for changes in the input path. Appendix § 8.§ 1 proves Proposition 2.

Invariant distribution and exponential convergence

Mean reversion and reflection bring the process back to compact sets, which establishes positive Harris recurrence.

Proposition 3 (Positive Harris recurrence). The process YY is positive Harris recurrent and has a unique invariant probability measure π\pi.

References

  1. [1]David Applebaum. Lévy Processes and Stochastic Calculus, volume 116 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2009.
  2. [2]Ari Arapostathis, Hassan Hmedi, Guodong Pang, and Nikola Sandrić. Uniform polynomial rates of convergence for a class of lévy-driven controlled SDEs arising in multiclass many-server queues. In Modeling, stochastic control, optimization, and applications, pages 1–20. Springer, 2019.
  3. [3]Ari Arapostathis, Guodong Pang, and Nikola Sandrić. Ergodicity of a Lévy-driven SDE arising from multiclass many-server queues. The Annals of Applied Probability, 29(2):1070–1126, 2019.DOI
  4. [4]Ludwig Arnold and Wolfgang Kliemann. On unique ergodicity for degenerate diffusions. Stochastics, 21(1):41–61, 1987.DOI
  5. [5]Rami Atar, Amarjit Budhiraja, and Paul Dupuis. On positive recurrence of constrained diffusion processes. The Annals of Probability, 29(2):979–1000, 2001.DOI
  6. [6]Frank Aurzada and Steffen Dereich. Small deviations of general Lévy processes. The Annals of Probability, 37(5):2066–2092, 2009.DOI
  7. [7]Sayan Banerjee and Debankur Mukherjee. Join-the-shortest queue diffusion limit in Halfin–Whitt regime: Tail asymptotics and scaling of extrema. The Annals of Applied Probability, 29(2):1262–1309, 2019.DOI
  8. [8]Sayan Banerjee and Debankur Mukherjee. Join-the-shortest queue diffusion limit in Halfin–Whitt regime: Sensitivity on the heavy-traffic parameter. The Annals of Applied Probability, 30(1):80–144, 2020.DOI
  9. [9]Anton Braverman. Steady-state analysis of the join-the-shortest-queue model in the Halfin–Whitt regime. Mathematics of Operations Research, 45(3):1069–1103, 2020.arxiv.org/abs/1801.05121
  10. [10]Anton Braverman, J. G. Dai, and Masakiyo Miyazawa. Heavy traffic approximation for the stationary distribution of a generalized Jackson network: The BAR approach. Stochastic Systems, 7(1):143–196, 2017.
  11. [11]Krzysztof Dębicki and Michel Mandjes. Lévy-driven queues. Surveys in Operations Research and Management Science, 17(1):15–37, 2012.DOI
  12. [12]Krzysztof Dębicki and Michel Mandjes. Queues and Lévy Fluctuation Theory. Universitext. Springer, Cham, 2015.DOI
  13. [13]Douglas G. Down, Sean P. Meyn, and Richard L. Tweedie. Exponential and uniform ergodicity of Markov processes. The Annals of Probability, 23(4):1671–1691, 1995.DOI
  14. [14]Paul Dupuis and Ruth J. Williams. Lyapunov functions for semimartingale reflecting Brownian motions. The Annals of Probability, 22(2):680–702, 1994.DOI
  15. [15]Weinan E and Jonathan C. Mattingly. Ergodicity for the Navier–Stokes equation with degenerate random forcing: Finite-dimensional approximation. Communications on Pure and Applied Mathematics, 54(11):1386–1402, 2001.DOI
  16. [16]Patrick Eschenfeldt and David Gamarnik. Join the shortest queue with many servers. The heavy-traffic asymptotics. Mathematics of Operations Research, 43(3):867–886, 2018.arxiv.org/abs/1502.00999
  17. [17]William Feller. An Introduction to Probability Theory and Its Applications, volume II. John Wiley & Sons, New York, second edition, 1971.
  18. [18]Martin Hairer and Jonathan C. Mattingly. Ergodicity of the 2D Navier–Stokes equations with degenerate stochastic forcing. Annals of Mathematics, 164(3):993–1032, 2006.
  19. [19]J. Michael Harrison and Ruth J. Williams. Brownian models of open queueing networks with homogeneous customer populations. Stochastics, 22(2):77–115, 1987.
  20. [20]Dongzhou Huang and Guodong Pang. On the ergodic properties and invariant measure of a two-dimensional reflected Ornstein–Uhlenbeck process. Stochastic Systems, 15(4):337–370, 2025.DOI
  21. [21]Lorick Huang and Stéphane Menozzi. A parametrix approach for some degenerate stable driven SDEs. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 52(4):1925–1975, 2016.arxiv.org/abs/1402.3997
  22. [22]Henrik Hult and Filip Lindskog. On regular variation for infinitely divisible random vectors and additive processes. Advances in Applied Probability, 38(1):134–148, 2006.DOI
  23. [23]Weining Kang and Kavita Ramanan. Characterization of stationary distributions of reflected diffusions. The Annals of Applied Probability, 24(4):1329–1374, 2014.
  24. [24]Offer Kella. Stability and nonproduct form of stochastic fluid networks with Lévy inputs. The Annals of Applied Probability, 6(1):186–199, 1996.DOI
  25. [25]Offer Kella and Ward Whitt. Useful martingales for stochastic storage processes with Lévy input. Journal of Applied Probability, 29(2):396–403, 1992.DOI
  26. [26]Wolfgang Kliemann. Recurrence and invariant measures for degenerate diffusions. The Annals of Probability, 15(2):690–707, 1987.DOI
  27. [27]Takis Konstantopoulos, Günter Last, and Si-Jian Lin. On a class of Lévy stochastic networks. Queueing Systems, 46(3–4):409–437, 2004.DOI
  28. [29]Andreas E. Kyprianou. Fluctuations of Lévy Processes with Applications: Introductory Lectures. Universitext. Springer, Berlin, second edition, 2014.DOI
  29. [30]John Lamperti. Semi-stable stochastic processes. Transactions of the American Mathematical Society, 104(1):62–78, 1962.DOI
  30. [31]R. M. Loynes. The stability of a queue with non-independent inter-arrival and service times. Proceedings of the Cambridge Philosophical Society, 58(3):497–520, 1962.DOI
  31. [32]Jonathan C. Mattingly and Andrew M Stuart. Geometric ergodicity of some hypo-elliptic diffusions for particle motions. Markov Processes and Related Fields, 8(2):199–214, 2002.
  32. [33]Jonathan C. Mattingly, Andrew M. Stuart, and Desmond J. Higham. Ergodicity for SDEs and approximations: Locally Lipschitz vector fields and degenerate noise. Stochastic Processes and their Applications, 101(2):185–232, 2002.DOI
  33. [34]Sean P. Meyn and Richard L. Tweedie. Generalized resolvents and Harris recurrence of Markov processes. In Harry Cohn, editor, Doeblin and Modern Probability, volume 149 of Contemporary Mathematics, pages 227–250. American Mathematical Society, Providence, RI, 1993.DOI
  34. [35]R. N. Pillai. On Mittag–Leffler functions and related distributions. Annals of the Institute of Statistical Mathematics, 42(1):157–161, 1990.DOI
  35. [36]Andrey Sarantsev. Explicit rates of exponential convergence for reflected jump-diffusions on the half-line. ALEA, Latin American Journal of Probability and Mathematical Statistics, 13:1069–1093, 2016.arxiv.org/abs/1509.01783
  36. [37]Ken-iti Sato. Lévy Processes and Infinitely Divisible Distributions, volume 68 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999.
  37. [38]Michael Sharpe. General Theory of Markov Processes, volume 133 of Pure and Applied Mathematics. Academic Press, Boston, 1988.
  38. [39]Jian Wang. On the exponential ergodicity of Lévy-driven Ornstein–Uhlenbeck processes. Journal of Applied Probability, 49(4):990–1004, 2012.
  39. [40]Ward Whitt. Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York, 2002.DOI
  40. [41]Xiaoyu Xing, Wei Zhang, and Yongjin Wang. The stationary distributions of two classes of reflected Ornstein–Uhlenbeck processes. Journal of Applied Probability, 46(3):709–720, 2009.DOI
  41. [42]Xicheng Zhang. Densities for SDEs driven by degenerate α-stable processes. The Annals of Probability, 42(5):1885–1910, 2014.DOI

Paper details

vlnc:W_wutbkh4x
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 2

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents