Searcharxiv⌕ Search

arXiv subjects

Almut Burchard

Publications and source records attributed to Almut Burchard.

33 records · Page 2Linked to original sources
arXiv2012

Random polarizations

We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose distributions need not be uniform. The proof of convergence hinges on an estimate for the expected distance from the limit that also yields a bound on the rate of convergence. In the special case of i.i.d. sequences, we obtain almost sure convergence even for polarizations chosen at random from suitable small sets. As corollaries, we find bounds on the rate of convergence of Steiner symmetrizations that require no convexity assumptions, and show that full rotational symmetry can be achieved by randomly alternating Steiner symmetrization in a finite number of directions that satisfy an explicit non-degeneracy condition. We also present some negative results on the rate of convergence and give examples where convergence fails.

math.FA↗
arXiv2012

A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels

A fundamental problem in the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate on a wireless link, the performance analysis of wireless networks has resorted to higher-layer abstractions, e.g., using Markov chain models. In this work, we propose a network calculus that can incorporate common statistical models of fading channels and obtain statistical bounds on delay and backlog across multiple nodes. We conduct the analysis in a transfer domain, which we refer to as the `SNR domain', where the service process at a link is characterized by the instantaneous signal-to-noise ratio at the receiver. We discover that, in the transfer domain, the network model is governed by a dioid algebra, which we refer to as (min,x)-algebra. Using this algebra we derive the desired delay and backlog bounds. An application of the analysis is demonstrated for a simple multi-hop network with Rayleigh fading channels and for a network with cross traffic.

cs.NI↗
arXiv2012

Convergence in shape of Steiner symmetrizations

There are sequences of directions such that, given any compact set K in R^n, the sequence of iterated Steiner symmetrals of K in these directions converges to a ball. However examples show that Steiner symmetrization along a sequence of directions whose differences are square summable does not generally converge. (Note that this may happen even with sequences of directions which are dense in S^{n-1}.) Here we show that such sequences converge in shape. The limit need not be an ellipsoid or even a convex set. We also deal with uniformly distributed sequences of directions, and with a recent result of Klain on Steiner symmetrization along sequences chosen from a finite set of directions.

math.MG↗
arXiv2011

Convergence to equilibrium for a thin film equation on a cylindrical surface

The degenerate parabolic equation u_t + [u^3(u_xxx + u_x - sin x)]_x=0 models the evolution of a thin liquid film on a stationary horizontal cylinder. It is shown here that for each given mass there is a unique steady state, given by a droplet hanging from the bottom of the cylinder that meets the dry region at the top with zero contact angle. The droplet minimizes the energy and attracts all strong solutions that satisfy certain energy and entropy inequalities. The distance of any solution from the steady state decays no faster than a power law.

math.AP↗
arXiv2011

Rate of convergence of random polarizations

After n random polarizations of Borel set on a sphere, its expected symmetric difference from a polar cap is bounded by C/n, where the constant depends on the dimension [arXiv:1104.4103]. We show here that this power law is best possible, and that the constant grows at least linearly with the dimension.

math.PR↗
arXiv2011

Statistical Analysis of Link Scheduling on Long Paths

We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closed-form expressions for end-to-end delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on end-to-end backlog and output burstiness for some schedulers, and are highly accurate for end-to-end delay bounds.

cs.NI↗
arXiv2010

On the energy-minimizing steady states of a thin film equation

Steady states of the thin film equation $u_t+[u^3 (u_xxx + α^2 u_x -\sin(x) )]_x=0$ are considered on the periodic domain $Ω= (-π,π)$. The equation defines a generalized gradient flow for an energy functional that controls the $H^1$-norm. The main result establishes that there exists for each given mass a unique nonnegative function of minimal energy. This minimizer is symmetric decreasing about $x=0$. For $α<1$ there is a critical value for the mass at which the minimizer has a touchdown zero. If the mass exceeds this value, the minimizer is strictly positive. Otherwise, it is supported on a proper subinterval of the domain and meets the dry region at zero contact angle. A second result explores the relation between strict positivity and exponential convergence for steady states. It is shown that positive minimizers are locally exponentially attractive, while the distance from a steady state with a dry region cannot decay faster than a power law.

math.AP↗
arXiv2009

Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic

We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is described by service curves. A key contribution of this paper is the derivation of a probabilistic sample path bound for heavy-tailed self-similar arrival processes, which is enabled by a suitable envelope characterization, referred to as `htss envelope'. We derive a heavy-tailed service curve for an entire network path when the service at each node on the path is characterized by heavy-tailed service curves. We obtain backlog and delay bounds for traffic that is characterized by an htss envelope and receives service given by a heavy-tailed service curve. The derived performance bounds are non-asymptotic in that they do not assume a steady-state, large buffer, or many sources regime. We also explore the scale of growth of delays as a function of the length of the path. The appendix contains an analysis for self-similar traffic with a Gaussian tail distribution.

cs.NI↗
arXiv2009

On computing the instability index of a non-selfadjoint differential operator associated with coating and rimming flows

