A random graph growth model

Author:

Farber Michael1,Gnedin Alexander1ORCID,Mannan Wajid1

Affiliation:

1. School of Mathematical Sciences Queen Mary University of London London UK

Abstract

AbstractA growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process, the pool contains virtual vertices and no edges. Each time a vertex is sampled and occupied, the edges linking the vertex to previously occupied vertices are added to the pool of virtual elements. We focus on the edge‐counting at times when the graph has occupied vertices. Two different Poisson limits are identified for and . For the bulk of the process, when , the scaled number of edges is shown to fluctuate about a deterministic curve, with fluctuations being of the order of and approximable by a Gaussian bridge.

Publisher

Wiley

Subject

General Mathematics

Reference15 articles.

1. Gaussian process approximations for multicolor Pólya urn models

2. R. W. R.Darling Fluid limits of pure jump processes: a practical guide arxiv.org (2002)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3