A5100675727- Mathematical Dynamics and Fractals
- Advanced Topology and Set Theory
- Complex Network Analysis Techniques
- Topological and Geometric Data Analysis
- Theoretical and Computational Physics
- Cellular Automata and Applications
- Graph theory and applications
- Advanced Mathematical Theories and Applications
- semigroups and automata theory
- Opinion Dynamics and Social Influence
- Functional Equations Stability Results
- Analytic and geometric function theory
- advanced mathematical theories
- Advanced Differential Equations and Dynamical Systems
- Fractal and DNA sequence analysis
- Image Retrieval and Classification Techniques
- Computability, Logic, AI Algorithms
- Complex Systems and Time Series Analysis
- Limits and Structures in Graph Theory
- Differential Equations and Numerical Methods
- Mathematical Analysis and Transform Methods
- Algorithms and Data Compression
- Mathematics and Applications
- Neural Networks and Applications
- Fault Detection and Control Systems
Ningbo University
2015-2024
Shanghai Jiao Tong University
2007-2024
Georgia Institute of Technology
2024
State Key Laboratory of Mechanical System and Vibration
2024
Hangzhou Dianzi University
2023
Hunan Normal University
2019-2021
Zhejiang Wanli University
2008-2020
Shenzhen University
2016
Tsinghua University
2016
Huazhong University of Science and Technology
2011-2013
The average geodesic distance is concerned with complex networks. To obtain the limit of distances on growing Sierpinski networks, we accurate value integral in terms and self-similar measure gasket. provide integral, find phenomenon finite pattern inspired by concept type sets overlaps.
Image generative models for ceramic tile design lack style diversity and controllability of high-quality generated styles. It is difficult to find a series tiles with the same texture but distinct styles, that makes it challenging users select from limited number single style. Although, Generative Adversarial Networks (GANs) can slightly increase images, remains very weak. Additionally, concatenating image blocks obtain larger region easily result in seams at boundaries decrease quality. In...
The Assouad dimension of fractals is not invariant under quasi-Lipschitz mappings, even for Ahlfors–David regular sets. In this manuscript, we shall give a new dim _{qA} named the quasi-Assouad dimension, which any mapping, satisfying \overline{\mathrm {dim}}_{B}E \leq \mathrm {dim}_{qA}E {dim}_{A}E compact subset E metric space. By virtue show that Bedford–McMullen carpet F Assouad-minimal, i.e., _{A}f(F)\geq {dim} _{A}F mapping f .
In this paper, we introduce new models of non-homogenous weighted Koch networks on real traffic systems depending the three scaling factors r1,r2,r3∈(0,1). Inspired by definition average shortest path (AWSP), define receiving time (AWRT). Assuming that walker, at each step, starting from its current node, moves uniformly to any neighbors, show in large network, AWRT grows as power-law function network order with exponent, represented θ(r1,r2,r3)=log4(1+r1+r2+r3). Moreover, AWSP, infinite...
We obtain the average geodesic distance on Sierpinski carpet in terms of integral self-similar measure. find out finite pattern phenomenon inspired by notion type sets with overlaps.
In this paper, we will study the geometric structure on Sierpinski networks which are skeleton of a connected self-similar carpet. Under some suitable condition, figure out that renormalized shortest path distance is comparable to planar Manhattan distance, and obtain Hausdorff dimension networks.
In this paper, we introduce a method which can generate family of growing symmetrical tree networks. The networks are constructed by replacing each edge with reduced-scale the initial graph. Repeating procedure, obtain fractal define average geodesic distance in terms some integral, and calculate its accurate value. We find that limit finite tends to tree. This result generalizes paper [Z. Zhang, S. Zhou, L. Chen, M. Yin J. Guan, Exact solution mean for Vicsek fractals, Phys. A: Math. Gen....
In this paper, we present weighted tetrahedron Koch networks depending on a weight factor. According to their self-similar construction, obtain the analytical expressions of clustering coefficient and average shortest path (AWSP). The obtained solutions show that exhibits small-world property. Then, calculate receiving time (ART) weighted-dependent walks, which is sum mean first-passage times (MFPTs) for all nodes absorpt at trap located hub node. We find ART sublinear or linear dependence...
The edge-Wiener index, an invariant index representing the summation of distances between every pair edges in graph, has monumental influence on study chemistry and materials science. In this paper, drawing inspiration from Gromov’s idea, we use finite pattern method proposed by Wang et al. [Average geodesic distance Sierpinski gasket networks, Fractals 25(5) (2017) 1750044] to figure out exact formula fractal networks.