Showing 1 - 10 of 44
This article describes how the average path length (APL) of a network is an important metric that provides insights on the interconnectivity in a network and how much time and effort would be required for search and navigation on that network. However, the estimation of APL is time-consuming as...
Persistent link: https://www.econbiz.de/10012046952
Persistent link: https://www.econbiz.de/10011708513
Persistent link: https://www.econbiz.de/10014495969
This work introduces a network model of an interbank market based on interbank credit lending relationships. It generates some network features identified through empirical analysis. The critical issue to construct an interbank network is to decide the edges among banks, which is realized in...
Persistent link: https://www.econbiz.de/10010589451
This paper proposes how to build a syntactic network based on syntactic theory and presents some statistical properties of Chinese syntactic dependency networks based on two Chinese treebanks with different genres. The results show that the two syntactic networks are small-world networks, and...
Persistent link: https://www.econbiz.de/10010590032
In this article, we propose an octahedral Koch network exhibiting abundant new properties compared to the triangular Koch network. Analytical expressions for the degree distribution, clustering coefficient, and average path length are presented. The scale-free feature and small-world property of...
Persistent link: https://www.econbiz.de/10010590035
It is well known that flexibility can be created in manufacturing and service operations by using multipurpose production sources such as cross-trained labor, flexible machines, or flexible factories. We focus on flexible service centers, such as inbound call centers with cross-trained agents,...
Persistent link: https://www.econbiz.de/10009191835
We show how appropriate rewiring with the aid of Metropolis Monte Carlo computational experiments can be exploited to create network topologies possessing prescribed values of the average path length (APL) while keeping the same connectivity degree and clustering coefficient distributions. Using...
Persistent link: https://www.econbiz.de/10011117208
With the help of the recurrence relations derived from the self-similar structure, we obtain the closed-form solution for the average path length of a class of scale-free fractal hierarchical lattices (HLs) with a general parameter q, which are simultaneously scale-free, self-similar and...
Persistent link: https://www.econbiz.de/10011058833
Persistent link: https://www.econbiz.de/10011582583