Max-min controllability in pursuit games with norm-bounded controls

1982 ◽  
Vol 37 (1) ◽  
pp. 89-113
Author(s):  
W. L. Chan ◽  
C. W. Li
Keyword(s):  
Pursuit Games ◽  
Bounded Controls

scholarly journals Infinite limits and folding

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Anthony Bonato ◽  
Jeannette Janssen
Keyword(s):  
Biological Networks ◽  
Infinite Graphs ◽  
Isomorphism Type ◽  
Connected Component ◽  
Induced Subgraph ◽  
Pursuit Games ◽  
Graph Homomorphisms ◽  
International Audience

International audience We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic graphs which arise naturally from the model. We characterize the isomorphism type and induced subgraph structure of these infinite graphs using the notion of dismantlability from the theory of vertex pursuit games, and graph homomorphisms.

Sign in / Sign up

Export Citation Format

Share Document