We introduce a minimal model of growing small-world network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially with degree and average clustering coefficient C = 3 2 ln3− 1 ≈ 0.6479, which are in good agreement with the numerical simulations. We also prove that the i...

We derive properties of Latent Variable Models for networks, a broad class of models that includes the widely-used Latent Position Models. These include the average degree distribution, clustering coefficient, average path length and degree correlations. We introduce the Gaussian Latent Position Model, and derive analytic expressions and asymptotic approximations for its network properties. We ...

In this paper, we study a first order random coefficient autoregressive model with Laplace distribution as marginal. A random coefficient moving average model of order one with Laplace as marginal distribution is introduced and its properties are studied. By combining the two models, we develop a first order random coefficient autoregressive moving average model with Laplace marginal and discus...

The purpose of this paper is to assess the statistical characterization of weighted networks in terms of the generalization of the relevant parameters, namely, average path length, degree distribution, and clustering coefficient. Although the degree distribution and the average path length admit straightforward generalizations, for the clustering coefficient several different definitions have b...

We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and clustering coefficients which are determined by the dimension of the network. The values obtained for these parameters are in good agreement with simulation resul...

In this work, the Z-average, effective, apparent diffusion coefficients and their poly-dispersity indexes were investigated for dilute poly-disperse homogeneous spherical particles in dispersion where the Rayleigh-Gans-Debye approximation is valid. The results reveal that the values of the apparent and effective diffusion coefficients at a scattering angle investigated are consistent and the di...

In the era of big data, graph sampling is indispensable in many settings. Existing sampling methods are mostly designed for static graphs, and aim to preserve basic structural properties of the original graph (such as degree distribution, clustering coefficient etc.) in the sample. We argue that for any sampling method it is impossible to produce an universal representative sample which can pre...

We proposed a new Small-World network (called n-Star network in which average path-length L becomes absolutely small) inspired by ants’ collective behavior. As one of the real-world applications using this network, it is shown that reorganization of the world airline network is possible in the next generation. In addition, it not only has the characteristic that is more immune from random failu...

In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree distribution. Moreover, the observed degree distribution usually has an infinite variance. Therefore, we are especially interested in such degree distributions. In addition, we analyze the clustering coefficient for ...

An experimental investigation was conducted to study the average and the fully-developed heat (mass) transfer coefficients in a rectangular smooth duct and a duct with repeated-baffle blockages. The focus of attention in this work is the conventional correlation Nu / Nufd 1 + C / ( X / D ) for the average heat transfer coefficient. It was shown that for relatively short ducts, the coefficient C...