Entropic repulsion in $|\nabla \phi|^p$ surfaces: a large deviation bound for all $p\geq 1$
Pietro Caputo (Roma Tre), Fabio Martinelli (Roma Tre), Fabio Lucio, Toninelli (CNRS, Lyon 1)

TL;DR
This paper derives a large deviation bound for the probability that a generalized SOS surface remains nonnegative, extending previous results for the standard SOS model to all $p \\geq 1$ in the gradient potential.
Contribution
It provides a unified large deviation estimate for the entropic repulsion in $| abla \\phi|^p$ surfaces for all $p \\geq 1$, generalizing prior work on the standard SOS model.
Findings
Probability of nonnegative surface decays exponentially with surface size
Explicit dependence on temperature and surface tension in the decay rate
Extension of entropic repulsion results to all $p \\geq 1$
Abstract
We consider the -dimensional generalized solid-on-solid (SOS) model, that is the random discrete surface with a gradient potential of the form , where . We show that at low temperature, for a square region with side , both under the infinite volume measure and under the measure with zero boundary conditions around , the probability that the surface is nonnegative in behaves like , where is the inverse temperature, is the surface tension at zero tilt, or step free energy, and is the entropic repulsion height, that is the typical height of the field when a positivity constraint is imposed. This generalizes recent results obtained in \cite{CMT} for the standard SOS model ().
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Point processes and geometric inequalities
Entropic repulsion in surfaces:
a large deviation bound for all
Pietro Caputo, Fabio Martinelli and Fabio Lucio Toninelli
Dipartimento di Matematica e Fisica, Università Roma Tre, Largo S. Murialdo 1, 00146 Roma, Italy
[email protected], [email protected]
Université de Lyon, CNRS and Institut Camille Jordan, Université Lyon 1, 43 bd du 11 novembre 1918, 69622 Villeurbanne, France
Abstract.
We consider the -dimensional generalized solid-on-solid (SOS) model, that is the random discrete surface with a gradient potential of the form , where . We show that at low temperature, for a square region with side , both under the infinite volume measure and under the measure with zero boundary conditions around , the probability that the surface is nonnegative in behaves like , where is the inverse temperature, is the surface tension at zero tilt, or step free energy, and is the entropic repulsion height, that is the typical height of the field when a positivity constraint is imposed. This generalizes recent results obtained in [8] for the standard SOS model ().
Key words and phrases:
SOS model, Surface tension, Random surface models, Entropic repulsion, Large deviations.
2010 Mathematics Subject Classification:
60K35, 60F10, 82B41, 82C24
1. Introduction
Consider the -dimensional generalized SOS model in a finite region with zero boundary conditions. This is the Gibbs probability measure , on the set of discrete height functions such that for all , defined by
[TABLE]
, where is the inverse-temperature, is a fixed parameter, and is the normalizing partition function. We shall often consider the case where is the lattice square with side centered at the origin.
Three values of correspond to well known models in statistical mechanics and probability theory: the case is referred to as the standard SOS model (cf. [4, 5, 7] and references therein), is the Discrete Gaussian model (cf. [4, 13] and references therein), while corresponds to the Restricted SOS model, where only the values are allowed for the gradients along an edge (cf. [4] and also [14]).
A common feature of all models defined by (1.1) is that, for sufficiently large, the measures have a well defined limit as , namely the infinite volume Gibbs state with zero boundary conditions, describing a strongly localized interface with exponentially decaying correlations; see e.g. [3]. Moreover, one can show that these models exhibit the so-called entropic repulsion phenomenon. Namely, if one imposes the floor constraint
[TABLE]
then, for sufficiently large, with large probability the field is pushed away from the floor and reaches a height , which diverges as . The phenomenon was first detected in [4], but precise results about the entropic repulsion height were obtained only recently in [6, 5, 7] for the SOS model (), and in [13] for the generalized SOS models (). In particular, if one defines by
[TABLE]
then it is known that at low temperature for any there exists a constant such that, given the event (1.2), the fraction of sites with height in is at least with probability converging to as ; see [6, 5, 7, 13] for even sharper statements of this sort. Table 1 below summarizes the large asymptotic behavior of as varies; see also [13].
In this paper we focus on the large deviation asymptotic for the positivity event (1.2), as . This question has been extensively studied for continuous height models such as the lattice massless free fields, see [12, 2, 1, 9, 10], and is a key problem in the study of the entropic repulsion phenomenon; see e.g. [15] for a survey. Our main result here reads as follows.
Theorem 1**.**
There exists such that for any and any one has
[TABLE]
where the constant is the surface tension at zero tilt (see Section 2 below). Moreover, the same limit holds if we replace by the infinite volume Gibbs measure .
In the case of the standard SOS model, that is , Theorem 1 was proved in [8, Theorem 1.2]. As in that case, one can give the following heuristic explanation of the result: namely, the most convenient way to realize the event , for all is to lift the surface inside up to the typical entropic repulsion profile, which entails the presence of nested level lines each of length equal to , as , where denotes the boundary of the box ; according to the large deviations theory each of these level lines has a cost roughly given by ; since , if these lines can be approximated by independent loops then one obtains (1.4). To make this heuristic rigorous, the proof of [8, Theorem 1.2] used in a crucial way two facts: a) conditioned on the event (1.2) the above described scenario involving nested level lines is indeed very likely, and b) that the interaction between these level lines (beyond the natural order constraint) can be effectively neglected. Part a) was essentially established in [6, 7] for the SOS model. On the other hand part b) used a new recursive monotonicity argument based on FKG-type inequalities satisfied by the SOS models; see [8, Theorem 4.1].
The proof of Theorem 1 will be based on a similar strategy. For part a) we shall rely on results obtained in [13], see Theorem 5.1 below. For part b) we shall need an extension to all of the above mentioned monotonicity statements, see Theorem 4.1 below. From a technical point of view we remark that a key tool in our analysis is the so-called cluster expansion. The standard version presented e.g. in [3] was adapted to the study of the statistics of the SOS level lines (contours) in [6, 7]. Here we provide a nontrivial extension of those arguments to the generalized case ; see Section 2 for the details.
In order to keep the size of this note to a minimum, below we only give a detailed discussion of the points where the general case differs substantially from the case . The remainder of the paper is as follows. Section 2 gathers several basic preliminary facts concerning contours, cluster expansion and surface tension. Section 3 proves the lower bound in Theorem 1. In Section 4 we establish the needed monotonicity results. The upper bound in Theorem 1 is discussed in Section 5.
2. Contours, cluster expansion and surface tension
For any finite , let be the external boundary of , i.e. the set of such that is an edge of , also called bond below, for some . Let denote the set of edges of the form with and . A height configuration is called a boundary condition. We define as the set of height functions such that for all . For a fixed , the generalized SOS Hamiltonian in with boundary condition is the function defined by
[TABLE]
The Gibbs measure in with boundary condition at inverse temperature is the probability measure on given by
[TABLE]
where is the partition function
[TABLE]
When we simply write for and for . Below, we consider of rectangular shape, and write , with , for the rectangle centered at the origin. When we write for the square of side .
It is understood that the model at corresponds to case where the gradient term in (2.1) is replaced by . In the sequel, we will be working explicitly in the setting . The case can be recovered by taking the limit in all steps of the proof.
2.1. Geometric contours, and -contours
We denote by the dual graph of . A dual edge or bond is seen as a segment connecting two neighboring vertices in . Given we write for the restriction of to , that is . We use the following notion of contours.
Definition 2.1**.**
Two sites in are said to be separated by a dual bond if their distance (in ) from is . A pair of orthogonal dual bonds which meet in a site is said to form a linked pair of bonds if both are on the same side of the forty-five degrees line (w.r.t. to the horizontal axis) passing through . A geometric contour (for short, a contour in the sequel) is a sequence of dual bonds such that:
- (1)
* for , except for and .* 2. (2)
for every , and have a common vertex in . 3. (3)
if all have a common vertex , then and are linked pairs of bonds.
We denote by the length of a contour , that is the number of distinct bonds in . If we say that the contour is closed, otherwise it is open. If is closed, then its interior (the sites in it surrounds) is denoted by and its interior area (the number of such sites) by . For a closed , we let be the set of sites in such that either their distance (in ) from is , or their distance from the set of vertices in where two non-linked bonds of meet equals . Finally, we set and . We observe that for any there exists such that either are nearest neighbor or their distance is . Given a closed contour we say that is an -contour for the configuration if
[TABLE]
Finally will denote the event that is an -contour.
Let us illustrate the above definitions with some simple examples. Consider the elementary contour given by the unit square surrounding a site : is an -contour iff and for all . Another explicit example is given in Figure 1 below. We observe that a geometric contour could be at the same time a -contour and a -contour with for some configuration . More generally two geometric contours could be contours for the same surface with different height parameters even if , but then the interior of one of them must be contained in the interior of the other.
2.2. Cluster expansion in presence of sign constraints
Let be an open contour such that the first and last bonds of are horizontal and cut the two opposite vertical sides of a rectangle , while all the other bonds are contained in . For such a we define the sets as follows, see also Figure 2: connect the two endpoints of by adding dual bonds that stay outside the rectangle , so that one has now a closed contour , and set , where is defined in Definition 2.1. For , , we define the function if crosses a dual bond of , and otherwise. Consider the constrained partition function
[TABLE]
where denotes the set of all that satisfy the constraints , that is , and . We call such surfaces legal.
The partition function (2.3) arises naturally in the following important setting. Consider the rectangle , for some . Fix integers , and define the boundary condition on so that
[TABLE]
for all . Let denote the partition function of the model in with boundary condition , and note that for every contributing to there must exist an open contour crossing from left to right as above, joining the dual points and , such that is a -contour for . Then, adding and subtracting for each dual edge in and changing variable to in the region above one finds the expression
[TABLE]
where the sum is over all possible open contours as above and is given in (2.3).
In [8, Lemma 2.2] and [6, Appendix A] we have obtained a cluster expansion for (2.3) in the case where (so that for all ) and the two sets are two arbitrary subsets of , where is defined as the set of points of that are either at distance from , or at distance from in the South-West or North-East direction. Here we need the following extension of that.
Proposition 2.2**.**
There exists independent of and , such that if , then (2.3) satisfies
[TABLE]
where the potentials are such that
- (1)
* if is not connected.* 2. (2)
* if , for some shift invariant potential , that is*
[TABLE]
where is independent of . 3. (3)
For all :
[TABLE]
where is the cardinality of the smallest connected set of all dual bonds separating points of from points of its complement (a dual bond is said to separate from iff it is orthogonal to a bond connecting to ).
The core of the proof is to show that the “usual” cluster representation (e.g. [3, Corollary 2.2]) continues to hold for the constrained partition function (2.3). This nontrivial fact follows from Lemma 2.5 below. Once this lemma is established the rest of the proof is obtained as in [8] and [6, Appendix A]. Following [3] we first define what we mean by clusters. We assume that an ordering of all dual bonds has been defined, and that an orientation for each bond of has been fixed. Both choices are arbitrary.
Definition 2.3**.**
- (1)
A cluster consists of a finite connected set of dual bonds , called the support of , and certain height gradients for each bond orthogonal to a dual bond in , appearing in the prescribed dual bond ordering. The set is such that any endpoint of one of its bonds is shared by at least another bond in . The support of divides into an infinite component and a collection of finite connected sets called the faces of . The interior is the union of the finite faces of . The external boundary consists of those points of which have a nearest neighbor in . 2. (2)
A configuration of clusters is a unordered finite collection of clusters . A configuration is compatible if the corresponding supports are mutually disjoint. 3. (3)
A cluster is admissible if there exists a unique surface such that and the gradients of coincide with those specified by along each bond orthogonal to a dual bond in and are zero on every bond that does not intersect . By construction is constant on each face of . 4. (4)
In the setting of Proposition 2.2, a cluster is called legal if it is admissible and the associated surface satisfies the constraints on , that is .
In [3] it was proved that the set of surfaces with zero boundary conditions, but without the constraints on , is in one-to-one correspondence with the set of all compatible configurations of admissible clusters. In Lemma 2.5 below we extend the result to the constrained case. We start with a technical lemma.
Lemma 2.4**.**
In the setting of Proposition 2.2, given a legal cluster with support let be one of the faces of . If and then necessarily . The same applies by inverting the role of and . If instead and , then .
Proof of Lemma 2.4.
Fix a legal cluster together with one of its faces . By construction, the surface height is constant on . Suppose first that there exist such that and . Then since it is non-negative at and non-positive at . Assume now that and let . By construction, (cf. Definition 2.1) there exists a point which is either a nearest neighbor of or is at distance from in the South-West direction. By assumption and therefore . The same argument applies with interchanged. ∎
Lemma 2.5**.**
The set of legal surfaces in (2.3) is in one-to-one correspondence with the set of all compatible configurations of legal clusters . In particular, (2.3) can be written as
[TABLE]
where denotes the support of , is the height gradient in associated to , the lattice bond orthogonal to bond , and the first sum runs over all compatible configurations of legal clusters .
Proof of Lemma 2.5.
We begin with the proof that any compatible configuration of legal clusters defines a legal surface. We proceed by induction. If , it is true by definition. Suppose the statement true up to and fix a compatible configuration of legal clusters . Without loss of generality, possibly by a suitable relabeling of the clusters, we can assume that either or and . Call the surface defined by and that obtained after the insertion of and whose existence is guaranteed by the results in [3]. In the first case there is nothing to prove, since by the inductive assumption is legal and the addition of outside of creates a legal . In the second case let be the face of containing .
- •
If then the addition of to does not change the values of on and is also legal.
- •
If and then, by Lemma 2.4, and therefore . Hence we conclude as in case (i). The same applies by inverting the role of and .
- •
If and then, by Lemma 2.4, must be equal to zero in and therefore we can safely add to .
We now prove the converse. Using [3] we know that any legal surface corresponds to a unique compatible configuration of admissible clusters . It remains to check that each is legal.
By induction we can assume the statement true for any legal surface corresponding to admissible and compatible clusters. As before we can assume that either (a) or (b) and . Let be the surface defined by the first clusters. We have to distinguish between two cases.
- (1)
is legal. In this case by induction each , , is legal. In case (a) necessarily must be legal. In case (b) let be the face of containing . If then is legal since it is admissible. If and then and therefore . Hence we conclude as before. The same applies by inverting the role of and . If and then, using Lemma 2.4, must be equal to zero in . Therefore, since the addition of to the flat surface at height zero produces a legal surface, must be legal. 2. (2)
is not legal, but adding an admissible produces a legal surface. We shall prove that this scenario cannot happen. In case (a) adding an admissible cannot produce a legal surface. In case (b) let be the face of containing . We can safely assume that violates the constraints () inside , since otherwise will not be able to restore them. If and or viceversa then, as before, by adding we cannot change the value of the surface on and we get a non legal surface. Suppose now that contains points of and of and assume that e.g. inside . By the nature of the open contour producing , even if we add the cluster we cannot lower the value of everywhere inside because is compatible with . Thus the surface obtained by adding cannot be legal.
This establishes the claimed one-to-one correspondence. The expression (2.6) then follows by definition of compatible legal clusters. This ends the proof of Lemma 2.5. ∎
2.3. Surface tension
The expansion of Proposition 2.2 is a version of the well known cluster expansion for 2D Ising contours; see e.g. [11]. In particular, it allows one to deduce a number of facts about the model, including the existence and basic properties of the surface tension, a.k.a. step free energy in this setting. Consider the partition function defined in (2.4), and recall that denotes the partition function with zero boundary conditions and no sign constrains. One can show that the limit
[TABLE]
exists for every , and fixed , and satisfies
[TABLE]
where the sum ranges over all open contours in the strip joining the dual lattice points and , and is the usual “decoration” term; see e.g. [11]. Moreover, one can prove the following facts; we refer to [8] and references therein for more details.
Lemma 2.6**.**
There exists such that the following holds for all , . Assume that as one has and set . Then, the limit
[TABLE]
*is well defined and positive in . *
Equation (2.9) defines the surface tension at angle . When we simply write . We refer to [8, Lemma 2.4] for further important properties of this function that continue to hold in our setting.
3. Lower bound
As in [8, Lemma 3.1] it is not difficult to show that for the infinite volume measure satisfies
[TABLE]
for some constant . In particular, since as , it follows that if we prove the lower bound for in Theorem 1, we also have the same lower bound for by using
[TABLE]
To prove the lower bound for we proceed by restricting the set of configurations to a suitable event. As in [8], to define this event we need to introduce the following geometric construction and the associated set of nested contours.
Fix , and define the nested annular regions , , where and . The set consists of 3 nested disjoint annuli each of width . We call the middle one, i.e. . Notice that , where is the euclidean distance.
For each , let denote the set of all closed contours such that and surrounds . For fixed , let denote the event that the surface has an -contour at . Define the event that for all there exists an -contour , that is
[TABLE]
Fix a choice of contours , , and consider the probability measure defined as follows. Define the modified hamiltonian
[TABLE]
where if crosses a dual bond , and otherwise. Then define
[TABLE]
where denotes the set of all such that and , where . The probability on is defined by
[TABLE]
Define also , with the convention that and . With this notation, the change of variable , for each , yields
[TABLE]
where is shorthand notation for: for all .
We start by estimating the probability appearing in the right hand side of (3).
Lemma 3.1**.**
There exists a constant such that for any choice of contours , , one has
[TABLE]
Proof.
One verifies that the FKG lattice condition is satisfied by the measure , that is for all . Indeed, it suffices to show that
[TABLE]
for all , and for all . To prove (3.9), define the function , and note that since , is convex. Let us consider e.g. the case , , and . All other cases can be handled in a similar way. The left hand side of (3.9) becomes . Setting , by convexity , and . Therefore, summing up one obtains , as in (3.9).
Then, the FKG inequality implies
[TABLE]
The argument from [6, Proposition 3.9] can be adapted to the case to obtain
[TABLE]
for some constant and for all . Using for , one has
[TABLE]
for some new constant . Estimating one finds . On the other hand, the term satisfies
[TABLE]
where we use the definition (1.3) of . This proves (3.8). ∎
Next, we proceed as in [8, Lemma 3.2], that is we define , fix arbitrary contours , and then sum over the remaining contours , .
Lemma 3.2**.**
Fix and fix , where . Then
[TABLE]
Proof.
Since the measure satisfies the FKG property (cf. Lemma 3.1 above) one can use monotonicity with respect to boundary conditions in the regions and the proof follows as in [8, Lemma 3.2], with the only difference that when the reference to [7, Proposition 2.7] must be replaced with [13, Proposition 4.1]. ∎
From Lemma 3.2, we see that the lower bound in Theorem 1 follows if, as :
[TABLE]
uniformly in the fixed choice of , , with .
Thanks to Lemma 3.1 we can neglect the term when proving (3). The proof of the lower bound is then concluded by showing that uniformly in the choice of , , with , one has
[TABLE]
The estimate (3) can be obtained with the same argument as in [8, Lemma 3.3, Lemma 3.4]. The only technical issue is that the cluster expansion used there - see [8, Eq. (3.8)] has to be adapted to the case . However, this adaptation can be obtained by minor modifications of the arguments used in Section 2.2 and Section 2.3 above. We omit the details.
4. A monotonicity property
In this section we extend to the case the monotonicity property of the partition function which played a crucial role in the proof of the large deviation result for the SOS model; cf. [8, Theorem 4.1]. In order to formulate it we need to recall the definition of the staircase ensemble introduced in [8].
4.1. Staircase ensemble
In (2.4) we considered the case of a stepped boundary condition, which produced one open contour. Here we generalize that to the case of a multi-step boundary condition, which is associated with the presence of open contours. Consider the rectangle , for some . Fix and integers
[TABLE]
and set and . We define a “staircase” height at the external boundary of our rectangle which, starting from height zero at the base of the rectangle (i.e. the set ) jumps by one at the locations specified by the two -tuples until it reaches height :
[TABLE]
where , see Figure 3. Note that if two or more values of the or coincide, then the boundary height takes jumps higher than at those points.
Next, let denote the partition function in with the boundary condition defined in (4.2) and let as usual denote the partition function on with zero boundary condition.
Combining the expansions in Section 2.2 and [8, Section 2.5] one proves that the limit
[TABLE]
is well defined, for every fixed choice of parameters and .
The main result here is that, for all , the effective partition function defined in (4.3) has the following monotonicity property w.r.t. the parameters . The case is [8, Theorem 4.1].
Theorem 4.1**.**
There exists such that, for any , any and , and any
[TABLE]
The proof of Theorem 4.1 is based on the following key lemma. Once Lemma 4.2 below is established, the theorem follows by a simple iteration as in the proof of [8, Theorem 4.1].
Lemma 4.2**.**
For any and ,
[TABLE]
Proof of Lemma 4.2.
Set for some large fixed . Let be the boundary conditions associated to and according to (4.2), where , for , while . It suffices to establish that
[TABLE]
We shall prove the equivalent claim:
[TABLE]
Define the points and , so that (resp. ) is the nearest neighbor of (resp. ) in , see Figure 4.
To prove (4.5), let and write
[TABLE]
where
[TABLE]
which is well defined for almost all , and denotes expectation with respect to . Observe that is increasing in . Indeed, for almost all
[TABLE]
for all . Then, by the FKG inequality we can raise the boundary condition to at all boundary vertices which had a boundary condition less than . This yields a new boundary condition such that
[TABLE]
Thus, from (4.6), it suffices to show that
[TABLE]
where denotes the expectation in the infinite strip , obtained by taking the limit as of . Note that this limiting Gibbs measure is well defined by the usual arguments; see e.g. [8, Section 2.5].
We are going to show that for all
[TABLE]
Clearly, (4.10) implies (4.9).
First, by vertical translation invariance, one can pretend that , so that is [math] or , except at and where it equals , and that replaces in (4.7) above. In particular, . Then, by symmetry one has
[TABLE]
Finally, by shifting vertically all heights by and by a 180 degrees rotation of the geometry , one sees that
[TABLE]
This proves (4.10). ∎
5. Upper bound
From (3.1)-(3.2), we see that once we prove the upper bound for , then the same upper bound follows for the finite volume probabilities .
We start by summarizing a key result from [13]. The following facts follow from [13, Theorem 2, Theorem 4 and Section 4.4]. The corresponding statements for are in [7, Theorem 2]. Below, denotes the measure conditioned on the event ; see (1.2).
Proposition 5.1**.**
For any and , define , as the event that there exists a lattice circuit surrounding such that , for all , where is defined as in (1.3). There exists such that, for any , one has: For any , there exists such that
[TABLE]
From Proposition 5.1 and the simple monotonicity argument in [8, Proposition 5.1] we obtain that: for any , there exists such that
[TABLE]
From the straightforward fact that for any event one has
[TABLE]
it follows that the desired upper bound for is a consequence of the statement: for any , for any ,
[TABLE]
Observe that the event implies that there exist contours , such that
[TABLE]
and such that is a -contour for the surface for each . Then the proof of (5.3) can be obtained by the very same argument used in [8, Proof of Proposition 5.2]. To extend this argument to the setting one only needs to make sure that: 1) the cluster expansion techniques used there apply here as well, and 2) the crucial monotonicity of partition functions in the staircase ensemble holds for all . The first point can be checked with minor modifications of the arguments in Section 2.2. The second point has been established in Theorem 4.1 above.
Acknowledgments
F. T. was partially supported by the CNRS PICS grant “Discrete random interfaces and Glauber dynamics”
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Erwin Bolthausen, Jean-Dominique Deuschel, and Giambattista Giacomin. Entropic repulsion and the maximum of the two-dimensional harmonic crystal. Ann. Probab. , 29(4):1670–1692, 2001.
- 2[2] Erwin Bolthausen, Jean-Dominique Deuschel, and Ofer Zeitouni. Entropic repulsion of the lattice free field. Comm. Math. Phys. , 170(2):417–443, 1995.
- 3[3] R. Brandenberger and C. E. Wayne. Decay of correlations in surface models. J. Statist. Phys. , 27(3):425–440, 1982.
- 4[4] J. Bricmont, A. El Mellouki, and J. Fröhlich. Random surfaces in statistical mechanics: roughening, rounding, wetting, … … \ldots\, . J. Statist. Phys. , 42(5-6):743–798, 1986.
- 5[5] Pietro Caputo, Eyal Lubetzky, Fabio Martinelli, Allan Sly, and Fabio Lucio Toninelli. The shape of the (2+1)D SOS surface above a wall. C. R. Math. Acad. Sci. Paris , 350(13-14):703–706, 2012.
- 6[6] Pietro Caputo, Eyal Lubetzky, Fabio Martinelli, Allan Sly, and Fabio Lucio Toninelli. Dynamics of ( 2 + 1 ) 2 1 (2+1) -dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion. Ann. Probab. , 42(4):1516–1589, 2014.
- 7[7] Pietro Caputo, Eyal Lubetzky, Fabio Martinelli, Allan Sly, and Fabio Lucio Toninelli. Scaling limit and cube-root fluctuations in SOS surfaces above a wall. J. Eur. Math. Soc. (JEMS) , 18(5):931–995, 2016.
- 8[8] Pietro Caputo, Fabio Martinelli, and Fabio Lucio Toninelli. On the probability of staying above a wall for the ( 2 + 1 ) 2 1 (2+1) -dimensional SOS model at low temperature. Probab. Theory Related Fields , 163(3-4):803–831, 2015.
