A reduced model for complex network analysis of public transportation systems
AA De Bona, M de Oliveira Rosa, KVO Fonseca… - Physica A: Statistical …, 2021 - Elsevier
Public transportation networks (PTNs) are represented as complex networks in order to
analyze their robustness regarding node and link failures, to classify them into different …
analyze their robustness regarding node and link failures, to classify them into different …
Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
M Hinczewski, A Nihat Berker - Physical Review E—Statistical, Nonlinear, and …, 2006 - APS
We have obtained exact results for the Ising model on a hierarchical lattice incorporating
three key features characterizing many real-world networks—a scale-free degree …
three key features characterizing many real-world networks—a scale-free degree …
A critical review on the research topic system of soil heavy metal pollution bioremediation based on dynamic co-words network measures
R Luo, J Li, Y Zhao, X Fan, P Zhao, L Chai - Geoderma, 2017 - Elsevier
From the perspective of dynamic co-words network, for the first time this paper provide a
unique flavored critical review on the evolution of the research topic system (RTS) of soil …
unique flavored critical review on the evolution of the research topic system (RTS) of soil …
Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
In this paper, firstly, we study analytically the topological features of a family of hierarchical
lattices (HLs) from the view point of complex networks. We derive some basic properties of …
lattices (HLs) from the view point of complex networks. We derive some basic properties of …
Evolving Apollonian networks with small-world scale-free topologies
We propose two types of evolving networks: evolutionary Apollonian networks (EANs) and
general deterministic Apollonian networks (GDANs), established by simple iteration …
general deterministic Apollonian networks (GDANs), established by simple iteration …
A general geometric growth model for pseudofractal scale-free web
We propose a general geometric growth model for pseudofractal scale-free web (PSW),
which is controlled by two tunable parameters. We derive exactly the main characteristics of …
which is controlled by two tunable parameters. We derive exactly the main characteristics of …
Farey graphs as models for complex networks
Z Zhang, F Comellas - Theoretical Computer Science, 2011 - Elsevier
Farey sequences of irreducible fractions between 0 and 1 can be related to graph
constructions known as Farey graphs. These graphs were first introduced by Matula and …
constructions known as Farey graphs. These graphs were first introduced by Matula and …
[HTML][HTML] Structural and spectral properties of corona graphs
Product graphs have been gainfully used in literature to generate mathematical models of
complex networks which inherit properties of real networks. Realizing the duplication …
complex networks which inherit properties of real networks. Realizing the duplication …
Analytical solution of average path length for Apollonian networks
With the help of recursion relations derived from the self-similar structure, we obtain the
solution of average path length, d¯ t, for Apollonian networks. In contrast to the well-known …
solution of average path length, d¯ t, for Apollonian networks. In contrast to the well-known …