Hunting for dual-target set on a class of hierarchical networks

Moein Khajehnejad, Forough Habibollahi

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch


In the past decades, complex networks have proved to be an exceedingly powerful and efficacious tool for describing a wide range of systems in nature and society. Thereafter, random search processes, as an effective and informative way of exploring these networks, have attracted considerable attention towards them. In this work, we study the problem of partial cover time in a dual-target search when performing a random walk on a (1,2)-flower network. For the first time, we derive an exact expression for the partial cover time of a random searcher on such a network to hunt both target nodes of interest. The introduced formula for calculating this quantity outranks previous work in the sense that it can be conveniently applied to general types of networks. Utilizing this expression can introduce a pivotal change for efficiently solving the problem of partial cover time in its wide range of applicable fields.

Original languageEnglish
Title of host publicationNetwork Science - 7th International Winter Conference, NetSci-X 2022 Porto, Portugal, February 8–11, 2022 Proceedings
EditorsPedro Ribeiro, Fernando Silva, José Fernando Mendes, Rosário Laureano
Place of PublicationCham Switzerland
Number of pages18
ISBN (Electronic)9783030972400
ISBN (Print)9783030972394
Publication statusPublished - 2022
EventInternational Conference and School of Network Science 2022 - Porto, Portugal
Duration: 25 Jul 202229 Jul 2022
Conference number: 7th (Proceedings) (Website)

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference and School of Network Science 2022
Abbreviated titleNetSci-X 2022
Internet address


  • Dual-target Search
  • Mean First Passage Time
  • Partial Cover Time
  • Probability Generating Function
  • Pseudofractal Scale-free Web

Cite this