اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدParking on a Random Tree
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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.
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and the jump ra
te function. For recurrent models we obtain almost sure estimates on effective resistances in finite boxes. For transient models we construct explicit fluxes with finite energy on the associated electrical network.
We construct, for the first time to our knowledge, a one-dimensional stochastic field ${u(x)}_{xin mathbb{R}}$ which satisfies the following axioms which are at the core of the phenomenology of turbulence mainly due to Kolmogorov: (i) Homogeneity a
nd isotropy: $u(x) overset{mathrm{law}}= -u(x) overset{mathrm{law}}=u(0)$ (ii) Negative skewness (i.e. the $4/5^{mbox{tiny th}}$-law): $mathbb{E}{(u(x+ell)-u(x))^3} sim_{ell to 0+} - C , ell,,$ , for some constant $C>0$ (iii) Intermittency: $mathbb{E}{|u(x+ell)-u(x) |^q} asymp_{ell to 0} |ell|^{xi_q},,$ for some non-linear spectrum $qmapsto xi_q$ Since then, it has been a challenging problem to combine axiom (ii) with axiom (iii) (especially for Hurst indexes of interest in turbulence, namely $H<1/2$). In order to achieve simultaneously both axioms, we disturb with two ingredients a underlying fractional Gaussian field of parameter $Happrox frac 1 3 $. The first ingredient is an independent Gaussian multiplicative chaos (GMC) of parameter $gamma$ that mimics the intermittent, i.e. multifractal, nature of the fluctuations. The second one is a field that correlates in an intricate way the fractional component and the GMC without additional parameters, a necessary inter-dependence in order to reproduce the asymmetrical, i.e. skewed, nature of the probability laws at small scales.
Some stochastic systems are particularly interesting as they exhibit critical behavior without fine-tuning of a parameter, a phenomenon called self-organized criticality. In the context of driven-dissipative steady states, one of the main models is t
hat of Activated Random Walks. Long-range effects intrinsic to the conservative dynamics and lack of a simple algebraic structure cause standard tools and techniques to break down. This makes the mathematical study of this model remarkably challenging. Yet, some exciting progress has been made in the last ten years, with the development of a framework of tools and methods which is finally becoming more structured. In these lecture notes we present the existing results and reproduce the techniques developed so far.
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of boxes that are
intersected by a Voronoi polyomino, and vice-versa. These results will be crucial to analyze self-avoiding paths, greedy polyominoes and first-passage percolation models on Voronoi tilings and on the dual graph, named the Delaunay triangulation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
