اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultilayer parking with screening on a random tree
144
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds the density in the second layer. We also provide a procedure to calculate higher layer densities and prove that random trees have a higher limiting density in the first layer than regular trees. Finally, we compare densities between the first and second layer and between regular and random trees.
قيم البحث
اقرأ أيضاً
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyis parking problem, alternatively called blocking RSA: at every
vertex of the tree a particle (or car) arrives with rate one. The particle sticks to the vertex whenever the vertex and all of its nearest neighbors are not occupied yet. We provide an explicit expression for the so-called parking constant in terms of the generating function.
We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its nearest nei
ghbors are not occupied yet. It can reach the first line if it is not obstructed by cars already parked in the second line (screening). b) The car parks according to the same rules, but parking in the first line can not be obstructed by parked cars in the second line (no screening). In both models, a car that can not park in the first line will attempt to park in the second line. If it is obstructed in the second line as well, the attempt is discarded. We show that both models are solvable in terms of finite-dimensional ODEs. We compare numerically the limits of first and second line densities, with time going to infinity. While it is not surprising that model a) exhibits an increase of the density in the second line from the first line, more remarkably this is also true for model b), albeit in a less pronounced way.
We investigate the distribution of the resonances near spectral thresholds of Laplace operators on regular tree graphs with $k$-fold branching, $k geq 1$, perturbed by nonself-adjoint exponentially decaying potentials. We establish results on the abs
ence of resonances which in particular involve absence of discrete spectrum near some sectors of the essential spectrum of the operators.
In this article a multilayer parking system with screening of size n=3 is studied with a focus on the time-dependent particle density. We prove that the asymptotic limit of the particle density increases from an average density of 1/3 on the first la
yer to the value of (10 - sqrt 5 )/19 in higher layers.
We continue our study of the full set of translation-invariant splitting Gibbs measures (TISGMs, translation-invariant tree-indexed Markov chains) for the $q$-state Potts model on a Cayley tree. In our previous work cite{KRK} we gave a full descripti
on of the TISGMs, and showed in particular that at sufficiently low temperatures their number is $2^{q}-1$. In this paper we find some regions for the temperature parameter ensuring that a given TISGM is (non-)extreme in the set of all Gibbs measures. In particular we show the existence of a temperature interval for which there are at least $2^{q-1} + q$ extremal TISGMs. For the Cayley tree of order two we give explicit formulae and some numerical values.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
