On the performance of randomized embedding of reproduction trees in static networks
type: Item
instance of: scholarly article
title: On the performance of randomized embedding of reproduction trees in static networks
zbMATH Open document ID: 1074.68005
DOI: 10.1023/A:1027336712552
author: Keqin Li
published in: International Journal of Parallel Programming
publication date: 2004-09-09T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 2100096
zbMATH Keywords: dynamic load distribution
zbMATH Keywords: randomized tree embedding
zbMATH Keywords: reproduction tree
zbMATH Keywords: static network
MaRDI profile type: Publication
Recommended article: Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
Recommended article: Embedding Spanning Trees in Random Graphs
Recommended article: Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
Recommended article: On Generating Random Network Structures: Trees
Recommended article: Lower bounds for dynamic tree embedding in bipartite networks
Recommended article: Stochastic comparisons for rooted butterfly networks and tree networks, with random environments
Recommended article: Combinatorial and stochastic properties of ranked tree‐child networks
Recommended article: The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks
Recommended article: Reproduction numbers for epidemics on networks using pair approximation
description: scientific article; zbMATH DE number 2100096