Infinite limits and folding
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
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.
1999 ◽
Vol Vol. 3 no. 4
◽
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2011 ◽
Vol Vol. 13 no. 2
(Graph and Algorithms)
◽
2009 ◽
Vol Vol. 11 no. 1
(Graph and Algorithms)
◽
Keyword(s):
2003 ◽
Vol DMTCS Proceedings vol. AC,...
(Proceedings)
◽
2013 ◽
Vol Vol. 15 no. 1
(Graph and Algorithms)
◽
Keyword(s):
Keyword(s):
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽
Keyword(s):
2003 ◽
Vol DMTCS Proceedings vol. AC,...
(Proceedings)
◽