---
_id: '9712'
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Tugrul M, Paixao T, Barton NH, Tkačik G. Other fitness models for comparison
& for interacting TFBSs. 2015. doi:10.1371/journal.pgen.1005639.s001
apa: Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Other fitness
models for comparison & for interacting TFBSs. Public Library of Science.
https://doi.org/10.1371/journal.pgen.1005639.s001
chicago: Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Other
Fitness Models for Comparison & for Interacting TFBSs.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.s001.
ieee: M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Other fitness models for
comparison & for interacting TFBSs.” Public Library of Science, 2015.
ista: Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Other fitness models for comparison
& for interacting TFBSs, Public Library of Science, 10.1371/journal.pgen.1005639.s001.
mla: Tugrul, Murat, et al. Other Fitness Models for Comparison & for Interacting
TFBSs. Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.s001.
short: M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, (2015).
date_created: 2021-07-23T12:00:37Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2025-09-23T08:31:14Z
day: '06'
department:
- _id: NiBa
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pgen.1005639.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1666'
relation: used_in_publication
status: public
status: public
title: Other fitness models for comparison & for interacting TFBSs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9714'
article_processing_charge: No
author:
- first_name: Àngel
full_name: Gómez Sicilia, Àngel
last_name: Gómez Sicilia
- first_name: Mateusz K
full_name: Sikora, Mateusz K
id: 2F74BCDE-F248-11E8-B48F-1D18A9856A87
last_name: Sikora
- first_name: Marek
full_name: Cieplak, Marek
last_name: Cieplak
- first_name: Mariano
full_name: Carrión Vázquez, Mariano
last_name: Carrión Vázquez
citation:
ama: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of
the universe of polyglutamine structures - submission to PLOS journals. 2015.
doi:10.1371/journal.pcbi.1004541.s001
apa: Gómez Sicilia, À., Sikora, M. K., Cieplak, M., & Carrión Vázquez, M. (2015).
An exploration of the universe of polyglutamine structures - submission to PLOS
journals. Public Library of Science . https://doi.org/10.1371/journal.pcbi.1004541.s001
chicago: Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión
Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission
to PLOS Journals.” Public Library of Science , 2015. https://doi.org/10.1371/journal.pcbi.1004541.s001.
ieee: À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration
of the universe of polyglutamine structures - submission to PLOS journals.” Public
Library of Science , 2015.
ista: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration
of the universe of polyglutamine structures - submission to PLOS journals, Public
Library of Science , 10.1371/journal.pcbi.1004541.s001.
mla: Gómez Sicilia, Àngel, et al. An Exploration of the Universe of Polyglutamine
Structures - Submission to PLOS Journals. Public Library of Science , 2015,
doi:10.1371/journal.pcbi.1004541.s001.
short: À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015).
date_created: 2021-07-23T12:05:28Z
date_published: 2015-10-23T00:00:00Z
date_updated: 2025-09-23T07:52:17Z
day: '23'
department:
- _id: CaHe
doi: 10.1371/journal.pcbi.1004541.s001
month: '10'
oa_version: Published Version
publisher: 'Public Library of Science '
related_material:
record:
- id: '1566'
relation: used_in_publication
status: public
status: public
title: An exploration of the universe of polyglutamine structures - submission to
PLOS journals
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9715'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Mathematical inference of the results. 2015.
doi:10.1371/journal.pone.0126907.s001
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Mathematical inference of
the results. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s001
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Mathematical Inference
of the Results.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s001.
ieee: B. Trubenova, S. Novak, and R. Hager, “Mathematical inference of the results.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Mathematical inference of the results,
Public Library of Science, 10.1371/journal.pone.0126907.s001.
mla: Trubenova, Barbora, et al. Mathematical Inference of the Results. Public
Library of Science, 2015, doi:10.1371/journal.pone.0126907.s001.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-07-23T12:11:30Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2025-09-23T09:21:54Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s001
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Mathematical inference of the results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9718'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Supporting information text. 2015.
doi:10.1371/journal.pcbi.1004055.s001
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Supporting
information text. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s001
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Supporting
Information Text.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s001.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Supporting information
text.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Supporting information text,
Public Library of Science, 10.1371/journal.pcbi.1004055.s001.
mla: Friedlander, Tamar, et al. Supporting Information Text. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s001.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-07-26T08:35:23Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2025-09-23T08:43:16Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s001
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Supporting information text
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9721'
abstract:
- lang: eng
text: To prevent epidemics, insect societies have evolved collective disease defences
that are highly effective at curing exposed individuals and limiting disease transmission
to healthy group members. Grooming is an important sanitary behaviour—either performed
towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious
agents from the body surface of exposed individuals, but at the risk of disease
contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal
pathogen Metarhizium as a model system to study how pathogen presence affects
self-grooming and allogrooming between exposed and healthy individuals. We develop
an epidemiological SIS model to explore how experimentally observed grooming patterns
affect disease spread within the colony, thereby providing a direct link between
the expression and direction of sanitary behaviours, and their effects on colony-level
epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously
decreasing allogrooming. This behavioural modulation seems universally adaptive
and is predicted to contain disease spread in a great variety of host–pathogen
systems. In contrast, allogrooming directed towards pathogen-exposed individuals
might both increase and decrease disease risk. Our model reveals that the effect
of allogrooming depends on the balance between pathogen infectiousness and efficiency
of social host defences, which are likely to vary across host–pathogen systems.
article_processing_charge: No
author:
- first_name: Fabian
full_name: Theis, Fabian
last_name: Theis
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Carsten
full_name: Marr, Carsten
last_name: Marr
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Theis F, Ugelvig LV, Marr C, Cremer S. Data from: Opposing effects of allogrooming
on disease transmission in ant societies. 2015. doi:10.5061/dryad.dj2bf'
apa: 'Theis, F., Ugelvig, L. V., Marr, C., & Cremer, S. (2015). Data from: Opposing
effects of allogrooming on disease transmission in ant societies. Dryad. https://doi.org/10.5061/dryad.dj2bf'
chicago: 'Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Data
from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.”
Dryad, 2015. https://doi.org/10.5061/dryad.dj2bf.'
ieee: 'F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Data from: Opposing effects
of allogrooming on disease transmission in ant societies.” Dryad, 2015.'
ista: 'Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Data from: Opposing effects
of allogrooming on disease transmission in ant societies, Dryad, 10.5061/dryad.dj2bf.'
mla: 'Theis, Fabian, et al. Data from: Opposing Effects of Allogrooming on Disease
Transmission in Ant Societies. Dryad, 2015, doi:10.5061/dryad.dj2bf.'
short: F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, (2015).
date_created: 2021-07-26T09:38:36Z
date_published: 2015-12-29T00:00:00Z
date_updated: 2025-09-23T09:44:52Z
day: '29'
department:
- _id: SyCr
doi: 10.5061/dryad.dj2bf
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.dj2bf
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1830'
relation: used_in_publication
status: public
status: public
title: 'Data from: Opposing effects of allogrooming on disease transmission in ant
societies'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9737'
article_processing_charge: No
author:
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
- first_name: Christopher
full_name: Topp, Christopher
last_name: Topp
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for
the maize root shown in fig 2. 2015. doi:10.1371/journal.pone.0127657.s001
apa: Symonova, O., Topp, C., & Edelsbrunner, H. (2015). Root traits computed
by DynamicRoots for the maize root shown in fig 2. Public Library of Science.
https://doi.org/10.1371/journal.pone.0127657.s001
chicago: Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits
Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pone.0127657.s001.
ieee: O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots
for the maize root shown in fig 2.” Public Library of Science, 2015.
ista: Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots
for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.
mla: Symonova, Olga, et al. Root Traits Computed by DynamicRoots for the Maize
Root Shown in Fig 2. Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.s001.
short: O. Symonova, C. Topp, H. Edelsbrunner, (2015).
date_created: 2021-07-28T06:20:13Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-09-23T08:30:43Z
day: '01'
department:
- _id: MaJö
- _id: HeEd
doi: 10.1371/journal.pone.0127657.s001
month: '06'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1793'
relation: used_in_publication
status: public
status: public
title: Root traits computed by DynamicRoots for the maize root shown in fig 2
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9742'
abstract:
- lang: eng
text: 'Repeated pathogen exposure is a common threat in colonies of social insects,
posing selection pressures on colony members to respond with improved disease-defense
performance. We here tested whether experience gained by repeated tending of low-level
fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary
brood care in the clonal ant, Platythyrea punctata. We trained ants individually
over nine consecutive trials to either sham-treated or fungus-exposed larvae.
We then compared the larval grooming behavior of naive and trained ants and measured
how effectively they removed infectious fungal conidiospores from the fungus-exposed
larvae. We found that the ants changed the duration of larval grooming in response
to both, larval treatment and their level of experience: (1) sham-treated larvae
received longer grooming than the fungus-exposed larvae and (2) trained ants performed
less self-grooming but longer larval grooming than naive ants, which was true
for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants
that groomed the fungus-exposed larvae for longer periods removed a higher number
of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced
ants performed longer larval grooming, they were more effective in fungal removal,
thus making them better caretakers under pathogen attack of the colony. By studying
this clonal ant, we can thus conclude that even in the absence of genetic variation
between colony members, differences in experience levels of brood care may affect
performance of sanitary brood care in social insects.'
article_processing_charge: No
author:
- first_name: Claudia
full_name: Westhus, Claudia
last_name: Westhus
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Edouard
full_name: Tourdot, Edouard
last_name: Tourdot
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Claudie
full_name: Doums, Claudie
last_name: Doums
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Data from:
Increased grooming after repeated brood care provides sanitary benefits in a clonal
ant. 2015. doi:10.5061/dryad.7kc79'
apa: 'Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., & Cremer,
S. (2015). Data from: Increased grooming after repeated brood care provides sanitary
benefits in a clonal ant. Dryad. https://doi.org/10.5061/dryad.7kc79'
chicago: 'Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie
Doums, and Sylvia Cremer. “Data from: Increased Grooming after Repeated Brood
Care Provides Sanitary Benefits in a Clonal Ant.” Dryad, 2015. https://doi.org/10.5061/dryad.7kc79.'
ieee: 'C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer,
“Data from: Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant.” Dryad, 2015.'
ista: 'Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2015. Data
from: Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant, Dryad, 10.5061/dryad.7kc79.'
mla: 'Westhus, Claudia, et al. Data from: Increased Grooming after Repeated Brood
Care Provides Sanitary Benefits in a Clonal Ant. Dryad, 2015, doi:10.5061/dryad.7kc79.'
short: C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, (2015).
date_created: 2021-07-28T08:52:53Z
date_published: 2015-07-09T00:00:00Z
date_updated: 2025-09-29T11:42:25Z
day: '09'
department:
- _id: SyCr
doi: 10.5061/dryad.7kc79
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.7kc79
month: '07'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2161'
relation: used_in_publication
status: public
status: public
title: 'Data from: Increased grooming after repeated brood care provides sanitary
benefits in a clonal ant'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9765'
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay Hazal
full_name: Ayhan, Dilay Hazal
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Gene ontology enrichment analysis
for the most sensitive gene deletion strains for all drugs. 2015. doi:10.1371/journal.pbio.1002299.s008
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak,
E., & Bollenbach, M. T. (2015). Gene ontology enrichment analysis for the
most sensitive gene deletion strains for all drugs. Public Library of Science.
https://doi.org/10.1371/journal.pbio.1002299.s008
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Gene Ontology Enrichment
Analysis for the Most Sensitive Gene Deletion Strains for All Drugs.” Public Library
of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s008.
ieee: G. Chevereau et al., “Gene ontology enrichment analysis for the most
sensitive gene deletion strains for all drugs.” Public Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach
MT. 2015. Gene ontology enrichment analysis for the most sensitive gene deletion
strains for all drugs, Public Library of Science, 10.1371/journal.pbio.1002299.s008.
mla: Chevereau, Guillaume, et al. Gene Ontology Enrichment Analysis for the Most
Sensitive Gene Deletion Strains for All Drugs. Public Library of Science,
2015, doi:10.1371/journal.pbio.1002299.s008.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak,
M.T. Bollenbach, (2015).
date_created: 2021-08-03T07:05:16Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2025-09-23T09:58:54Z
day: '18'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299.s008
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1619'
relation: used_in_publication
status: public
status: public
title: Gene ontology enrichment analysis for the most sensitive gene deletion strains
for all drugs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9772'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Description of the agent based simulations.
2015. doi:10.1371/journal.pone.0126907.s003
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Description of the agent
based simulations. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s003
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of
the Agent Based Simulations.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s003.
ieee: B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations,
Public Library of Science, 10.1371/journal.pone.0126907.s003.
mla: Trubenova, Barbora, et al. Description of the Agent Based Simulations.
Public Library of Science, 2015, doi:10.1371/journal.pone.0126907.s003.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-08-05T12:55:20Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2025-09-23T09:21:54Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s003
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Description of the agent based simulations
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9773'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Evolutionary simulation code. 2015.
doi:10.1371/journal.pcbi.1004055.s002
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Evolutionary
simulation code. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s002
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Evolutionary
Simulation Code.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s002.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation
code.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Evolutionary simulation code,
Public Library of Science, 10.1371/journal.pcbi.1004055.s002.
mla: Friedlander, Tamar, et al. Evolutionary Simulation Code. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s002.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-08-05T12:58:07Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2025-09-23T08:43:16Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s002
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Evolutionary simulation code
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '981'
abstract:
- lang: eng
text: The tunability of topological surface states and controllable opening of the
Dirac gap are of fundamental and practical interest in the field of topological
materials. In the newly discovered topological crystalline insulators (TCIs),
theory predicts that the Dirac node is protected by a crystalline symmetry and
that the surface state electrons can acquire a mass if this symmetry is broken.
Recent studies have detected signatures of a spontaneously generated Dirac gap
in TCIs; however, the mechanism of mass formation remains elusive. In this work,
we present scanning tunnelling microscopy (STM) measurements of the TCI Pb 1â'x
Sn x Se for a wide range of alloy compositions spanning the topological and non-topological
regimes. The STM topographies reveal a symmetry-breaking distortion on the surface,
which imparts mass to the otherwise massless Dirac electrons-a mechanism analogous
to the long sought-after Higgs mechanism in particle physics. Interestingly, the
measured Dirac gap decreases on approaching the trivial phase, whereas the magnitude
of the distortion remains nearly constant. Our data and calculations reveal that
the penetration depth of Dirac surface states controls the magnitude of the Dirac
mass. At the limit of the critical composition, the penetration depth is predicted
to go to infinity, resulting in zero mass, consistent with our measurements. Finally,
we discover the existence of surface states in the non-topological regime, which
have the characteristics of gapped, double-branched Dirac fermions and could be
exploited in realizing superconductivity in these materials.
acknowledgement: We thank R. Buczko, C. Chamon, J. C. Seamus Davis, M. El-Batanouny,
A. Mesaros, Y. Ran and A. Soumyanarayanan for useful conversations and G. McMahon
for help with EDS measurements. V.M. gratefully acknowledges funding from the US
Department of Energy, Scanned Probe Division under Award Number DE-FG02-12ER46880
for the support of I.Z., Y.O., W.Z. and D.W. for this project. Work at Massachusetts
Institute of Technology is supported by US Department of Energy, Office of Basic
Energy Sciences, Division of Materials Sciences and Engineering under Award DE-SC0010526
(L.F.), and NSF-DMR-1104498 (M.S.). H.L. acknowledges the Singapore National Research
Foundation for support under NRF Award No. NRF-NRFF2013-03. Y.O. was partly supported
by JSPS KAKENHI Grant Numbers 26707016 and 00707656. The work at Northeastern University
is supported by the US Department of Energy grant number DE-FG02-07ER46352, and
benefited from Northeastern University’s Advanced Scientific Computation Center
(ASCC), theory support at the Advanced Light Source, Berkeley and the allocation
of supercomputer time at the NERSC through DOE grant number DE-AC02-05CH11231. Work
at Princeton University is supported by the US National Science Foundation Grant,
NSF-DMR-1006492. F.C. acknowledges the support provided by MOST-Taiwan under project
number NSC-102-2119-M-002-004.
author:
- first_name: Ilija
full_name: Zeljkovic, Ilija
last_name: Zeljkovic
- first_name: Yoshinori
full_name: Okada, Yoshinori
last_name: Okada
- first_name: Maksym
full_name: Maksym Serbyn
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Raman
full_name: Sankar, Raman
last_name: Sankar
- first_name: Daniel
full_name: Walkup, Daniel
last_name: Walkup
- first_name: Wenwen
full_name: Zhou, Wenwen
last_name: Zhou
- first_name: Junwei
full_name: Liu, Junwei
last_name: Liu
- first_name: Guoqing
full_name: Chang, Guoqing
last_name: Chang
- first_name: Yungjui
full_name: Wang, Yungjui
last_name: Wang
- first_name: Md
full_name: Hasan, Md Z
last_name: Hasan
- first_name: Fangcheng
full_name: Chou, Fangcheng
last_name: Chou
- first_name: Hsin
full_name: Lin, Hsin
last_name: Lin
- first_name: Arun
full_name: Bansil, Arun
last_name: Bansil
- first_name: Liang
full_name: Fu, Liang
last_name: Fu
- first_name: Vidya
full_name: Madhavan, Vidya
last_name: Madhavan
citation:
ama: Zeljkovic I, Okada Y, Serbyn M, et al. Dirac mass generation from crystal symmetry
breaking on the surfaces of topological crystalline insulators. Nature Materials.
2015;14(3):318-324. doi:10.1038/nmat4215
apa: Zeljkovic, I., Okada, Y., Serbyn, M., Sankar, R., Walkup, D., Zhou, W., … Madhavan,
V. (2015). Dirac mass generation from crystal symmetry breaking on the surfaces
of topological crystalline insulators. Nature Materials. Nature Publishing
Group. https://doi.org/10.1038/nmat4215
chicago: Zeljkovic, Ilija, Yoshinori Okada, Maksym Serbyn, Raman Sankar, Daniel
Walkup, Wenwen Zhou, Junwei Liu, et al. “Dirac Mass Generation from Crystal Symmetry
Breaking on the Surfaces of Topological Crystalline Insulators.” Nature Materials.
Nature Publishing Group, 2015. https://doi.org/10.1038/nmat4215.
ieee: I. Zeljkovic et al., “Dirac mass generation from crystal symmetry breaking
on the surfaces of topological crystalline insulators,” Nature Materials,
vol. 14, no. 3. Nature Publishing Group, pp. 318–324, 2015.
ista: Zeljkovic I, Okada Y, Serbyn M, Sankar R, Walkup D, Zhou W, Liu J, Chang G,
Wang Y, Hasan M, Chou F, Lin H, Bansil A, Fu L, Madhavan V. 2015. Dirac mass generation
from crystal symmetry breaking on the surfaces of topological crystalline insulators.
Nature Materials. 14(3), 318–324.
mla: Zeljkovic, Ilija, et al. “Dirac Mass Generation from Crystal Symmetry Breaking
on the Surfaces of Topological Crystalline Insulators.” Nature Materials,
vol. 14, no. 3, Nature Publishing Group, 2015, pp. 318–24, doi:10.1038/nmat4215.
short: I. Zeljkovic, Y. Okada, M. Serbyn, R. Sankar, D. Walkup, W. Zhou, J. Liu,
G. Chang, Y. Wang, M. Hasan, F. Chou, H. Lin, A. Bansil, L. Fu, V. Madhavan, Nature
Materials 14 (2015) 318–324.
date_created: 2018-12-11T11:49:31Z
date_published: 2015-03-01T00:00:00Z
date_updated: 2021-01-12T08:22:24Z
day: '01'
doi: 10.1038/nmat4215
extern: 1
intvolume: ' 14'
issue: '3'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1403.4906
month: '03'
oa: 1
page: 318 - 324
publication: Nature Materials
publication_status: published
publisher: Nature Publishing Group
publist_id: '6419'
quality_controlled: 0
status: public
title: Dirac mass generation from crystal symmetry breaking on the surfaces of topological
crystalline insulators
type: journal_article
volume: 14
year: '2015'
...
---
_id: '473'
abstract:
- lang: eng
text: We prove that nonlinear Gibbs measures can be obtained from the corresponding
many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where
the temperature T diverges and the interaction strength behaves as 1/T. We proceed
by characterizing the interacting Gibbs state as minimizing a functional counting
the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional
analogue of phase-space semiclassical analysis, using fine properties of the quantum
relative entropy, the link between quantum de Finetti measures and upper/lower
symbols in a coherent state basis, as well as Berezin-Lieb type inequalities.
Our results cover the measure built on the defocusing nonlinear Schrödinger functional
on a finite interval, as well as smoother interactions in dimensions d 2.
author:
- first_name: Mathieu
full_name: Lewin, Mathieu
last_name: Lewin
- first_name: Nam
full_name: Phan Thanh, Nam
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Phan Thanh
- first_name: Nicolas
full_name: Rougerie, Nicolas
last_name: Rougerie
citation:
ama: Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body
quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2015;2:65-115.
doi:10.5802/jep.18
apa: Lewin, M., Nam, P., & Rougerie, N. (2015). Derivation of nonlinear gibbs
measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique
- Mathematiques. Ecole Polytechnique. https://doi.org/10.5802/jep.18
chicago: Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear
Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique
- Mathematiques. Ecole Polytechnique, 2015. https://doi.org/10.5802/jep.18.
ieee: M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures
from many-body quantum mechanics,” Journal de l’Ecole Polytechnique - Mathematiques,
vol. 2. Ecole Polytechnique, pp. 65–115, 2015.
ista: Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from
many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques.
2, 65–115.
mla: Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body
Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques, vol.
2, Ecole Polytechnique, 2015, pp. 65–115, doi:10.5802/jep.18.
short: M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques
2 (2015) 65–115.
date_created: 2018-12-11T11:46:40Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T08:00:52Z
day: '01'
ddc:
- '539'
department:
- _id: RoSe
doi: 10.5802/jep.18
ec_funded: 1
file:
- access_level: open_access
checksum: a40eb4016717ddc9927154798a4c164a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:53Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4974'
file_name: IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf
file_size: 1084254
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 65 - 115
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal de l'Ecole Polytechnique - Mathematiques
publication_status: published
publisher: Ecole Polytechnique
publist_id: '7344'
pubrep_id: '951'
quality_controlled: '1'
scopus_import: 1
status: public
title: Derivation of nonlinear gibbs measures from many-body quantum mechanics
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '477'
abstract:
- lang: eng
text: Dendritic cells are potent antigen-presenting cells endowed with the unique
ability to initiate adaptive immune responses upon inflammation. Inflammatory
processes are often associated with an increased production of serotonin, which
operates by activating specific receptors. However, the functional role of serotonin
receptors in regulation of dendritic cell functions is poorly understood. Here,
we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as
its downstream effector Cdc42 is upregulated in dendritic cells upon maturation.
Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation
affected dendritic cell morphology through Cdc42-mediated signaling. In addition,
basal activity of 5-HT7TR was required for the proper expression of the chemokine
receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent
with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic
cells in vitro by modulating their directionality and migration velocity. Accordingly,
migration of dendritic cells in murine colon explants was abolished after pharmacological
receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated
signaling in the regulation of dendritic cell morphology and motility, suggesting
that 5-HT7TR could be a new target for treatment of a variety of inflammatory
and immune disorders.
article_processing_charge: No
author:
- first_name: Katrin
full_name: Holst, Katrin
last_name: Holst
- first_name: Daria
full_name: Guseva, Daria
last_name: Guseva
- first_name: Susann
full_name: Schindler, Susann
last_name: Schindler
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Armin
full_name: Braun, Armin
last_name: Braun
- first_name: Himpriya
full_name: Chopra, Himpriya
last_name: Chopra
- first_name: Oliver
full_name: Pabst, Oliver
last_name: Pabst
- first_name: Evgeni
full_name: Ponimaskin, Evgeni
last_name: Ponimaskin
citation:
ama: Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates
the morphology and migratory properties of dendritic cells. Journal of Cell
Science. 2015;128(15):2866-2880. doi:10.1242/jcs.167999
apa: Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., …
Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology
and migratory properties of dendritic cells. Journal of Cell Science. Company
of Biologists. https://doi.org/10.1242/jcs.167999
chicago: Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun,
Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor
5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.”
Journal of Cell Science. Company of Biologists, 2015. https://doi.org/10.1242/jcs.167999.
ieee: K. Holst et al., “The serotonin receptor 5-HT7R regulates the morphology
and migratory properties of dendritic cells,” Journal of Cell Science,
vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.
ista: Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin
E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory
properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.
mla: Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology
and Migratory Properties of Dendritic Cells.” Journal of Cell Science,
vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:10.1242/jcs.167999.
short: K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst,
E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.
date_created: 2018-12-11T11:46:41Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2025-09-23T14:16:38Z
day: '15'
department:
- _id: MiSi
doi: 10.1242/jcs.167999
external_id:
isi:
- '000359782100013'
intvolume: ' 128'
isi: 1
issue: '15'
language:
- iso: eng
month: '06'
oa_version: None
page: 2866 - 2880
publication: Journal of Cell Science
publication_status: published
publisher: Company of Biologists
publist_id: '7343'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The serotonin receptor 5-HT7R regulates the morphology and migratory properties
of dendritic cells
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 128
year: '2015'
...
---
_id: '523'
abstract:
- lang: eng
text: We consider two-player games played on weighted directed graphs with mean-payoff
and total-payoff objectives, two classical quantitative objectives. While for
single-dimensional games the complexity and memory bounds for both objectives
coincide, we show that in contrast to multi-dimensional mean-payoff games that
are known to be coNP-complete, multi-dimensional total-payoff games are undecidable.
We introduce conservative approximations of these objectives, where the payoff
is considered over a local finite window sliding along a play, instead of the
whole play. For single dimension, we show that (i) if the window size is polynomial,
deciding the winner takes polynomial time, and (ii) the existence of a bounded
window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff
games. For multiple dimensions, we show that (i) the problem with fixed window
size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to
decide the existence of a bounded window.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff
through windows. Information and Computation. 2015;242(6):25-52. doi:10.1016/j.ic.2015.03.010
apa: Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at
mean-payoff and total-payoff through windows. Information and Computation.
Elsevier. https://doi.org/10.1016/j.ic.2015.03.010
chicago: Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin.
“Looking at Mean-Payoff and Total-Payoff through Windows.” Information and
Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.
ieee: K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff
and total-payoff through windows,” Information and Computation, vol. 242,
no. 6. Elsevier, pp. 25–52, 2015.
ista: Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and
total-payoff through windows. Information and Computation. 242(6), 25–52.
mla: Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through
Windows.” Information and Computation, vol. 242, no. 6, Elsevier, 2015,
pp. 25–52, doi:10.1016/j.ic.2015.03.010.
short: K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation
242 (2015) 25–52.
date_created: 2018-12-11T11:46:57Z
date_published: 2015-03-24T00:00:00Z
date_updated: 2025-09-23T09:29:55Z
day: '24'
department:
- _id: KrCh
doi: 10.1016/j.ic.2015.03.010
ec_funded: 1
external_id:
arxiv:
- '1302.4248'
isi:
- '000355664900003'
intvolume: ' 242'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1302.4248
month: '03'
oa: 1
oa_version: Preprint
page: 25 - 52
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '7296'
quality_controlled: '1'
related_material:
record:
- id: '2279'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Looking at mean-payoff and total-payoff through windows
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 242
year: '2015'
...
---
_id: '524'
abstract:
- lang: eng
text: 'We consider concurrent games played by two players on a finite-state graph,
where in every round the players simultaneously choose a move, and the current
state along with the joint moves determine the successor state. We study the most
fundamental objective for concurrent games, namely, mean-payoff or limit-average
objective, where a reward is associated to each transition, and the goal of player
1 is to maximize the long-run average of the rewards, and the objective of player
2 is strictly the opposite (i.e., the games are zero-sum). The path constraint
for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward,
or arbitrarily close to it; or quantitative, i.e., a given threshold between the
minimal and maximal reward. We consider the computation of the almost-sure (resp.
positive) winning sets, where player 1 can ensure that the path constraint is
satisfied with probability 1 (resp. positive probability). Almost-sure winning
with qualitative constraint exactly corresponds to the question of whether there
exists a strategy to ensure that the payoff is the maximal reward of the game.
Our main results for qualitative path constraints are as follows: (1) we establish
qualitative determinacy results that show that for every state either player 1
has a strategy to ensure almost-sure (resp. positive) winning against all player-2
strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp.
positive) winning against all player-1 strategies; (2) we present optimal strategy
complexity results that precisely characterize the classes of strategies required
for almost-sure and positive winning for both players; and (3) we present quadratic
time algorithms to compute the almost-sure and the positive winning sets, matching
the best known bound of the algorithms for much simpler problems (such as reachability
objectives). For quantitative constraints we show that a polynomial time solution
for the almost-sure or the positive winning set would imply a solution to a long-standing
open problem (of solving the value problem of turn-based deterministic mean-payoff
games) that is not known to be solvable in polynomial time.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff
games. Information and Computation. 2015;242(6):2-24. doi:10.1016/j.ic.2015.03.009
apa: Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent
mean payoff games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.009
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis
of Concurrent Mean Payoff Games.” Information and Computation. Elsevier,
2015. https://doi.org/10.1016/j.ic.2015.03.009.
ieee: K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean
payoff games,” Information and Computation, vol. 242, no. 6. Elsevier,
pp. 2–24, 2015.
ista: Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean
payoff games. Information and Computation. 242(6), 2–24.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent
Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier,
2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.
short: K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
corr_author: '1'
date_created: 2018-12-11T11:46:57Z
date_published: 2015-10-11T00:00:00Z
date_updated: 2025-09-23T09:56:28Z
day: '11'
department:
- _id: KrCh
doi: 10.1016/j.ic.2015.03.009
external_id:
arxiv:
- '1409.5306'
isi:
- '000355664900002'
intvolume: ' 242'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.5306
month: '10'
oa: 1
oa_version: Preprint
page: 2 - 24
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '7295'
quality_controlled: '1'
related_material:
record:
- id: '5403'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Qualitative analysis of concurrent mean payoff games
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 242
year: '2015'
...
---
_id: '532'
abstract:
- lang: eng
text: Ethylene is a gaseous phytohormone that plays vital roles in plant growth
and development. Previous studies uncovered EIN2 as an essential signal transducer
linking ethylene perception on ER to transcriptional regulation in the nucleus
through a “cleave and shuttle” model. In this study, we report another mechanism
of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression
of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational
repression and identify multiple poly-uridylates (PolyU) motifs as functional
cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2
to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body
(P-body) through interacting with multiple P-body factors, including EIN5 and
PABs. Our study illustrates translational regulation as a key step in ethylene
signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense
and relay cellular signaling in plants.
article_processing_charge: No
author:
- first_name: Wenyang
full_name: Li, Wenyang
last_name: Li
- first_name: Mengdi
full_name: Ma, Mengdi
last_name: Ma
- first_name: Ying
full_name: Feng, Ying
last_name: Feng
- first_name: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Yichuan
full_name: Wang, Yichuan
last_name: Wang
- first_name: Yutong
full_name: Ma, Yutong
last_name: Ma
- first_name: Mingzhe
full_name: Li, Mingzhe
last_name: Li
- first_name: Fengying
full_name: An, Fengying
last_name: An
- first_name: Hongwei
full_name: Guo, Hongwei
last_name: Guo
citation:
ama: Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene
signaling in arabidopsis. Cell. 2015;163(3):670-683. doi:10.1016/j.cell.2015.09.037
apa: Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed
translational regulation of ethylene signaling in arabidopsis. Cell. Cell
Press. https://doi.org/10.1016/j.cell.2015.09.037
chicago: Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma,
Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation
of Ethylene Signaling in Arabidopsis.” Cell. Cell Press, 2015. https://doi.org/10.1016/j.cell.2015.09.037.
ieee: W. Li et al., “EIN2-directed translational regulation of ethylene signaling
in arabidopsis,” Cell, vol. 163, no. 3. Cell Press, pp. 670–683, 2015.
ista: Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed
translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.
mla: Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling
in Arabidopsis.” Cell, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:10.1016/j.cell.2015.09.037.
short: W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell
163 (2015) 670–683.
date_created: 2018-12-11T11:47:00Z
date_published: 2015-10-22T00:00:00Z
date_updated: 2025-09-23T08:40:43Z
day: '22'
department:
- _id: JiFr
doi: 10.1016/j.cell.2015.09.037
external_id:
isi:
- '000364828900020'
intvolume: ' 163'
isi: 1
issue: '3'
language:
- iso: eng
month: '10'
oa_version: None
page: 670 - 683
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '7285'
quality_controlled: '1'
scopus_import: '1'
status: public
title: EIN2-directed translational regulation of ethylene signaling in arabidopsis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 163
year: '2015'
...
---
_id: '5429'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. \r\nThere have been two different views: (i) the
expectation semantics, where the goal is to optimize the expected mean-payoff
objective, and (ii) the satisfaction semantics, where the goal is to maximize
the probability of runs such that the mean-payoff value stays above a given vector.
\ \r\nWe consider the problem where the goal is to optimize the expectation under
the constraint that the satisfaction semantics is ensured, and thus consider a
generalization that unifies the existing semantics.\r\nOur problem captures the
notion of optimization with respect to strategies that are risk-averse (i.e.,
ensures certain probabilistic guarantee).\r\nOur main results are algorithms for
the decision problem which are always polynomial in the size of the MDP. We also
show that an approximation of the Pareto-curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions.\r\nFinally, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Komarkova, Zuzana
last_name: Komarkova
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1
apa: Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two
views on multiple mean-payoff objectives in Markov decision processes. IST
Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1
chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.
ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple
mean-payoff objectives in Markov decision processes. IST Austria, 2015.
ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes, IST Austria, 41p.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.
short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-01-12T00:00:00Z
date_updated: 2025-09-29T11:00:42Z
day: '12'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v1-1
file:
- access_level: open_access
checksum: e4869a584567c506349abda9c8ec7db3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:11Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5533'
file_name: IST-2015-318-v1+1_main.pdf
file_size: 689863
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '41'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '318'
related_material:
record:
- id: '5435'
relation: later_version
status: public
- id: '466'
relation: later_version
status: public
- id: '1657'
relation: later_version
status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5430'
abstract:
- lang: eng
text: We consider the core algorithmic problems related to verification of systems
with respect to three classical quantitative properties, namely, the mean- payoff
property, the ratio property, and the minimum initial credit for energy property.
The algorithmic problem given a graph and a quantitative property asks to compute
the optimal value (the infimum value over all traces) from every node of the graph.
We consider graphs with constant treewidth, and it is well-known that the control-flow
graphs of most programs have constant treewidth. Let n denote the number of nodes
of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) )
and W the largest absolute value of the weights. Our main theoretical results
are as follows. First, for constant treewidth graphs we present an algorithm that
approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time
O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms
that require quadratic time. Second, for the ratio property we present an algorithm
that for constant treewidth graphs works in time O ( n · log( | a · b · n | ))
= O ( n · log( n · W )) , when the output is a b , as compared to the previously
best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the
minimum initial credit problem we show that (i) for general graphs the problem
can be solved in O ( n 2 · m ) time and the associated decision problem can be
solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n
· W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth
graphs we present an algorithm that requires O ( n · log n ) time, improving the
previous known O ( n 4 · log( n · W )) bound. We have implemented some of our
algorithms and show that they present a significant speedup on standard benchmarks.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster
algorithms for quantitative verification in constant treewidth graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms
for quantitative verification in constant treewidth graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for
quantitative verification in constant treewidth graphs, IST Austria, 31p.
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification
in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-10T00:00:00Z
date_updated: 2025-09-23T08:47:23Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-319-v1-1
file:
- access_level: open_access
checksum: 62c6ea01e342553dcafb88a070fb1ad5
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:21Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5482'
file_name: IST-2015-319-v1+1_long.pdf
file_size: 1089651
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '319'
related_material:
record:
- id: '5437'
relation: later_version
status: public
- id: '1607'
relation: later_version
status: public
status: public
title: Faster algorithms for quantitative verification in constant treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5431'
abstract:
- lang: eng
text: "We consider finite-state concurrent stochastic games, played by k>=2 players
for an infinite number of rounds, where in every round, each player simultaneously
and independently of the other players chooses an action, whereafter the successor
state is determined by a probability distribution given by the current state and
the chosen actions. We consider reachability objectives that given a target set
of states require that some state in the target set is visited, and the dual safety
objectives that given a target set require that only states in the target set
are visited. We are interested in the complexity of stationary strategies measured
by their patience, which is defined as the inverse of the smallest non-zero probability
employed.\r\n\r\n Our main results are as follows: We show that in two-player
zero-sum concurrent stochastic games (with reachability objective for one player
and the complementary safety objective for the other player): (i) the optimal
bound on the patience of optimal and epsilon-optimal strategies, for both players
is doubly exponential; and (ii) even in games with a single non-absorbing state
exponential (in the number of actions) patience is necessary. In general we study
the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that
if there is at least one player with reachability objective, then doubly-exponential
patience is needed in general for epsilon-Nash equilibrium strategies, whereas
in contrast if all players have safety objectives, then the optimal bound on patience
for epsilon-Nash equilibrium strategies is only exponential."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Kristoffer
full_name: Hansen, Kristoffer
last_name: Hansen
citation:
ama: Chatterjee K, Ibsen-Jensen R, Hansen K. The Patience of Concurrent Stochastic
Games with Safety and Reachability Objectives. IST Austria; 2015. doi:10.15479/AT:IST-2015-322-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience
of concurrent stochastic games with safety and reachability objectives. IST
Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The
Patience of Concurrent Stochastic Games with Safety and Reachability Objectives.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent
stochastic games with safety and reachability objectives. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic
games with safety and reachability objectives, IST Austria, 25p.
mla: Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games
with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic
Games with Safety and Reachability Objectives, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2021-01-12T08:02:13Z
day: '19'
ddc:
- '005'
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-322-v1-1
file:
- access_level: open_access
checksum: bfb858262c30445b8e472c40069178a2
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:31Z
date_updated: 2020-07-14T12:46:53Z
file_id: '5491'
file_name: IST-2015-322-v1+1_safetygames.pdf
file_size: 661015
relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '322'
status: public
title: The patience of concurrent stochastic games with safety and reachability objectives
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5432'
abstract:
- lang: eng
text: "Evolution occurs in populations of reproducing individuals. The structure
of the population affects the outcome of the evolutionary process. Evolutionary
graph theory is a powerful approach to study this phenomenon. There are two graphs.
The interaction graph specifies who interacts with whom in the context of evolution.The
replacement graph specifies who competes with whom for reproduction. \r\nThe vertices
of the two graphs are the same, and each vertex corresponds to an individual of
the population. A key quantity is the fixation probability of a new mutant. It
is defined as the probability that a newly introduced mutant (on a single vertex)
generates a lineage of offspring which eventually takes over the entire population
of resident individuals. The basic computational questions are as follows: (i)
the qualitative question asks whether the fixation probability is positive; and
(ii) the quantitative approximation question asks for an approximation of the
fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative
question is NP-complete and the quantitative approximation question is #P-hard
in the special case when the interaction and the replacement graphs coincide and
even with the restriction that the resident individuals do not reproduce (which
corresponds to an invading population taking over an empty structure).\r\n(2)
We show that in general the qualitative question is PSPACE-complete and the quantitative
approximation question is PSPACE-hard and can be solved in exponential time.\r\n"
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games
on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity
of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity
of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary
games on graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary
games on graphs, IST Austria, 29p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs.
IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary
Games on Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:18Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2023-02-23T12:26:33Z
day: '19'
ddc:
- '005'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-323-v1-1
file:
- access_level: open_access
checksum: 546c1b291d545e7b24aaaf4199dac671
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:57Z
date_updated: 2020-07-14T12:46:53Z
file_id: '5519'
file_name: IST-2015-323-v1+1_main.pdf
file_size: 576347
relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '323'
related_material:
record:
- id: '5421'
relation: earlier_version
status: public
- id: '5440'
relation: later_version
status: public
status: public
title: The complexity of evolutionary games on graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...