scispace - formally typeset
Journal ArticleDOI

Topological and Spectral Properties of Small-World Hierarchical Graphs

Yi Qi, +2 more
- 01 May 2019 - 
- Vol. 62, Iss: 5, pp 769-784
About
This article is published in The Computer Journal.The article was published on 2019-05-01. It has received 13 citations till now.

read more

Citations
More filters
Journal ArticleDOI

Modeling Higher-Order Interactions in Complex Networks by Edge Product of Graphs

TL;DR: This paper proposes a simple generative model for simplicial networks by iteratively using edge corona product, and presents a comprehensive analysis of the structural properties of the network model, including degree distribution, diameter, clustering coefficient, as well as distribution of clique sizes.
Posted Content

Edge corona product as an approach to modeling complex simplical networks.

TL;DR: This paper proposes a simple generative model for simplicial networks by iteratively using edge corona product, and presents a comprehensive analysis of the structural properties of the network model, including degree distribution, diameter, clustering coefficient, as well as distribution of clique sizes.
Journal ArticleDOI

The asymptotic formula on average weighted path length for scale-free modular network

TL;DR: The average path length for a class of scale-free modular networks with deterministic growth is discussed, and it is deduced that when the network iteration tends to infinity, the average weighted shortest path length is bounded, and the result is independent of the connection method of network.
Journal ArticleDOI

Exploring Trapping Problem on Weighted Heterogeneous Networks Induced by Extended Corona Product

TL;DR: By taking type of random walks and number of traps into account and compiling four different scenarios, trapping problem is touched more completely on resultant weighted heterogeneous networks of extended corona product and weight reinforcement mechanism.
Journal ArticleDOI

Resistance Distances in Simplicial Networks

TL;DR: In this paper , the average resistance distance tends to a q-dependent constant, indicating the impact of simplicial organization on the structural robustness measured by average resist distance. But the authors do not provide exact formulas for interesting quantities about resistance distances.
References
More filters
Journal ArticleDOI

Collective dynamics of small-world networks

TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI

Emergence of Scaling in Random Networks

TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI

The Structure and Function of Complex Networks

Mark Newman
- 01 Jan 2003 - 
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Journal ArticleDOI

Community structure in social and biological networks

TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Journal ArticleDOI

Finding and evaluating community structure in networks.

TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.