Infinite limits and folding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAE0144.pdf (146.9 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184367 , version 1 (14-08-2015)

Identifiers

Cite

Anthony Bonato, Jeannette Janssen. Infinite limits and folding. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.223-228, ⟨10.46298/dmtcs.3410⟩. ⟨hal-01184367⟩

Collections

TDS-MACS
48 View
526 Download

Altmetric

Share

Gmail Facebook X LinkedIn More