Stochastic Methods on Random Recursive Graphs Having Scale-free Properties

DOI

10.2991/icca-16.2016.85How to use a DOI?

Keywords

Scale-free graph, Continuum theory, Master equation, Rate equation

Abstract

In this paper, we recommend a stochastic recursive graph, on the basis of which we reform a kind of graph called random recursive graphs. We investigate analytically or numerically the statistical characteristics of random recursive graphs. The obtained results reveal that the properties of random recursive graphs are particularly rich, it is simultaneously scale-free. Besides, we present three approaches to illustrate the random recursive graphs following the power law behavior. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. We discuss the gap between the deterministic network and random network.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaomin Wang
AU  - Bing Yao
AU  - Ming Yao
PY  - 2016/01
DA  - 2016/01
TI  - Stochastic Methods on Random Recursive Graphs Having Scale-free Properties
BT  - Proceedings of the 2016 International Conference on Intelligent Control and Computer Application
PB  - Atlantis Press
SP  - 357
EP  - 360
SN  - 2352-538X
UR  - https://doi.org/10.2991/icca-16.2016.85
DO  - 10.2991/icca-16.2016.85
ID  - Wang2016/01
ER  -