اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImproved Upper Bounds on the Asymptotic Growth Velocity of Eden Clusters
167
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the asymptotic shape of clusters in the Eden model on a d-dimensional hypercubical lattice. We discuss two improvements for the well-known upper bound to the growth velocity in different directions by that of the independent branching process (IBP). In the IBP, each cell gives rise to a daughter cell at a neighboring site at a constant rate. In the first improvement, we do not allow such births along the bond connecting the cell to its mother cell. In the second, we iteratively evolve the system by a growth as IBP for a duration $Delta$ t, followed by culling process in which if any cell produced a descendant within this interval, who occupies the same site as the cell itself, then the descendant is removed. We study the improvement on the upper bound on the velocity for different dimensions d. The bounds are asymptotically exact in the large-d limit. But in $d =2$, the improvement over the IBP approximation is only a few percent.
قيم البحث
اقرأ أيضاً
The surface width scaling of Eden A clusters grown from a single aggregate site on the square lattice is investigated as a function of the noise reduction parameter. A two-exponent scaling ansatz is introduced and used to fit the results from simulat
ions covering the range from fully stochastic to the zero-noise limit.
The Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play the coordina
tion number of the graphs. The factorial moment measure of the number of clusters per bond are given using the derivative of the Tutte polynomial. Examples are presented for simple planar graph. The cases of square, triangular, honeycomb, Archimedean and Laves lattices are discussed.
We present generalized methods for calculating lower bounds on the ground-state entropy per site, $S_0$, or equivalently, the ground-state degeneracy per site, $W=e^{S_0/k_B}$, of the antiferromagnetic Potts model. We use these methods to derive improved lower bounds on $W$ for several lattices.
For each $n$, let $text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large $n$ behavi
or of $text{RD}(n)$. In this paper, we provide improved thresholds for upper bounds on $text{RD}(n)$. Our techniques build upon classical algebraic geometry to provide new upper bounds for small $n$ and, in doing so, fix gaps in the proofs of A. Wiman and G.N. Chebotarev in [Wim1927] and [Che1954].
We analyse the reconstruction error of principal component analysis (PCA) and prove non-asymptotic upper bounds for the corresponding excess risk. These bounds unify and improve existing upper bounds from the literature. In particular, they give orac
le inequalities under mild eigenvalue conditions. The bounds reveal that the excess risk differs significantly from usually considered subspace distances based on canonical angles. Our approach relies on the analysis of empirical spectral projectors combined with concentration inequalities for weighted empirical covariance operators and empirical eigenvalues.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
