We estimate convergence rates for curves generated by Loewner's differential equation under the basic assumption that a convergence rate for the driving terms is known. An important tool is what we call the tip structure modulus, a geometric measure of regularity for Loewner curves parameterized by capacity. It is analogous to Warschawski's boundary structure modulus and closely related to annuli crossings. The main application we have in mind is that of a random discrete-model curve approaching a Schramm-Loewner evolution (SLE) curve in the lattice size scaling limit. We carry out the approach in the case of loop-erased random walk (LERW) in a simply connected domain. Under mild assumptions of boundary regularity, we obtain an explicit power-law rate for the convergence of the LERW path toward the radial SLE2 path in the supremum norm, the curves being parameterized by capacity. On the deterministic side, we show that the tip structure modulus gives a sufficient geometric condition for a Loewner curve to be Holder continuous in the capacity parameterization, assuming its driving term is Holder continuous. We also briefly discuss the case when the curves are a priori known to be Holder continuous in the capacity parameterization and we obtain a power-law convergence rate depending only on the regularity of the curves.
In we define the tip structure modulus and prove the estimates implying . Then in Theorem we show that if a Loewner curve @math has the property that there is @math such that @math and the driving term is H "older continuous, then @math is also H "older continuous in the capacity parameterization with exponent depending only on @math and the exponent for the driving term. This is an analog of the fact that John domains are H "older domains @cite_1 for Loewner curves parameterized by capacity.
@cite_1
2276886773 2963780857 2227069303 2809995963
Curves of genus g which admit a map to CP1 with specified ramification profile mu over 0 and nu over infinity define a double ramification cycle DR_g(mu,nu) on the moduli space of curves. The study of the restrictions of these cycles to the moduli of nonsingular curves is a classical topic. In 2003, Hain calculated the cycles for curves of compact type. We study here double ramification cycles on the moduli space of Deligne-Mumford stable curves. The cycle DR_g(mu,nu) for stable curves is defined via the virtual fundamental class of the moduli of stable maps to rubber. Our main result is the proof of an explicit formula for DR_g(mu,nu) in the tautological ring conjectured by Pixton in 2014. The formula expresses the double ramification cycle as a sum over stable graphs (corresponding to strata classes) with summand equal to a product over markings and edges. The result answers a question of Eliashberg from 2001 and specializes to Hain's formula in the compact type case. When mu and nu are both empty, the formula for double ramification cycles expresses the top Chern class lambda_g of the Hodge bundle of the moduli space of stable genus g curves as a push-forward of tautological classes supported on the divisor of nonseparating nodes. Applications to Hodge integral calculations are given. In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane via a multiscale sum of ( )-numbers. These ( )-numbers are geometric quantities measuring how far a given set deviates from a best fitting line at each scale and location. Jones’ result is a quantitative way of saying that a curve is rectifiable if and only if it has a tangent at almost every point. Moreover, computing this square sum for a curve returns the length of the curve up to multiplicative constant. K. Okikiolu extended his result from subsets of the plane to subsets of Euclidean space. G. David and S. Semmes extended the discussion to include sets of (integer) dimension larger than one, under the assumption of Ahlfors regularity and using a variant of Jones’ ( )-numbers. This variant has since been used by others to give structure theorems for rectifiable sets and to give upper bounds for the measure of a set. In this paper we give a version of P. Jones’ theorem for sets of arbitrary (integer) dimension lying in Euclidean space. Our main result is a lower bound for the d-dimensional Hausdorff measure of a set in terms of an analogous sum of ( )-type numbers. We also show an upper bound of this type. The combination of these results gives a Jones theorem for higher dimensional sets. While there is no assumption of Ahlfors regularity, or of a measure on the underlying set, there is an assumption of a lower bound on the Hausdorff content. We adapt David and Semmes’ version of Jones’ ( )-numbers by redefining them using a Choquet integral, allowing them to be defined for arbitrary sets (and not just sets of locally finite measure). A key tool in the proof is G. David and T. Toro’s parametrization of Reifenberg flat sets (with holes). A spanner is a sparse subgraph that approximately preserves the pairwise distances of the original graph. It is well known that there is a smooth tradeoff between the sparsity of a spanner and the quality of its approximation, so long as distance error is measured multiplicatively. A central open question in the field is to prove or disprove whether such a tradeoff exists also in the regime of additive error. That is, is it true that for all e>0, there is a constant ke such that every graph has a spanner on O(n1+e) edges that preserves its pairwise distances up to +ke? Previous lower bounds are consistent with a positive resolution to this question, while previous upper bounds exhibit the beginning of a tradeoff curve: all graphs have +2 spanners on O(n3 2) edges, +4 spanners on O(n7 5) edges, and +6 spanners on O(n4 3) edges. However, progress has mysteriously halted at the n4 3 bound, and despite significant effort from the community, the question has remained open for all 0 Our main result is a surprising negative resolution of the open question, even in a highly generalized setting. We show a new information theoretic incompressibility bound: there is no function that compresses graphs into O(n4 3 − e) bits so that distance information can be recovered within +no(1) error. As a special case of our theorem, we get a tight lower bound on the sparsity of additive spanners: the +6 spanner on O(n4 3) edges cannot be improved in the exponent, even if any subpolynomial amount of additive error is allowed. Our theorem implies new lower bounds for related objects as well; for example, the twenty-year-old +4 emulator on O(n4 3) edges also cannot be improved in the exponent unless the error allowance is polynomial. Central to our construction is a new type of graph product, which we call the Obstacle Product. Intuitively, it takes two graphs G,H and produces a new graph G H whose shortest paths structure looks locally like H but globally like G. An (α,β)-spanner of an n-vertex graph G = (V,E) is a subgraph H of G satisfying that dist(u, v, H) ≤ α·dist(u, v, G) + β for every pair (u, v) ∈ V ×V, where dist(u,v,G′) denotes the distance between u and v in G′ ⊆ G. It is known that for every integer k ≥ 1, every graph G has a polynomially constructible (2k − 1,0)-spanner of size O(n 1 + 1 k ). This size-stretch bound is essentially optimal by the girth conjecture. Yet, it is important to note that any argument based on the girth only applies to adjacent vertices. It is therefore intriguing to ask if one can “bypass” the conjecture by settling for a multiplicative stretch of 2k − 1 only for neighboring vertex pairs, while maintaining a strictly better multiplicative stretch for the rest of the pairs. We answer this question in the affirmative and introduce the notion of k-hybrid spanners, in which non neighboring vertex pairs enjoy a multiplicative k stretch and the neighboring vertex pairs enjoy a multiplicative (2k − 1) stretch (hence, tight by the conjecture). We show that for every unweighted n-vertex graph G, there is a (polynomially constructible) k-hybrid spanner with O(k 2 ·n 1 + 1 k ) edges. This should be compared against the current best (α,β) spanner construction of [5] that obtains (k,k − 1) stretch with O(k ·n 1 + 1 k ) edges. An alternative natural approach to bypass the girth conjecture is to allow ourself to take care only of a subset of pairs S ×V for a given subset of vertices S ⊆ V referred to here as sources. Spanners in which the distances in S ×V are bounded are referred to as sourcewise spanners. Several constructions for this variant are provided (e.g., multiplicative sourcewise spanners, additive sourcewise spanners and more).