scholarly journals Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems

Author(s):  
Nicolas Broutin ◽  
Thomas Duquesne ◽  
Minmin Wang

AbstractWe consider a natural model of inhomogeneous random graphs that extends the classical Erdős–Rényi graphs and shares a close connection with the multiplicative coalescence, as pointed out by Aldous (Ann Probab 25:812–854, 1997). In this model, the vertices are assigned weights that govern their tendency to form edges. It is by looking at the asymptotic distributions of the masses (sum of the weights) of the connected components of these graphs that Aldous and Limic (Electron J Probab 3:1–59, 1998) have identified the entrance boundary of the multiplicative coalescence, which is intimately related to the excursion lengths of certain Lévy-type processes. We, instead, look at the metric structure of these components and prove their Gromov–Hausdorff–Prokhorov convergence to a class of (random) compact measured metric spaces that have been introduced in a companion paper (Broutin et al. in Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs. arXiv:1804.05871, 2020). Our asymptotic regimes relate directly to the general convergence condition appearing in the work of Aldous and Limic. Our techniques provide a unified approach for this general “critical” regime, and relies upon two key ingredients: an encoding of the graph by some Lévy process as well as an embedding of its connected components into Galton–Watson forests. This embedding transfers asymptotically into an embedding of the limit objects into a forest of Lévy trees, which allows us to give an explicit construction of the limit objects from the excursions of the Lévy-type process. The mains results combined with the ones in the other paper allow us to extend and complement several previous results that had been obtained via model- or regime-specific proofs, for instance: the case of Erdős–Rényi random graphs obtained by Addario-Berry et al. (Probab Theory Relat Fields 152:367–406, 2012), the asymptotic homogeneous case as studied by Bhamidi et al. (Probab Theory Relat Fields 169:565–641, 2017), or the power-law case as considered by Bhamidi et al. (Probab Theory Relat Fields 170:387–474, 2018).

2020 ◽  
Vol 10 (4) ◽  
pp. 310-334
Author(s):  
Gianmarco Bet ◽  
Remco van der Hofstad ◽  
Johan S. H. van Leeuwaarden

We consider a queue to which only a finite pool of n customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement S arrives to the queue after an exponentially distributed time with mean S-α for some [Formula: see text]; therefore, larger service requirements trigger customers to join earlier. This finite-pool queue interpolates between two previously studied cases: α = 0 gives the so-called [Formula: see text] queue and α = 1 is closely related to the exploration process for inhomogeneous random graphs. We consider the asymptotic regime in which the pool size n grows to infinity and establish that the scaled queue-length process converges to a diffusion process with a negative quadratic drift. We leverage this asymptotic result to characterize the head start that is needed to create a long period of activity. We also describe how this first busy period of the queue gives rise to a critically connected random forest.


1988 ◽  
Vol 8 (8) ◽  
pp. 63-72 ◽  

AbstractThe existence of transversal ejection—collision orbits in the restricted three-body problem is shown to imply, via the KAM theorem, the existence, for certain intervals of (large) values of the Jacobi constant, of an uncountable number of invariant punctured tori in the corresponding (non-compact) energy surface. The proof is based on a comparison between Levi-Civita and McGehee regularizing variables. That these transversal ejection-collision orbits do actually exist was proved in [5] in the case where one of the primaries has a small mass and the zero-mass body revolves around the other (and for all values of the Jacobi constant compatible with the existence of three connected components for the Hill region); it is proved here without any restriction on the masses, well in the spirit of Conley's thesis [3].


2015 ◽  
Vol 184 ◽  
pp. 130-138 ◽  
Author(s):  
Tobias Friedrich ◽  
Anton Krohmer

1987 ◽  
Vol 101 (2) ◽  
pp. 291-300 ◽  
Author(s):  
Michał Karoński ◽  
Andrzej Ruciński

Barbour [l] invented an ingenious method of establishing the asymptotic distribution of the number X of specified subgraphs of a random graph. The novelty of his method relies on using the first two moments of X only, despite the traditional method of moments that involves all moments of X (compare [8, 10, 11, 14]). He also adjusted that new method for counting isolated trees of a given size in a random graph. (For further applications of Barbour's method see [4] and [10].) The main goal of this paper is to show how this method can be extended to a general setting that enables us to derive asymptotic distributions of subsets of vertices of a random graph with various properties.


2010 ◽  
Vol 20 (1) ◽  
pp. 131-154 ◽  
Author(s):  
TATYANA S. TUROVA

We study the ‘rank 1 case’ of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result complements the corresponding known result in the supercritical case. We provide some examples of applications of the derived formula.


2010 ◽  
Vol 39 (3) ◽  
pp. 399-411 ◽  
Author(s):  
Svante Janson ◽  
Oliver Riordan

2019 ◽  
Vol 760 ◽  
pp. 35-54 ◽  
Author(s):  
Karl Bringmann ◽  
Ralph Keusch ◽  
Johannes Lengler

Sign in / Sign up

Export Citation Format

Share Document