Zobrazeno 1 - 10
of 1 067
pro vyhledávání: '"Rodgers G"'
Autor:
Colman, E. R., Rodgers, G. J.
We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of "splitting" nodes of degree $k$ into $k$ nodes of degree 1. Four networks are considered, each evolves at each
Externí odkaz:
http://arxiv.org/abs/1309.6225
Autor:
Tadic, Bosiljka, Rodgers, G. J.
We introduce cluster dynamical models of conflicts in which only the largest cluster can be involved in an action. This mimics the situations in which an attack is planned by a central body, and the largest attack force is used. We study the model in
Externí odkaz:
http://arxiv.org/abs/1001.3012
Autor:
Nagao, Taro, Rodgers, G. J.
In order to clarify the statistical features of complex networks, the spectral density of adjacency matrices has often been investigated. Adopting a static model introduced by Goh, Kahng and Kim, we analyse the spectral density of complex scale free
Externí odkaz:
http://arxiv.org/abs/0803.1042
Publikováno v:
In V.N. Alexnandrov et l., editor, ICCS 2006, volume \textbf{3993} of Lecture Notes in Computer Science, pages 1024-1031, Berlin, 2006, Springer
We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time of packets
Externí odkaz:
http://arxiv.org/abs/0802.3634
Autor:
Masucci, A. P., Rodgers, G. J.
Publikováno v:
Adv. in Compl. Syst. 12, 113 (2009)
In this paper we deal with the structural properties of weighted networks. Starting from an empirical analysis of a linguistic network, we analyse the differences between the statistical properties of a real and a shuffled network and we show that th
Externí odkaz:
http://arxiv.org/abs/0802.2798
Autor:
Masucci, A. P., Rodgers, G. J.
Publikováno v:
Physica A vol.387, 3781 (2008).
We study the directed and weighted network in which the wards of London are vertices and two vertices are connected whenever there is at least one person commuting to work from a ward to another. Remarkably the in-strength and in-degree distribution
Externí odkaz:
http://arxiv.org/abs/0712.1960
Publikováno v:
Physica A vol.387, 2161 (2008).
We introduce a new class of deterministic networks by associating networks with Diophantine equations, thus relating network topology to algebraic properties. The network is formed by representing integers as vertices and by drawing cliques between M
Externí odkaz:
http://arxiv.org/abs/0712.1723
Autor:
Masucci, A. P., Rodgers, G. J.
Publikováno v:
Physica A vol.386, 557 (2007).
We introduce and analyze a model of a multi-directed Eulerian network, that is a directed and weighted network where a path exists that passes through all the edges of the network once and only once. Networks of this type can be used to describe info
Externí odkaz:
http://arxiv.org/abs/physics/0702097
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we address this que
Externí odkaz:
http://arxiv.org/abs/physics/0606166
Autor:
Masucci, A. P., Rodgers, G. J.
Publikováno v:
Phys Rev E.74. 026102, 2006
We investigate the nature of written human language within the framework of complex network theory. In particular, we analyse the topology of Orwell's \textit{1984} focusing on the local properties of the network, such as the properties of the neares
Externí odkaz:
http://arxiv.org/abs/physics/0605071