Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1508.03013

Rates of convergence to scaling profiles in a submonolayer deposition model and the preservation of memory of the initial condition

Fernando P. da Costa·João T. Pinto·Rafael Sasportes
View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish rates of convergence of solutions to scaling (or similarity) profiles in a coagulation type system modelling submonolayer deposition. We prove that, although all memory of the initial condition is lost in the similarity limit, information about the large cluster tail of the initial condition is preserved in the rate of approach to the similarity profile. The proof relies in a change of variables that allows for the decoupling of the original infinite system of ordinary differential equations into a closed two-dimensional nonlinear system for the monomer--bulk dynamics and a lower triangular infinite dimensional linear one for the cluster dynamics. The detailed knowledge of the long time monomer concentration, which was obtained earlier by Costin et al. in (O. Costin, M. Grinfeld, K.P. O'Neill and H. Park, Long-time behaviour of point islands under fixed rate deposition, Commun. Inf. Syst. 13, (2), (2013), pp.183-200) using asymptotic methods and is rederived here by center manifold arguments, is then used for the asymptotic evaluation of an integral representation formula for the concentration of $j$-clusters. The use of higher order expressions, both for the Stirling expansion and for the monomer evolution at large times allow us to obtain, not only the similarity limit, but also the rate at which it is approached.

Explore related subjects

math.CA

Keep this discovery

BibTeXRIS

Fernando P. da Costa, João T. Pinto, Rafael Sasportes. 2015-08-12. Rates of convergence to scaling profiles in a submonolayer deposition model and the preservation of memory of the initial condition. https://arxiv.org/abs/1508.03013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA↗
arXiv2026

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA↗
arXiv2026

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA↗