Results 41 to 50 of about 210 (139)
Planar growth generates scale-free networks [PDF]
, 2016 In this paper, we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in R2, forming new connections to old nodes subject to the constraint that edges do not cross.
Bullock, Seth +2 more
core +2 more sources
Hierarchical Information Clustering by Means of Topologically Embedded Graphs [PDF]
, 2012 We introduce a graph-theoretic approach to extract clusters and hierarchies in complex data-sets in an unsupervised and deterministic manner, without the use of any prior information.
Song, Won-Min +8 more
core +1 more source
Analytical solution of average path length for Apollonian networks [PDF]
Physical Review E, 2008 8 pages, 4 ...
Zhang, Zhongzhi +5 more
openaire +3 more sources
Infinitely robust order and local order-parameter tulips in Apollonian networks with quenched disorder [PDF]
, 2009 For a variety of quenched random spin systems on an Apollonian network, including ferromagnetic and antiferromagnetic bond percolation and the Ising spin glass, we find the persistence of ordered phases up to infinite temperature over the entire range of
Kaplan, C. Nadir; Berker, Ahmet Nihat +3 more
core +1 more source
Analytical approach to directed sandpile models on the Apollonian network [PDF]
Physical Review E, 2007 We investigate a set of directed sandpile models on the Apollonian network, which are inspired on the work by Dhar and Ramaswamy (PRL \textbf{63}, 1659 (1989)) for Euclidian lattices. They are characterized by a single parameter $q$, that restricts the number of neighbors receiving grains from a toppling node.
Vieira, André P. +3 more
openaire +3 more sources
General model for Apollonian networks
, 2005 We introduce a general deterministic model for Apollonian Networks in an iterative fashion. The networks have small-world effect and scale-free topology. We calculate the exact results for the degree exponent, the clustering coefficient and the diameter.
Zhang, Zhongzhi, Rong, Lili
openaire +2 more sources
High dimensional Apollonian networks
, 2008 . We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the ...
Guillaume Fertin +3 more
core
Toughness and Hamiltonicity in Random Apollonian Networks
, 2020 15 pages, 5 ...
Markenzon, Lilian +1 more
openaire +2 more sources
Random walks on the Apollonian network with a single trap
, 2009 Explicit determination of the mean first-passage time (MFPT) for the trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e., node with the ...
Zhongzhi Zhang +4 more
core +1 more source
Coherence in scale-free networks of chaotic maps [PDF]
, 2004 We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) a random scalefree topology, (ii) a deterministic ...
Gallas, Jason Alfredo Carlson +5 more
core +1 more source