Advanced search

Filter By:

Journal Check one or more journals to show results from those journals only.

Choose more journals

Article type Check one or more article types to show results from those article types only.
Subject Check one or more subjects to show results from those subjects only.
Date Choose a date option to show results from those dates only.

Custom date range

Clear all filters
Sort by:
Showing 1–7 of 7 results
Advanced filters: Author: Maksim Kitsak Clear advanced filters

  • Shortest paths between the nodes of complex networks are challenging to obtain if the information on network structure is incomplete. Here the authors show that the shortest paths are geometrically localized in hyperbolic representations of networks, and can be detected even if the large amount of network links are missing. The authors demonstrate the utility of geometric pathfinding in Internet routing and the reconstruction of cellular pathways.

    • Maksim Kitsak
    • Alexander Ganin
    • Igor Linkov
    ResearchOpen Access
    Nature Communications
    Volume: 14, P: 1-9

  • A framework is developed in which new connections to a growing network optimize geometric trade-offs between popularity and similarity, instead of simply preferring popular nodes; this approach accurately describes the large-scale evolution of various networks.

    • Fragkiskos Papadopoulos
    • Maksim Kitsak
    • Dmitri Krioukov
    Research
    Nature
    Volume: 489, P: 537-540

  • Spreading of information, ideas or diseases can be conveniently modelled in the context of complex networks. An analysis now reveals that the most efficient spreaders are not always necessarily the most connected agents in a network. Instead, the position of an agent relative to the hierarchical topological organization of the network might be as important as its connectivity.

    • Maksim Kitsak
    • Lazaros K. Gallos
    • Hernán A. Makse
    Research
    Nature Physics
    Volume: 6, P: 888-893

    • Dmitri Krioukov
    • Maksim Kitsak
    • Marián Boguñá
    ResearchOpen Access
    Scientific Reports
    Volume: 2, P: 1-6