IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v387y2008i2p685-693.html

Reachability and recoverability of sink nodes in growing acyclic directed networks

Author

Listed:
  • Barbosa, Valmir C.

Abstract

We study the growth of networks from a set of isolated ground nodes by the addition of one new node per time step and also of a fixed number of directed edges leading from the new node to randomly selected nodes already in the network. A fixed-width time window is used so that, in general, only nodes that entered the network within the latest window may receive new incoming edges. The resulting directed network is acyclic at all times and allows some of the ground nodes, then called sinks, to be reached from some of the non-ground nodes. We regard such networks as representative of abstract systems of partially ordered constituents, for example in some of the domains related to technological evolution. Two properties of interest are the number of sinks that can be reached from a randomly chosen non-ground node (its reach) and, for a fixed sink, the number of nonoverlapping directed paths through which the sink can be reached, at a given time, from some of the latest nodes to have entered the network. We demonstrate, by means of simulations and also of analytic characterizations, that reaches are distributed according to a power law and that the desired directed paths are expected to occur in very small numbers, perhaps indicating that recovering sinks late in the process of network growth is strongly sensitive to accidental path disruptions.

Suggested Citation

  • Barbosa, Valmir C., 2008. "Reachability and recoverability of sink nodes in growing acyclic directed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(2), pages 685-693.
    • Handle: RePEc:eee:phsmap:v:387:y:2008:i:2:p:685-693
    DOI: 10.1016/j.physa.2007.09.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437107009880
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2007.09.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 2000. "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 281(1), pages 69-77.
    2. Barbosa, Valmir C & Donangelo, Raul & Souza, Sergio R, 2003. "Directed cycles and related structures in random graphs: I—Static properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 321(3), pages 381-397.
    3. Barbosa, Valmir C. & Donangelo, Raul & Souza, Sergio R., 2004. "Directed cycles and related structures in random graphs: II—Dynamic properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 334(3), pages 566-582.
    4. L. Kullmann & J. Kertesz & K. Kaski, 2002. "Time dependent cross correlations between different stock returns: A directed network of influence," Papers cond-mat/0203256, arXiv.org, revised May 2002.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhao, Star X. & Rousseau, Ronald & Ye, Fred Y., 2011. "h-Degree as a basic measure in weighted networks," Journal of Informetrics, Elsevier, vol. 5(4), pages 668-677.
    2. Lyócsa, Štefan & Výrost, Tomáš & Baumöhl, Eduard, 2019. "Return spillovers around the globe: A network approach," Economic Modelling, Elsevier, vol. 77(C), pages 133-146.
    3. Cirkovic, Daniel & Wang, Tiandong & Cline, Daren B.H., 2025. "Emergence of multivariate extremes in multilayer inhomogeneous random graphs," Stochastic Processes and their Applications, Elsevier, vol. 190(C).
    4. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    5. Giacomello, Giampiero & Picci, Lucio, 2003. "My scale or your meter? Evaluating methods of measuring the Internet," Information Economics and Policy, Elsevier, vol. 15(3), pages 363-383, September.
    6. Ormerod, Paul & Roach, Andrew P, 2004. "The Medieval inquisition: scale-free networks and the suppression of heresy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 339(3), pages 645-652.
    7. Maharaj, Elizabeth Ann & D’Urso, Pierpaolo, 2010. "A coherence-based approach for the pattern recognition of time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(17), pages 3516-3537.
    8. Dangalchev, Chavdar, 2004. "Generation models for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(3), pages 659-671.
    9. Castagna, Alina & Chentouf, Leila & Ernst, Ekkehard, 2017. "Economic vulnerabilities in Italy: A network analysis using similarities in sectoral employment," GLO Discussion Paper Series 50, Global Labor Organization (GLO).
    10. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Resources Flows Asymmetries in Strict Nash Networks with Partner Heterogeneity," Working Papers 1108, Groupe d'Analyse et de Théorie Economique Lyon St-Etienne (GATE Lyon St-Etienne), Université de Lyon.
    11. Stefan Rass, 2021. "Judging the quality of (fake) news on the internet," Mind & Society: Cognitive Studies in Economics and Social Sciences, Springer;Fondazione Rosselli, vol. 20(1), pages 129-133, June.
    12. S Konini & E J Janse van Rensburg, 2017. "Mean field analysis of algorithms for scale-free networks in molecular biology," PLOS ONE, Public Library of Science, vol. 12(12), pages 1-34, December.
    13. Thang N. Dinh & Nam P. Nguyen & Md Abdul Alim & My T. Thai, 2015. "A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 747-767, October.
    14. Pandey, Pradumn Kumar & Badarla, Venkataramana, 2018. "Reconstruction of network topology using status-time-series data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 573-583.
    15. Justo Puerto & Moises Rodr'iguez-Madrena & Andrea Scozzari, 2019. "Location and portfolio selection problems: A unified framework," Papers 1907.07101, arXiv.org.
    16. Mahendra Piraveenan & Mikhail Prokopenko & Liaquat Hossain, 2013. "Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks," PLOS ONE, Public Library of Science, vol. 8(1), pages 1-14, January.
    17. Hosseini, Seyed Soheil & Wormald, Nick & Tian, Tianhai, 2021. "A Weight-based Information Filtration Algorithm for Stock-correlation Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    18. Arthur Matsuo Yamashita Rios de Sousa & Hideki Takayasu & Misako Takayasu, 2017. "Detection of statistical asymmetries in non-stationary sign time series: Analysis of foreign exchange data," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-18, May.
    19. Fetta, Angelico & Harper, Paul & Knight, Vincent & Williams, Janet, 2018. "Predicting adolescent social networks to stop smoking in secondary schools," European Journal of Operational Research, Elsevier, vol. 265(1), pages 263-276.
    20. Balabhaskar Balasundaram & Sergiy Butenko & Illya V. Hicks, 2011. "Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem," Operations Research, INFORMS, vol. 59(1), pages 133-142, February.

    More about this item

    Keywords

    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:387:y:2008:i:2:p:685-693. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.