Indexing metadata

Noninvadability implies noncoexistence for a class of cancellative systems


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document Noninvadability implies noncoexistence for a class of cancellative systems
 
2. Creator Author's name, affiliation, country Jan M. Swart; Institute of Information Theory and Automation of the ASCR (UTIA); Czech Republic
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) Cancellative system ; interface tightness ; duality, coexistence ; Neuhauser-Pacala model ; affine voter model ; rebellious voter model ; balancing selection ; branching ; annihilation ; parity preservation
 
3. Subject Subject classification Primary: 82C22; Secondary: 60K35, 92D25, 82C24
 
4. Description Abstract There exist a number of results proving that for certain classes of interacting particle systems in population genetics, mutual invadability of types implies coexistence. In this paper we prove a sort of converse statement for a class of one-dimensional cancellative systems that are used to model balancing selection. We say that a model exhibits strong interface tightness if started from a configuration where to the left of the origin all sites are of one type and to the right of the origin all sites are of the other type, the configuration as seen from the interface has an invariant law in which the number of sites where both types meet has finite expectation. We prove that this implies noncoexistence, i.e., all invariant laws of the process are concentrated on the constant configurations. The proof is based on special relations between dual and interface models that hold for a large class of one-dimensional cancellative systems and that are proved here for the first time.
 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s) Work sponsored by GAČR grant: P201/10/0752.
 
7. Date (YYYY-MM-DD) 2013-05-23
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://ecp.ejpecp.org/article/view/2471
 
10. Identifier Digital Object Identifier 10.1214/ECP.v18-2471
 
11. Source Journal/conference title; vol., no. (year) Electronic Communications in Probability; Vol 18
 
12. Language English=en en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.

Summary of the Creative Commons Attribution License

You are free
  • to copy, distribute, display, and perform the work
  • to make derivative works
  • to make commercial use of the work
under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.