اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFunctional macroscopic behavior of weighted random ball model
167
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a generalization of the weighted random ball model. The model is driven by a random Poisson measure with a product heavy tailed intensity measure. Such a model typically represents the transmission of a network of stations with a fading effect. In a previous article, the authors proved the convergence of the finite-dimensional distributions of related generalized random fields under various scalings and in the particular case when the fading function is the indicator function of the unit ball. In this paper, tightness and functional convergence are investigated. Using suitable moment estimates, we prove functional convergences for some parametric classes of configurations under the so-called large ball scaling and intermediate ball scaling. Convergence in the space of distributions is also discussed.
قيم البحث
اقرأ أيضاً
We consider a collection of Euclidean random balls in ${Bbb R}^d$ generated by a determinantal point process inducing interaction into the balls. We study this model at a macros-copic level obtained by a zooming-out and three different regimes --Gaus
sian, Poissonian and stable-- are exhibited as in the Poissonian model without interaction. This shows that the macroscopic behaviour erases the interactions induced by the determinantal point process.
For each $n ge 1$, let $mathrm{d}^n=(d^{n}(i),1 le i le n)$ be a sequence of positive integers with even sum $sum_{i=1}^n d^n(i) ge 2n$. Let $(G_n,T_n,Gamma_n)$ be uniformly distributed over the set of simple graphs $G_n$ with degree sequence $mathrm
{d}^n$, endowed with a spanning tree $T_n$ and rooted along an oriented edge $Gamma_n$ of $G_n$ which is not an edge of $T_n$. Under a finite variance assumption on degrees in $G_n$, we show that, after rescaling, $T_n$ converges in distribution to the Brownian continuum random tree as $n to infty$. Our main tool is a new version of Pitmans additive coalescent (https://doi.org/10.1006/jcta.1998.2919), which can be used to build both random trees with a fixed degree sequence, and random tree-weighted graphs with a fixed degree sequence. As an input to the proof, we also derive a Poisson approximation theorem for the number of loops and multiple edges in the superposition of a fixed graph and a random graph with a given degree sequence sampled according to the configuration model; we find this to be of independent interest.
In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression for the maximal weight of the shortest weight pat
hs between all vertices (the weighted diameter) of sparse random graphs, when the edge weights are i.i.d. exponential random variables.
In [17], the authors have defined an annealed Ising model on random graphs and proved limit theorems for the magnetization of this model on some random graphs including random 2-regular graphs. Then in [11], we generalized their results to the class
of all random regular graphs. In this paper, we study the critical behavior of this model. In particular, we determine the critical exponents and prove a non standard limit theorem that the magnetization scaled by n 3/4 converges to a specific random variable, with n the number of vertices of random regular graphs.
We study the random connection model driven by a stationary Poisson process. In the first part of the paper, we derive a lace expansion with remainder term in the continuum and bound the coefficients using a new version of the BK inequality. For our main results, we consider thr
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