We study the problem of finding the instability index of certain non-selfadjoint fourth order differential operators that appear as linearizations of coating and rimming flows, where a thin layer of fluid coats a horizontal rotating cylinder. The main result reduces the computation of the instability index to a finite-dimensional space of trigonometric polynomials. The proof uses Lyapunov's method to associate the differential operator with a quadratic form, whose maximal positive subspace has dimension equal to the instability index. The quadratic form is given by a solution of Lyapunov's equation, which here takes the form of a fourth order linear PDE in two variables. Elliptic estimates for the solution of this PDE play a key role. We include some numerical examples.

math.AP↗
arXiv2006

Rearrangement inequalities for functionals with monotone integrands

The rearrangement inequalities of Hardy-Littlewood and Riesz say that certain integrals involving products of two or three functions increase under symmetric decreasing rearrangement. It is known that these inequalities extend to integrands of the form F(u_1,..., u_m) where F is supermodular; in particular, they hold when F has nonnegative mixed second derivatives. This paper concerns the regularity assumptions on F and the equality cases. It is shown here that extended Hardy-Littlewood and Riesz inequalities are valid for supermodular integrands that are just Borel measurable. Under some nondegeneracy conditions, all equality cases are equivalent to radially decreasing functions under transformations that leave the functionals invariant (i.e., measure-preserving maps for the Hardy-Littlewood inequality, translations for the Riesz inequality). The proofs rely on monotone changes of variables in the spirit of Sklar's theorem.

math.FA↗
arXiv2005

On an isoperimetric inequality for a Schrodinger operator depending on the curvature of a loop

Let C be a smooth closed curve of length 2 Pi in R^3, and let k(s) be its curvature, regarded as a function of arc length. We associate with this curve the one-dimensional Schrodinger operator H_C = -d^2/ds^2 + k^2 acting on the space of square integrable 2 Pi - periodic functions. A natural conjecture is that the lowest spectral value e(C) is bounded below by 1 for any C (this value is assumed when C is a circle). We study a family of curves {C} that includes the circle and for which e(C)=1 as well. We show that the curves in this family are local minimizers, i.e., e(C) can only increase under small perturbations leading away from the family. To our knowledge, the full conjecture remains open.

math.AP↗
arXiv2002

On the Cauchy problem for a dynamical Euler's elastica

The dynamics for a thin, closed loop inextensible Euler's elastica moving in three dimensions are considered. The equations of motion for the elastica include a wave equation involving fourth order spatial derivatives and a second order elliptic equation for its tension. A Hasimoto transformation is used to rewrite the equations in convenient coordinates for the space and time derivatives of the tangent vector. A feature of this elastica is that it exhibits time-dependent monodromy. A frame parallel-transported along the elastica is in general only quasi-periodic, resulting in time-dependent boundary conditions for the coordinates. This complication is addressed by a gauge transformation, after which a contraction mapping argument can be applied. Local existence and uniqueness of elastica solutions are established for initial data in suitable Sobolev spaces.

math.AP↗
arXiv1999

Scaling Limits for Minimal and Random Spanning Trees in Two Dimensions

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in $\R^d$. Tightness of the distribution, as $δ\to 0$, is established for the following two-dimensional examples: the uniformly random spanning tree on $δ\Z^2$, the minimal spanning tree on $δ\Z^2$ (with random edge lengths), and the Euclidean minimal spanning tree on a Poisson process of points in $\R^2$ with density $δ^{-2}$. In each case, sample trees are proven to have the following properties, with probability one with respect to any of the limiting measures: i) there is a single route to infinity (as was known for $δ> 0$), ii) the tree branches are given by curves which are regular in the sense of Hölder continuity, iii) the branches are also rough, in the sense that their Hausdorff dimension exceeds one, iv) there is a random dense subset of $\R^2$, of dimension strictly between one and two, on the complement of which (and only there) the spanning subtrees are unique with continuous dependence on the endpoints, v) branching occurs at countably many points in $\R^2$, and vi) the branching numbers are uniformly bounded. The results include tightness for the loop erased random walk (LERW) in two dimensions. The proofs proceed through the derivation of scale-invariant power bounds on the probabilities of repeated crossings of annuli.

math.PR↗
arXiv1998

Hölder Regularity and Dimension Bounds for Random Curves

Random systems of curves exhibiting fluctuating features on arbitrarily small scales ($δ$) are often encountered in critical models. For such systems it is shown that scale-invariant bounds on the probabilities of crossing events imply that typically all the realized curves admit Hölder continuous parametrizations with a common exponent and a common random prefactor, which in the scaling limit ($δ\to 0$) remains stochastically bounded. The regularity is used for the construction of scaling limits, formulated in terms of probability measures on the space of closed sets of curves. Under the hypotheses presented here the limiting measures are supported on sets of curves which are Hölder continuous but not rectifiable, and have Hausdorff dimensions strictly greater than one. The hypotheses are known to be satisfied in certain two dimensional percolation models. Other potential applications are also mentioned.

math.FA↗