Search arXivSearch

arXiv · 1309.2194

Small particle limits in a regularized Laplacian random growth model

Abstract

We study a regularized version of Hastings-Levitov planar random growth that models clusters formed by the aggregation of diffusing particles. In this model, the growing clusters are defined in terms of iterated slit maps whose capacities are given by c_n=c|Φ_{n-1}'(e^{σ+iθ_n})|^{-α}, α\geq 0, where c>0 is the capacity of the first particle, {Φ_n}_n are the composed conformal maps defining the clusters of the evolution, {θ_n}_n are independent uniform angles determining the positions at which particles are attached, and σ>0 is a regularization parameter which we take to depend on c. We prove that under an appropriate rescaling of time, in the limit as c converges to 0, the clusters converge to growing disks with deterministic capacities, provided that σdoes not converge to 0 too fast. We then establish scaling limits for the harmonic measure flow, showing that by letting αtend to 0 at different rates it converges to either the Brownian web on the circle, a stopped version of the Brownian web on the circle, or the identity map. As the harmonic measure flow is closely related to the internal branching structure within the cluster, the above three cases intuitively correspond to the number of infinite branches in the model being either 1, a random number whose distribution we obtain, or unbounded, in the limit as c converges to 0. We also present several findings based on simulations of the model with parameter choices not covered by our rigorous analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fredrik Johansson Viklund, Alan Sola, Amanda Turner. 2013-10-23. Small particle limits in a regularized Laplacian random growth model. https://doi.org/10.1007/s00220-014-2158-y

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

KEEP EXPLORING

Related papers

Bounded weak solutions to cross-diffusion semiconductor model with electron-hole scattering

Semiconductor model is a system of parabolic partial differential equations with cross-diffusion phenomenon. Previous results showed that a weak solution exists and is not bounded in general. So semiconductor model was categorized as a cross-diffusion system without bounded weak solutions. In this work, we show that once the initial value is bounded, there exists a weak solution that is also bounded. The entropy method is a major tool in global existence analysis of cross-diffusion systems. We notice that traditional entropies in volume-filling cases may not provide required positive semi-definiteness result for the existence proof. In this situation, a transformation of variables technique has been applied. The product between Hessian matrix of the entropy and replacement diffusion matrix is positive semi-definite, then we apply the entropy method to show semiconductor model has a bounded weak solution.

math.PR

Global existence and uniqueness analysis of cross-diffusion multispecies chemotaxis system with volume-filling

The system of multispecies chemotaxis equations is a cross-diffusion system with volume-filling. In this work, we show that a weak solution of the two species chemotaxis system exists. The entropy method is a major tool in existence analysis of cross-diffusion systems. Previous investigations indicate that traditional entropies in volume-filling cases may not be able to provide required gradient estimates. In this situation, we upgrade existing matrix computation methods to derive gradient estimates. Due to the cross-diffusion phenomenon, the uniqueness of the weak solution to a cross-diffusion system is very difficult to prove in general. In this work, we apply the distance functional to show that when parameters of the chemotaxis system are identical, the weak solution is unique.

math.PR

Self-normalized scaled quadratic variation

The concept of a scaled quadratic variation was originally introduced by E. Gladyshev in 1961 for processes with Gaussian increments. Using certain deterministic scaling, arrived at from the covariance of the process, Gladyshev showed that the sum of scaled square increments along the dyadic partition sequence converges almost surely to a finite limit. In this paper, we propose a pathwise counterpart in which the deterministic normalization is replaced by a self-normalizing factor built from the $p$-th variation of the path along a given sequence of partitions. The resulting quantity requires no probabilistic assumption and no knowledge of a covariance structure, and its scale is both path-dependent and sensitive to the partition sequence. Under a mild regularity condition on the limiting $p$-th variation, we show that the self-normalized and the classical deterministic normalizations are comparable, and for fractional Brownian motion the two agree up to a multiplicative constant. We establish a switching behaviour in the index, and prove that for $p \ge 2$ the self-normalized scaled quadratic variation obeys a smooth-transformation formula under $C^2$ maps; at $p=2$ this recovers the known transformation rule for quadratic variation. Since only squared increments are scaled, the construction polarizes, yielding a matrix-valued scaled quadratic variation for every $p \geq 1$ for $\mathbb R^d$ valued paths. We conclude with examples beyond the Gaussian setting.

math.PR