Inhomogeneous random graphs with infinite-mean fitness variables
Leiden University(莱顿大学);Università degli Studi di Firenze(佛罗伦萨大学);Lorentz Institute for Theoretical Physics, Leiden University(莱顿大学洛伦兹理论物理研究所);IMT School for Advanced Studies(IMT高等研究院);INdAM-GNAMPA Istituto Nazionale di Alta Matematica(意大利高等数学国家研究所)
Luca Avena, Diego Garlaschelli, Rajat Subhra Hazra, Margherita Lalli
备注:
substantially revised version. The previous version had some errors and they are fixed now in the present version
We consider an inhomogeneous Erdős-Rényi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of the graph. This model was recently investigated in the physics literature in Garuccio et al. (2020) as a scale-invariant random graph within the context of network renormalization. From a mathematical perspective, the model fits in the class of scale-free inhomogeneous random graphs whose asymptotic geometrical features have been recently attracting interest. While for this type of graphs several results are known when the underlying vertex variables have finite mean and variance, here instead we consider the case of one-sided stable variables with necessarily infinite mean. To simplify our analysis, we assume that the variables are sampled from a Pareto distribution with parameter $α\in(0,1)$. We start by characterizing the asymptotic distributions of the typical degrees and some related observables. In particular, we show that the degree of a vertex converges in distribution, after proper scaling, to a mixed Poisson law. We then show that correlations among degrees of different vertices are asymptotically non-vanishing, but at the same time a form of asymptotic tail independence is found when looking at the behavior of the joint Laplace transform around zero. Moreover, we present some findings concerning the asymptotic density of wedges and triangles and show a cross-over for the existence of dust (i.e. disconnected vertices).
Infinite-horizon time-inhomogeneous Kolmogorov equation and non-autonomous multi-scale stochastic systems
School of Mathematics and Statistics, Jiangsu Normal University(江苏师范大学数学与统计学院);School of Mathematics and Big Data, Anhui University of Science and Technology(安徽理工大学数学与大数据学院);School of Mathematical Sciences, Tiangong University(天津工业大学数学科学学院)
Cluster tails for critical power-law inhomogeneous random graphs
最近,得到了具有有限方差但无限三阶矩度的rank-1型临界非齐次随机图的簇大小的标度极限(参见Bhamidi,van der Hofstad和van Leeuwaarden以前的工作)。证明了当度服从指数在区间(3,4)内的幂律时,按大小递减排序并适当缩放的簇序列随着n的无穷大收敛于一个递减的非退化随机变量序列.在这里,我们研究了重新缩放的最大集群的极限的尾部,即,作为u的函数,最大簇的缩放限制取大值u的概率。这将Pittel关于Erdens-Rényi随机图的一个相关结果推广到了秩为1且三阶矩度为无穷大的非齐次随机图的情形.我们利用微妙的大偏差和弱收敛的论点。
First Passage Percolation on Inhomogeneous Random Graphs
本文研究了非齐次随机图上的首次通过渗流问题。我们研究的随机图模型G(n,kappa)是Bollobás,Janson和Riordan提出的模型,其中每个顶点都有一个来自类型空间S的类型,边概率是独立的,但依赖于端顶点的类型。每个边被赋予独立的指数权重。我们确定的最短路径之间的统一选择的顶点在巨大的组件的重量分布,并表明,跳数,即边缘的数量在这个最小的重量路径,适当规范化遵循中心极限定理。我们处理的情况下,lambda(n)->lambda是有限的或无限的,假设一个顶点的邻居lambda(n)的平均数量是独立的类型。本文推广了Bhamidi,van der Hofstad和Hooghiemstra在Erdos-Renyi图上研究FPP的文章.