258 research outputs found

    Exact analytical solution of average path length for Apollonian networks

    Full text link
    The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact solution of average path length, dˉt\bar{d}_t, for Apollonian networks. In contrast to the well-known numerical result dˉt(lnNt)3/4\bar{d}_t \propto (\ln N_t)^{3/4} [Phys. Rev. Lett. \textbf{94}, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmically as dˉtlnNt\bar{d}_t \propto \ln N_t in the infinite limit of network size NtN_t. The extensive numerical calculations completely agree with our closed-form solution.Comment: 8 pages, 4 figure

    Part-Whole Relational Few-Shot 3D Point Cloud Semantic Segmentation

    Get PDF
    The author wishes to extend sincere appreciation to Professor Lin Shi for the generous provision of equipment support, which significantly aided in the successful completion of this research. Furthermore, the author expresses gratitude to Associate Professor Ning Li and Teacher Wei Guan for their invaluable academic guidance and unwavering support. Their expertise and advice played a crucial role in shaping the direction and quality of this research.Peer reviewe

    Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation

    Full text link
    Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of deterministically growing networks called Sierpinski networks, which are induced by the famous Sierpinski fractals and constructed in a simple iterative way. We derive analytical expressions for degree distribution, strength distribution, clustering coefficient, and strength-degree correlation, which agree well with the characterizations of various real-life networks. Moreover, we show that the introduced Sierpinski networks are maximal planar graphs.Comment: 6 pages, 5 figures, accepted by EP
    corecore