Vertex pursuit in random directed acyclic graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2013

Vertex pursuit in random directed acyclic graphs

Dieter Mitsche
  • Fonction : Auteur
  • PersonId : 949371
Pawel Pralat
  • Fonction : Auteur
  • PersonId : 950365

Résumé

We examine a dynamic model for the disruption of information flow in hierarchical social networks by considering the vertex-pursuit game Seepage played in directed acyclic graphs (DAGs). In Seepage, agents attempt to block the movement of an intruder who moves downward from the source node to a sink. The minimum number of such agents required to block the intruder is called the green number. We propose a generalized stochastic model for DAGs with given expected total degree sequence. Seepage and the green number is analyzed in stochastic DAGs in both the cases of a regular and power law degree sequence. For each such sequence, we give asymptotic bounds (and in certain instances, precise values) for the green number.
Fichier principal
Vignette du fichier
VertexPursuit.pdf (363.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00923080 , version 1 (02-01-2014)

Identifiants

  • HAL Id : hal-00923080 , version 1

Citer

Anthony Bonato, Dieter Mitsche, Pawel Pralat. Vertex pursuit in random directed acyclic graphs. SIAM Journal on Discrete Mathematics, 2013, 27 (2), pp.732--756. ⟨hal-00923080⟩
117 Consultations
144 Téléchargements

Partager

Gmail Facebook X LinkedIn More