𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Directed accelerated growth: application in citation network

✍ Scribed by Parongama Sen

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
265 KB
Volume
346
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

✦ Synopsis

In many real-world networks, the number of links increases non-linearly with the number of nodes. Models of such accelerated growth have been considered earlier with deterministic and stochastic number of links. Here we consider stochastic accelerated growth in a network where links are directed. With the number of outgoing links following a power-law distribution, the results are similar to the undirected case. As the accelerated growth is enhanced, the degree of distribution becomes independent of the ''initial attractiveness'', a parameter which plays a key role in directed networks. As an example of a directed model with accelerated growth, the citation network is considered, in which the distribution of the number of outgoing link has an exponential tail. The role of accelerated growth is examined here with two different growth laws.

πŸ“œ SIMILAR VOLUMES

Identifying directed links in large scal
Identifying directed links in large scale functional networks: application to brain fMRI
✍ Guillermo A Cecchi; A Ravishankar Rao; Maria V Centeno; Marwan Baliki; A Vania A πŸ“‚ Article πŸ“… 2007 πŸ› BioMed Central 🌐 English βš– 1022 KB

## Background Biological experiments increasingly yield data representing large ensembles of interacting variables, making the application of advanced analytical tools a forbidding task. We present a method to extract networks of correlated activity, specifically from functional MRI data, such that

Coloring all directed paths in a symmetr
Coloring all directed paths in a symmetric tree, with an application to optical networks
✍ Luisa Gargano; Pavol Hell; Stephane Perennes πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract Let __T__ be a symmetric directed tree, i.e., an undirected tree with each edge viewed as two opposite arcs. We prove that the minimum number of colors needed to color the set of all directed paths in __T__, so that two paths of the same color never use the same directed arc of __T__, i