scholarly journals Random Enriched Trees with Applications to Random Graphs

10.37236/7328 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Benedikt Stufler

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled $k$-trees that are rooted at a $k$-clique of distinguishable vertices. For both models we establish a Gromov–Hausdorff scaling limit, a Benjamini–Schramm limit, and a local weak limit that describes the asymptotic shape near the fixed root.

1978 ◽  
Vol 15 (1) ◽  
pp. 65-77 ◽  
Author(s):  
Anthony G. Pakes

This paper develops the notion of the limiting age of an absorbing Markov chain, conditional on the present state. Chains with a single absorbing state {0} are considered and with such a chain can be associated a return chain, obtained by restarting the original chain at a fixed state after each absorption. The limiting age, A(j), is the weak limit of the time given Xn = j (n → ∞).A criterion for the existence of this limit is given and this is shown to be fulfilled in the case of the return chains constructed from the Galton–Watson process and the left-continuous random walk. Limit theorems for A (J) (J → ∞) are given for these examples.


Author(s):  
C. Giardinà ◽  
C. Giberti ◽  
R. van der Hofstad ◽  
M. L. Prioriello

2020 ◽  
Vol 22 (4) ◽  
pp. 415-421
Author(s):  
Tran Loc Hung ◽  
Phan Tri Kien ◽  
Nguyen Tan Nhut

The negative-binomial sum is an extension of a geometric sum. It has been arisen from the necessity to resolve practical problems in telecommunications, network analysis, stochastic finance and insurance mathematics, etc. Up to the present, the topics related to negative-binomial sums like asymptotic distributions and rates of convergence have been investigated by many mathematicians. However, in a lot of various situations, the results concerned the rates of convergence for negative-binomial sums are still restrictive. The main purpose of this paper is to establish some weak limit theorems for negative-binomial sums of independent, identically distributed (i.i.d.) random variables via Gnedenko's Transfer Theorem originated by Gnedenko and Fahim (1969). Using Zolotarev's probability metric, the rate of convergence in weak limit theorems for negativebinomial sum are established. The received results are the rates of convergence in weak limit theorem for partial sum of i.i.d random variables related to symmetric stable distribution (Theorem 1), and asymptotic distribution together with the convergence rates for negative-binomial sums of i.i.d. random variables concerning to symmetric Linnik laws and Generalized Linnik distribution (Theorem 2 and Theorem 3). Based on the results of this paper, the analogous results for geometric sums of i.i.d. random variables will be concluded as direct consequences. However, the article has just been solved for the case of 1 <a < 2; it is quite hard to estimate in the case of a 2 (0;1) via the Zolotarev's probability metric. Mathematics Subject Classification 2010: 60G50; 60F05; 60E07.


1978 ◽  
Vol 15 (01) ◽  
pp. 65-77 ◽  
Author(s):  
Anthony G. Pakes

This paper develops the notion of the limiting age of an absorbing Markov chain, conditional on the present state. Chains with a single absorbing state {0} are considered and with such a chain can be associated a return chain,obtained by restarting the original chain at a fixed state after each absorption. The limiting age,A(j), is the weak limit of the timegivenXn=j(n → ∞).A criterion for the existence of this limit is given and this is shown to be fulfilled in the case of the return chains constructed from the Galton–Watson process and the left-continuous random walk. Limit theorems forA(J) (J →∞) are given for these examples.


1983 ◽  
Vol 20 (03) ◽  
pp. 675-688 ◽  
Author(s):  
G. Hooghiemstra

This paper is on conditioned weak limit theorems for imbedded waiting-time processes of an M/G/1 queue. More specifically we study functional limit theorems for the actual waiting-time process conditioned by the event that the number of customers in a busy period exceeds n or equals n. Attention is also paid to the actual waiting-time process with random time index. Combined with the existing literature on the subject this paper gives a complete account of the conditioned limit theorems for the actual waiting-time process of an M/G/1 queue for arbitrary traffic intensity and for a rather general class of service-time distributions. The limit processes that occur are Brownian excursion and meander, while in the case of random time index also the following limit occurs: Brownian excursion divided by an independent and uniform (0, 1) distributed random variable.


Author(s):  
Yuri Kondratiev ◽  
Yuliya Mishura ◽  
Georgiy Shevchenko

Abstract For a continuous-time random walk X = {X t , t ⩾ 0} (in general non-Markov), we study the asymptotic behaviour, as t → ∞, of the normalized additive functional $c_t\int _0^{t} f(X_s)\,{\rm d}s$ , t⩾ 0. Similarly to the Markov situation, assuming that the distribution of jumps of X belongs to the domain of attraction to α-stable law with α > 1, we establish the convergence to the local time at zero of an α-stable Lévy motion. We further study a situation where X is delayed by a random environment given by the Poisson shot-noise potential: $\Lambda (x,\gamma )= {\rm e}^{-\sum _{y\in \gamma } \phi (x-y)},$ where $\phi \colon \mathbb R\to [0,\infty )$ is a bounded function decaying sufficiently fast, and γ is a homogeneous Poisson point process, independent of X. We find that in this case the weak limit has both ‘quenched’ component depending on Λ, and a component, where Λ is ‘averaged’.


Sign in / Sign up

Export Citation Format

Share Document