| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Infinite limits and folding
Abstract : 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.
Cited literature [10 references]
https://hal.inria.fr/hal-01184367
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, August 14, 2015 - 11:37:46 AM
Last modification on : Thursday, May 11, 2017 - 1:03:06 AM
Long-term archiving on: : Sunday, November 15, 2015 - 11:01:56 AM
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, August 14, 2015 - 11:37:46 AM
Last modification on : Thursday, May 11, 2017 - 1:03:06 AM
Long-term archiving on: : Sunday, November 15, 2015 - 11:01:56 AM
File
dmAE0144.pdf
Publisher files allowed on an open archive