Characterizing several properties of high-dimensional random Apollonian networks

Zhang, Panpan

doi:10.48550/arxiv.1901.07073

Cited by 1 publication

(1 citation statement)

References 61 publications

(72 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From Eq. ( 3), it is clear to see that average degree k(t; m) is linearly correlated with time step t and no longer a constant compared with those models in [10], such as, Apollonian networks [12]. To the best of our knowledge, networked graphs G(t; m) are the first effort in the study of constructing deterministic scale-free graphs (discussed later).…”

Section: Average Degreementioning

confidence: 99%

Scale-free networks with invariable diameter and density feature: Counterexamples

Wang

2020

Phys. Rev. E

View full text Add to dashboard Cite

Here, we propose a class of scale-free networked graphs G(t; m) with some intriguing properties, which can not be simultaneously held by all the theoretical models with power-law degree distribution in the existing literature, including (i) average degrees k of all the generated graphs are no longer a constant in the limit of large graph size, implying that they are not sparse but dense, (ii) power-law parameters γ of these models are precisely calculated equal to 2, as well (iii) their diameters D are all an invariant in the growth process of models. While our models have deterministic structure with clustering coefficients equivalent to zero, we might be able to obtain various candidates with nonzero clustering coefficient based on original graphs using some reasonable approaches, for instance, randomly adding some new edges under the premise of keeping the three important properties above unchanged. In addition, we study trapping problem on graphs G(t; m) and then obtain closedform solutions HT t to mean hitting time. As opposed to other models, our results show an unexpected phenomenon that HT t is approximately close to the logarithm of order of graphs G(t; m) however not to the order itself. From the theoretical point of view, these networked graphs considered here can be thought of as counterexamples for most of the published models obeying power-law distribution in current study. graphs on dynamics taking place on networks themselves, for instance, the mean hitting time for trapping problem, synchronization in networks, epidemic spread [5]- [7]. In this paper, we not only propose a family of networked models G(t; m) and discuss some commonly used topological measures for understanding models G(t; m) in much detail, but also consider the trapping problem on the proposed models G(t; m) and final derive the closed-form solution to mean hitting time.The main concern in the previous research of theoretical networked models is to focus on constructing models which have scale-free and small-world characters as described above. However, an overwhelming number of models are sparse, implying that the average degree of networks will tend to a constant in the limit of large graph size. This is because a great deal of real-life networks are found to display sparsity feature. By contrast, current studies in some areas turns out the existence of dense networks [8]. To describe these such networks, some available networked models have be proposed [9] and analytically investigated in some principled manners, including mean-field theory and master equation. Yet, most of them are stochastic. To our knowledge, almost no deterministic models with both density structure and scale-free feature are built in the past. Although there exist some disadvantages inherited by the latter in comparison with the former, the deterministic structure of model allows us to precisely derive the solutions to some quantities of great interest, such as clustering coefficient, degree distribution, average path length. To some extent, determining s...

show abstract

Section: Average Degreementioning

confidence: 99%

Scale-free networks with invariable diameter and density feature: Counterexamples

Wang

2020

Phys. Rev. E

View full text Add to dashboard Cite

show abstract

Characterizing several properties of high-dimensional random Apollonian networks

Cited by 1 publication

References 61 publications

Scale-free networks with invariable diameter and density feature: Counterexamples

Scale-free networks with invariable diameter and density feature: Counterexamples

Contact Info

Product

Resources

About