pith. sign in

arxiv: 1512.08657 · v3 · pith:4ZRPGBVLnew · submitted 2015-12-29 · 💻 cs.SI · math.DS

The Join of Scale-free Network Models

classification 💻 cs.SI math.DS
keywords domi-joinmodelmodelsnetworkdistributionjoinoperationpower
0
0 comments X
read the original abstract

We focus on constructing the domi-join model by doing the join operation based on two smallest dominating sets of two network models and analysis the properties of domi-join model, such as power law distribution, small world. Besides, we will import two class of edge-bound growing network models to explain the process of domi-join model. Then we compute the average degree, clustering coefficient, power law distribution of the domi-join model. Finally, we discuss an impressive method for cutting down redundant operation of domi-join model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.