Abstract
Convex polygonal lines with vertices in and endpoints at and , such that , under the scaling , have limit shape with respect to the uniform distribution, identified as the parabola arc . This limit shape is universal in a large class of so-called multiplicative ensembles of random polygonal lines. The present paper concerns the inverse problem of the limit shape. In contrast to the aforementioned universality of , we demonstrate that, for any strictly convex -smooth arc started at the origin and with the slope at each point not exceeding , there is a sequence of multiplicative probability measures on the corresponding spaces of convex polygonal lines, under which the curve is the limit shape.
Keywords:
convex lattice polygonal lines; limit shape; multiplicative probability measure; local limit theorem MSC:
52A22; 05A17; 05D40; 52A10; 60F05; 60G50
1. Introduction
Consider a convex lattice polygonal line with vertices in , starting at the origin and such that the slope of each of its edges is non-negative that does not exceed . Convexity means that the slope of consecutive edges is strictly increasing. Denote by the set of all such polygonal lines with finitely many edges, and by the subset of polygonal lines with the right endpoint fixed at .
The limit shape, with respect to a sequence of probability measures on as , is understood as a planar curve such that, for any ,
where , with a suitable scaling transform , and is some metric, for example, induced by the Hausdorff distance between compact planar sets,
where is the Euclidean vector norm in .
Of course, the limit shape and its very existence may depend on the probability laws in the polygonal spaces . With respect to the uniform distribution on each (i.e., where all are assumed to be equally likely), the problem was solved independently by Vershik [1], Bárány [2], and Sinai [3], who showed that, if so that , then under the scaling , the limit (1) holds with respect to the Hausdorff metric and with the limit shape identified as the parabola arc
More precisely, in this case, the limit (1) transcribes as follows,
where denotes the cardinality of set A.
Bogachev and Zarbaliev [4,5] proved that the limit shape (3) holds for the parametric class of multiplicative measures () of the form
where the product is taken over all edges of , is the number of lattice points on the edge except its left endpoint, and the weights are specified according to the binomial formula,
This result provided the first evidence in support of a conjecture of the limit shape universality put forward by Vershik [1]. The class of probability measures (4) with the coefficients (5) belongs to a general metatype of decomposable combinatorial structures known as multisets [6]. Bogachev [7] extended the limit shape universality to a much wider class of multiplicative probability measures of the form (4) including the analogs of two other well-known metatypes of decomposable structures — selections and assemblies [6]; for example, this class includes the uniform distribution on the subset of “simple” polygonal lines (i.e., with no lattice points apart from vertices).
In a different development, a surprising universality result with the same limit shape (3) was obtained by Bureaux and Enriquez [8] under the uniform probability measure on the space of constrained convex lattice polygonal lines with a prescribed number of vertices growing with n, regardless of growth rate. On the other hand, it was demonstrated in [8] that, under additional constraints on the length of the polygonal line, the limit shape modifies to transverse a continuous family of convex curves interpolating between the hypotenuse, and a concatenation of the two legs of the limiting triangular container . Related results were obtained earlier by Bárány [9], Žunić [10], Stojaković [11], and Prodromou [12].
In the present paper, we consider a general inverse limit shape problem, and show that, in sharp contrast to the aforementioned universality of the curve (3), any -smooth strictly convex arc started at the origin may serve as the limit shape with respect to a suitable sequence of multiplicative probability measures on the polygonal spaces . See [13] for a short communication of this result, interpreted there in the sense of approximation of convex curves by random polygonal lines.
Like in [4,5,7], our construction employs an elegant probabilistic approach based on randomization and conditioning (see [6,14]), first used in the polygonal context by Sinai [3]. The idea is to introduce a suitable “global” probability measure Q defined on the space of all convex lattice polygonal lines with finitely many edges (hence, with a “free” right endpoint) and then obtain measures on the spaces by conditioning, that is, (). The measure Q is constructed as the distribution of an integer-valued random field with mutually independent components, defined on the subset consisting of points with coprime coordinates. A polygonal line is uniquely retrieved from a configuration using the collection of the corresponding edges (with ) and the convexity property (see Section 3).
It is convenient to set up the measure depending on a parameter function , such that the marginal distribution of each is defined to be geometric with “success” parameter . In view of the aforementioned association between polygonal lines and configurations , and by virtue of the product structure of the measure , the -probability of a polygonal line is proportional to the (finite) product . In the classical case (with uniform ), a good choice is to take (), yielding , where is the (random) right endpoint of the polygonal line .
To better adjust the measure to the conditional measure , the defining terminal condition is emulated using expectation with respect to , leading to a dependence of the parameters on . Furthermore, in order to suit a target curve as a hypothetical limit shape, the constants in the classical parameterization need to allow for a further dependence on to match . We derive a suitable parameter function in the form , assuming that the functions depend on through the ratio , which is convenient in conjunction with the parameterization of the curve using its tangent slope (see Section 2). As one would expect, if (see (3)) then the functions , are reduced to constants, and our method recovers the uniform distribution on .
To summarize, our main result is the following:
Theorem 1.
Let be a strictly convex -smooth arc, with endpoints and and with the curvature bounded from below by a positive constant. Suppose that , and set for polygonal lines . Then, there is a sequence of multiplicative probability measures on the polygonal spaces such that, for any ,
Remark 1.
Here and in what follows, signifies that so that . The term “multiplicative” is made more precise in Section 3 (see Remark 7).
Remark 2.
Remark 3.
As we see in Section 3, our measures were constructed merely by asymptotically fitting the running expectation of the (length of the) random polygonal line to the target curve γ, but with no explicit reference to the combinatorial properties of the underlying polygonal lines. It would be interesting to elaborate the combinatorial characterization of the multiplicative ensembles of polygonal lines under the measures and .
Remark 4.
It would be natural to try and relax the -smoothness condition on γ (e.g., by permitting “change points” or corners), and to allow for the degeneration of the curvature (e.g., through possible flat segments). We address these issues elsewhere.
Remark 5.
Product measures that are used in the general construction of multiplicative measures on the corresponding polygonal spaces are of interest in their own right. For instance, such measures are known in statistical physics as grand canonical Gibbs ensembles [15,16], and in computer science as Boltzmann distributions used in abundance for sampling from discrete combinatorial structures [17,18].
The rest of the paper is organized as follows. In Section 2, we introduce the space of convex curves on the plane and endow it with a suitable metric. In Section 3, the measures and are constructed for a given convex curve . In Section 4, the parameter function is chosen to guarantee the convergence of expectation of scaled polygonal lines to the target curve (Theorem 2). Refined first-order moment asymptotics are obtained in Section 5, while higher-order moment sums are analyzed in Section 6. Section 7 is devoted to the proof of a local central limit theorem (Theorem 7). Lastly, the limit shape result with respect to both and is proved in Section 8 (Theorems 8 and 9, respectively).
Some general notation. For a row vector , its Euclidean norm (length) is denoted , and is the corresponding inner product of vectors . We denote , , and similarly , . We use the floor function (integer part of ). The standard notation is used for asymptotic comparisons: means that ; that ; that is bounded; and that both and . We take the liberty to write for .
2. Preliminaries: Convex Planar Curves
Definition 1.
Let be the space of curves in represented as the graphs of functions () with the following properties:
- (i)
- (i.e., each curve γ starts at the origin);
- (ii)
- is nondecreasing and continuous on ;
- (iii)
- is piecewise differentiable on , with the derivative continuous everywhere except finitely many points; the (left) derivative at may be infinite, ;
- (iv)
- is convex on , that is, for any and any ,
Remark 6.
Convex polygonal lines can be treated as curves in ; the corresponding function is a piecewise linear function.
It follows from Definition 1 that, for any curve , the derivative is non-negative and nondecreasing in its domain, and in particular (), where
Set
with the convention that . That is, is a generalized inverse of the derivative (cf. [19], §1.5). It follows that the function is nondecreasing and right-continuous on , with values in ; moreover, for all and for all (see (7)). For shorthand, we write
Denote by the length of the part of where the tangent slope does not exceed t,
Clearly, every curve has finite length,
Let us now equip the space with a suitable metric. Define the map as follows,
Proposition 1.
The function defined in (11) satisfies all properties of a distance.
Proof.
Clearly, and . The triangle axiom is also obvious. Lastly, if , then the inequality (12) proven below implies that , and it follows that since is a distance. □
Proposition 2.
The metric is dominated by the metric as follows:
Proof.
By symmetry (see (2)), it suffices to show that
Any curve can be approximated simultaneously in and , by -smooth strictly convex curves (e.g., via the refinement of possible corners and/or flat edges in the arc ), so that
This reduces the inequality (13) to such curves. Note that
For a strictly convex increasing function , the function defined in (8) is given explicitly by
where is the (ordinary) inverse of the derivative . Differentiating formula (10) with respect to t, we find
and hence, using (9),
Integrating equations (16) and (17) by parts yields
Note that these equations are linear in . Recalling the definition (11) of , from formula (18) we obtain
and similarly
Returning to (14), by the estimates (19) and (20) we obtain the bound (13), which completes the proof of Proposition 2. □
Consider a fixed convex curve , represented as the graph of an increasing convex function , which for definiteness was assumed to be defined on the interval . We are working under the following
Assumption 1.
The function is strictly increasing and strictly convex on , and . In particular, and for all . Moreover, the curvature of the curve γ, given by the formula
is uniformly bounded away from zero,
3. Construction of the Measure
Consider the set of all pairs of coprime non-negative integers:
where “gcd” stands for “greatest common divisor”. In particular, pairs and are included in this set, but pair is not. Let be the space of functions , and consider the subspace of functions with finite support, , where . It is easy to see that the space is in one-to-one correspondence with the space of all (finite) convex lattice polygonal lines [3,5]. Indeed, each determines the direction of a potential edge, utilized only if , in which case the value specifies the scaling factor, altogether yielding a vector edge ; lastly, assembling all such edges into a lattice polygonal line is uniquely determined by fixation of the starting point (at the origin) and the convexity property. Degenerate configuration formally corresponds to the “trivial” polygonal line with coinciding endpoints. In what follows, we identify the spaces and .
Now, a probability measure is introduced on the space as the distribution of an integer-valued random field with mutually independent components and geometric marginals:
The subscript z in the notation refers to a parameter function (); its explicit form, adjusted to a given curve , is specified in Section 4. So far, we only assume that
By virtue of the one-to-one association , the -probability of each polygonal line is given by
The expression (27) is well defined; indeed, the first product on the right-hand side is finite because , whereas the second product is convergent due to condition (26).
The measure , formally defined as a product measure on the space , is in fact concentrated on the subspace of configurations with finite support.
Lemma 1.
Condition (26) is necessary and sufficient in order that .
Proof.
As a result, with -probability 1 a realization of the random field determines a (random) convex polygonal line . Denote by the right endpoint of ,
The measure induces a conditional distribution on ,
Substituting formula (27), the measure (30) is expressed in a more intrinsic form as a product of certain weights across the polygonal edges (cf. (4)),
where the multiplicative weight for an edge is given by
and is the normalization factor,
Remark 7.
The product formula (31) explains and justifies the term “multiplicative” used throughout the paper, including its title and main Theorem 1.
4. Calibration of the Parameter Function
In the above construction, the measure depends on the parameters . So far, the function was only assumed to guarantee convergence of the infinite product (26). Let us now adjust it to a given curve and to the terminal condition that specifies the subspace .
Let denote the part of the polygonal line in which the slope of edges does not exceed . Recalling the association described in Section 3, the polygonal line is determined by the truncated configuration , where . Denote by the right endpoint of (cf. (29)),
and by its length,
Let us impose the following calibration condition:
where stands for the expectation with respect to the measure and is the corresponding length function associated with a given curve (see (10)). We seek the function in the form
where
and is a function on such that
According to the geometric distribution (25), we have (see [20], §XI.2, p. 269)
Then, from (33), (38) and (35) we obtain
To deal with sums over the sets , the following lemma is instrumental. Recall that the Möbius function () is defined as follows: , if m is a product of d different prime numbers, and otherwise (see [21], §16.3, p.234); in particular, for all .
Lemma 2.
Let be a function such that and
For , consider the functions
Then the following identities hold for all
Proof.
Recalling the definition (24) of the set , observe that ; hence, the definition of in (41) is reduced to the first formula in (42). Furthermore, from (41) we have , and the representation for in (42) follows by the Möbius inversion formula (see [21], Theorem 270, p.237), provided that . To verify the last condition, using (41) we obtain
according to (40). This completes the proof of the lemma. □
Introduce the notation
where is the Riemann zeta function.
Theorem 2.
Proof.
Let us set
for simplicity, suppressing in the notation the dependence on t. Following the notation (41) of Lemma 2, the representation (39) is rewritten as
Let be a constant such that (see (37)). From (42) and (46) we have
In particular, this gives , uniformly in , and it follows that condition (40) of Lemma 2 is satisfied. Hence, using (42) and (48), and recalling that , from (47) with we obtain
Taking into account the estimate (49), we see that the general term in the double sum over in (50) admits a uniform bound of the form , which is a term of a convergent series. Therefore, we can apply Lebesgue’s dominated convergence theorem to pass to the limit in (50) termwise as . In order to find this limit, note that the internal double series over , in (50) is a Riemann sum for the double integral
Moreover, this sum converges to Integral (51) as , since the integrand function in (51) is directly Riemann integrable, as follows from an estimation similar to (49).
By the change of variables , (with the Jacobian ) the integral (51) is reduced to
Substituting this into (50), observe, recalling the notation (43), that
where the identity readily follows by the Möbius inversion formula (42) with , (cf. [21], §17.5, Theorem 287, p.250). Hence, combining (50), (52), and (53) with the calibrating condition (34), we arrive at the equation
According to definitions (8) and (10), we have for and for , while for the derivative is determined by formula (16), where , due to (15) and the differentiation rule for the inverse function. Hence, differentiating the identity (54) with respect to t, we obtain (44) and (45). □
Let us now check that the equation (45) has a suitable solution.
Proposition 3.
Proof.
Remark 8.
Assumption 2.
Throughout the rest of the paper, we assume that the parameters are chosen according to formulas (35) with the functions , given by (44), (55). In particular, the measure becomes dependent on the target curve , -probabilities, and the corresponding expected values. To emphasize this dependence, we explicitly include γ in the notation by writing and .
5. Asymptotics of the Expectation
In this section, we derive a few corollaries from the above choice of , assuming throughout that Assumptions 1 and 2 are satisfied.
Theorem 3.
The convergence in (34) is uniform in ,
We use the following simple criterion for uniform convergence of monotone functions (see [22], Sec. 0.1, and [5], Lemma 4.3).
Lemma 3.
Let a sequence of monotone functions on a finite interval converge pointwise to a continuous (monotone) function. Then, this convergence is uniform on .
Proof of Theorem 3.
For each , the function
is nondecreasing in t, and the limiting function given by (10) is continuous on . Hence, by Lemma 3 the convergence in (56) is uniform in t on every finite interval . To complete the proof, it suffices to check that for any and for large enough n, there exists such that for all
Using (39), similarly to (49), we can write
Note that the number of integer pairs (with , ) satisfying the conditions and does not exceed . Hence, again using the estimate (49), we see that the right-hand side of (58) is bounded by
Finally, since , this implies the estimate (57) for all t large enough. □
Recall that denotes the right endpoint of (see (32)).
Theorem 4.
Uniformly in we have
In particular, for this yields
Proof.
For the future applications, we need to estimate the rate of convergence in (60) with sufficient accuracy. To this end, we require some more smoothness of function .
Assumption 3.
In addition to Assumptions 1 and 2, we now suppose that .
Theorem 5.
Under Assumption 3, as .
Proof.
Consider (the case is handled similarly). From (61) with we have
where
Repeating the calculations as in (62), we note that
so that
Hence, we obtain the representation
where
Using that (cf. the proof of (50)), we have
Hence, as and for any as . Therefore, the function is well-defined for all and its Mellin transform ([23], Ch. VI, §9).
is a regular function for . From a two-dimensional version of the Müntz formula (see [5], Lemma 5.1), it follows that is meromorphic in the half-plane and has a single (simple) pole at point . Moreover, for all
The inversion formula for the Mellin transform ([23], Theorem 9a, pp. 246–247) yields.
In order to make use of formula (66), we need to find explicitly the analytic continuation of the function (65) to the strip . Let us use the Euler–Maclaurin summation formula (see, e.g., [24], §12.2)
where . Applying this formula to the sum over in (63), we obtain
where (see (45))
Keeping track of only the main term in (67), and writing dots for functions that are regular for , the Mellin transform of can be represented as follows:
where
Recalling formula (21), the function (68) may be rewritten in the form:
and Assumption 1 implies that the function is regular if . Furthermore, it is well known that the gamma function is analytic for ([25], §4.41, p. 148), whereas the zeta function has a single pole at point ([25], §4.43, p. 152). It follows that the right-hand side of (69) is regular in the strip and hence provides the required analytic continuation of the function originally defined by (65).
Setting and returning to formulas (64) and (66), we get for
Using that for , we can transform the contour of integration in (70) into the union of a small semi-circle () and two vertical lines, (). Furthermore, studying the resolution (69), one can show that as . As a result, the right-hand side of (70) is bounded by . Thus, the proof of the theorem for is complete. □
6. Asymptotics of Higher-Order Moments
6.1. Second-Order Moments
According to the geometric distribution (25), we have (see [20], §XI.2, p. 269)
Denote , where (see (29)). Let be the covariance matrix (with respect to the measure ) of the random vector . Since are mutually independent, we see using (71) that the elements of the matrix are given by
Theorem 6.
Under Assumptions 1 and 2,
where the elements of the matrix are given by
Proof.
Lemma 4.
Under Assumptions 1 and 2,
Proof.
The proof readily follows from Theorem 6. □
From Theorem 6 and Lemma 4, it follows (e.g., using the Cauchy–Schwarz inequality) that the matrix is (asymptotically) positive definite; in particular, and hence is invertible. Let be the (unique) square root of , that is, a symmetric positive definite matrix such that . Recall that the matrix norm induced by the Euclidean vector norm is defined by . We need some general facts about this norm (see [5], §7.2, pp. 33–34, for simple proofs and bibliographic comments).
Lemma 5.
If A is a real matrix then .
Lemma 6.
If is a real matrix, then
Lemma 7.
Let A be a symmetric matrix with . Then
We can now prove the following estimates for the norms of the matrices and .
Lemma 8.
Under Assumptions 1 and 2,
Proof.
Using Theorem 6 and the upper bound in Lemma 6, we obtain
On the other hand, by Theorem 6 and the lower bound in Lemma 6,
Combining (76) and (77), we obtain the first estimate in (75).
Furthermore, Lemma 5 implies that . In turn, Lemma 7 yields , and it remains to use Lemmas 4 and 8 to obtain the second part of (75). □
6.2. Asymptotics of the Moment Sums
Denote (), and for set
(for notational simplicity, we suppress the dependence on and z).
The following two-sided estimate of can be easily proved using Newton’s binomial formula and Lyapunov’s inequality (cf. [5], Lemmas 6.2 and 6.6).
Lemma 9.
For each and all ,
Next, we need a general upper bound for the moments of geometric random variables proved in [5], Lemma 6.3.
Lemma 10.
For each , there exists a constant such that, for all ,
Using the estimate (79) and repeating the calculations in [5], Lemma 6.4, we obtain the following asymptotic bound.
Lemma 11.
Under Assumptions 1 and 2, for each
Lemma 11, together with the bounds (78) and Theorem 6, implies the following asymptotic estimate (cf. [5], Lemma 6.6).
Lemma 12.
Under Assumptions 1 and 2, for any integer
Using Lemma 12, the next asymptotic bound is obtained by a straightforward adaptation of Lemma 6.7 in [5].
Lemma 13.
For each ,
Lastly, let us consider the Lyapunov coefficient
The next asymptotic estimate is an immediate consequence of Lemmas 8 and 12.
Lemma 14.
Under Assumptions 1 and 2, one has .
7. Local Limit Theorem
The role of a local limit theorem is to yield the asymptotics of the terminal probability appearing in the representation of the measure as a conditional distribution, (see (30)).
As before, we denote by and the expectation vector and covariance matrix of the random vector . Let be the density of a standard two-dimensional normal distribution (i.e., with zero mean and identity covariance matrix),
Then, the density of the normal distribution is given by
Theorem 7.
Under Assumptions 1 and 2, uniformly in
Let us make some preparations for the proof. Recall that the random variables are mutually independent and have geometric distribution with parameter , respectively. In particular, their characteristic functions are given by
Hence, the characteristic function of the vector reads
Let us start with a general absolute estimate for the characteristic function of a centered random variable (for a proof, see [5], Lemma 7.10).
Lemma 15.
Consider the random variable and its characteristic function . Then,
The next lemma provides two estimates (proved in [5], Lemmas 7.11 and 7.12) for the characteristic function of the centered vector
Recall that the Lyapunov coefficient is defined in (80), and .
Lemma 16.
(a) For all ,
(b) If then
The next global bound is obtained by repeating the proof of Lemma 7.14 in [5].
Lemma 17.
For all ,
where
We can now proceed to the proof of Theorem 7.
Proof of Theorem 7.
By the Fourier inversion formula, we can write
where . On the other hand, the characteristic function corresponding to the normal probability density (see (81)) is given by
so by the Fourier inversion formula
Note that if , then, according to Lemmas 8 and 14,
which of course implies that . Using this observation and subtracting (85) from (84), we obtain, uniformly in , that
by denoting
By the substitution , the integral is reduced to
on account of Lemmas 4, 14 and 16. Similarly, again putting and passing to the polar coordinates, we get, due to Lemmas 4 and 14,
Finally, let us turn to . Using Lemma 17, we obtain
where is given by (83). The condition implies that ; hence, , where is suitable (small enough) constant. Indeed, assuming the contrary, from (36) and Lemmas 8 and 14 it would follow that
which is a contradiction. Hence, the estimate (89) is reduced to
Note that, by Assumption 1 and formulas (55), the functions , are bounded above, . Hence, (83) implies
To estimate the first integral in (90), by keeping in the sum (91) only , , we obtain
because for any . Since , we have
Substituting this estimate into (92), we conclude that is asymptotically bounded from below by (with some constant ), uniformly in such that . Thus, the first integral in (90) is bounded by .
Corollary 1.
In addition to the conditions of Theorem 7, suppose that Assumption 3 holds. Then
8. The Limit Shape
Throughout this section, we work under Assumptions 1–3. Let us first establish that a given curve is indeed the limit shape of polygonal lines with respect to the measure (under the scaling ).
Theorem 8.
For any ,
Proof.
In view of Theorem 3, we only need to check that, for each ,
Note that the random process
has independent increments and zero mean; hence, it is a martingale with respect to the filtration . From the definition of (see (33)), it is also clear that is càdlàg (i.e., its paths are everywhere right-continuous and have left limits). Therefore, the Kolmogorov–Doob submartingale inequality (see, e.g., [26], Ch. II, Theorem 1.7, p. 54) gives
Let us now prove a limit shape result under the measure (cf. Theorem 1).
Theorem 9.
For any
Proof.
Similarly to the proof of Theorem 8, it suffices to show that, for each ,
where the random process is defined in (95). Recalling formula (30), we obtain
To estimate the probability in the numerator in (98), similarly to the proof of Theorem 8 we use the Kolmogorov– Doob submartingale inequality, but now with the sixth-order central moment. Combining this with Lemma 13 (with ), we obtain
On the other hand, by Corollary 1 the denominator in (98) decays no faster than at the order of . Together with the estimate (99), this implies that the right-hand side of (98) admits an asymptotic bound . Hence, Theorem 9 is proved. □
Author Contributions
The authors contributed equally to the paper. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
No new data were created or analyzed in this study.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Vershik, A.M. The limit shape of convex lattice polygons and related topics. Funct. Anal. Appl. 1994, 28, 13–20. [Google Scholar] [CrossRef]
- Bárány, I. The limit shape of convex lattice polygons. Discret. Comput. Geom. 1995, 13, 279–295. [Google Scholar] [CrossRef]
- Sinai, Y.G. Probabilistic approach to the analysis of statistics for convex polygonal lines. Funct. Anal. Appl. 1994, 28, 108–113. [Google Scholar] [CrossRef]
- Bogachev, L.V.; Zarbaliev, S.M. A proof of the Vershik–Prokhorov conjecture on the universality of the limit shape for a class of random polygonal lines. Dokl. Math. 2009, 79, 197–202. [Google Scholar] [CrossRef]
- Bogachev, L.V.; Zarbaliev, S.M. Universality of the limit shape of convex lattice polygonal lines. Ann. Probab. 2011, 39, 2271–2317. [Google Scholar] [CrossRef]
- Arratia, R.; Barbour, A.D.; Tavaré, S. Logarithmic Combinatorial Structures: A Probabilistic Approach; EMS Monographs in Mathematics; European Mathematical Society: Zürich, Switzerland, 2003. [Google Scholar] [CrossRef]
- Bogachev, L.V. Limit shape of random convex polygonal lines on : Even more universality. J. Comb. Theory Ser. A 2014, 127, 353–399. [Google Scholar] [CrossRef]
- Bureaux, J.; Enriquez, N. Asymptotics of convex lattice polygonal lines with a constrained number of vertices. Isr. J. Math. 2017, 222, 515–549. [Google Scholar] [CrossRef]
- Bárány, I. Affine perimeter and limit shape. J. Reine Angew. Math. 1997, 484, 71–84. [Google Scholar] [CrossRef]
- Žunić, J. Notes on optimal convex lattice polygons. Bull. Lond. Math. Soc. 1998, 30, 377–385. [Google Scholar] [CrossRef]
- Stojaković, M. Limit shape of optimal convex lattice polygons in the sense of different metrics. Discret. Math. 2003, 271, 235–249. [Google Scholar] [CrossRef]
- Prodromou, N.M. Limit shape of convex lattice polygons with minimal perimeter. Discret. Math. 2005, 300, 139–151. [Google Scholar] [CrossRef]
- Bogachev, L.V.; Zarbaliev, S.M. Approximation of convex functions by random polygonal lines. Dokl. Math. 1999, 59, 46–49. [Google Scholar]
- Arratia, R.; Tavaré, S. Independent process approximations for random combinatorial structures. Adv. Math. 1994, 104, 90–154. [Google Scholar] [CrossRef]
- Vershik, A.M. Statistical mechanics of combinatorial partitions, and their limit shapes. Funct. Anal. Appl. 1996, 30, 90–105. [Google Scholar] [CrossRef]
- Erlihson, M.M.; Granovsky, B.L. Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case. Ann. Inst. Henri Poincaré Probab. Stat. 2008, 44, 915–945. [Google Scholar] [CrossRef]
- Duchon, P.; Flajolet, P.; Louchard, G.; Schaeffer, G. Boltzmann samplers for the random generation of combinatorial structures. Comb. Probab. Comput. 2004, 13, 577–625. [Google Scholar] [CrossRef]
- Bodini, O.; Duchon, P.; Jacquot, A.; Mutafchiev, L. Asymptotic analysis and random sampling of digitally convex polyominoes. In DGCI 2013: Discrete Geometry for Computer Imagery; Gonzalez-Diaz, R., Jimenez, M.J., Medrano, B., Eds.; Lecture Notes in Computer Science, 7749; Springer: Berlin/Heidelberg, Germany, 2013; pp. 95–106. [Google Scholar] [CrossRef]
- Bingham, N.H.; Goldie, C.M.; Teugels, J.L. Regular Variation; Encyclopedia of Mathematics and its Applications, 27; Cambridge University Press: Cambridge, UK, 1989. [Google Scholar]
- Feller, W. An Introduction to Probability Theory and Its Applications, 3rd ed.; Wiley Series in Probability and Mathematical Statistics; Wiley: New York, NY, USA, 1968; Volume 1. [Google Scholar]
- Hardy, G.H.; Wright, E.M. An Introduction to the Theory of Numbers, 4th ed.; Oxford University Press: Oxford, UK, 1960. [Google Scholar]
- Resnick, S.I. Extreme Values, Regular Variation and Point Processes; Applied Probability: A Series of the Applied Probability Trust 4; Springer: New York, NY, USA, 1987; reprinted in Springer Series in Operations Research and Financial Engineering; Springer: New York, NY, USA, 2008. [Google Scholar] [CrossRef]
- Widder, D.V. The Laplace Transform; Princeton Mathematical Series, 6; Princeton University Press: Princeton, NJ, USA, 1941; Available online: https://www.jstor.org/stable/j.ctt183ptft (accessed on 31 October 2022).
- Cramér, H. Mathematical Methods of Statistics; Princeton Mathematical Series, 9; Princeton University Press: Princeton, NJ, USA, 1946; Available online: https://www.jstor.org/stable/j.ctt1bpm9r4 (accessed on 31 October 2022).
- Titchmarsh, E.C. The Theory of Functions, 2nd ed., corrected printing; Oxford University Press: Oxford, UK, 1952. [Google Scholar]
- Revuz, D.; Yor, M. Continuous Martingales and Brownian Motion, 3rd ed.; Grundlehren der Mathematischen Wissenschaften, 293; Springer: Berlin/Heidelberg, Germany, 1999. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).