---
_id: '6368'
abstract:
- lang: eng
text: An optical network of superconducting quantum bits (qubits) is an appealing
platform for quantum communication and distributed quantum computing, but developing
a quantum-compatible link between the microwave and optical domains remains an
outstanding challenge. Operating at T < 100 mK temperatures, as required for quantum
electrical circuits, we demonstrate a mechanically mediated microwave–optical
converter with 47% conversion efficiency, and use a classical feed-forward protocol
to reduce added noise to 38 photons. The feed-forward protocol harnesses our discovery
that noise emitted from the two converter output ports is strongly correlated
because both outputs record thermal motion of the same mechanical mode. We also
discuss a quantum feed-forward protocol that, given high system efficiencies,
would allow quantum information to be transferred even when thermal phonons enter
the mechanical element faster than the electro-optic conversion rate.
arxiv: 1
author:
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
- first_name: P. S.
full_name: Burns, P. S.
last_name: Burns
- first_name: M. D.
full_name: Urmey, M. D.
last_name: Urmey
- first_name: R. W.
full_name: Peterson, R. W.
last_name: Peterson
- first_name: N. S.
full_name: Kampel, N. S.
last_name: Kampel
- first_name: B. M.
full_name: Brubaker, B. M.
last_name: Brubaker
- first_name: G.
full_name: Smith, G.
last_name: Smith
- first_name: K. W.
full_name: Lehnert, K. W.
last_name: Lehnert
- first_name: C. A.
full_name: Regal, C. A.
last_name: Regal
citation:
ama: Higginbotham AP, Burns PS, Urmey MD, et al. Harnessing electro-optic correlations
in an efficient mechanical converter. Nature Physics. 2018;14(10):1038-1042.
doi:10.1038/s41567-018-0210-0
apa: Higginbotham, A. P., Burns, P. S., Urmey, M. D., Peterson, R. W., Kampel, N.
S., Brubaker, B. M., … Regal, C. A. (2018). Harnessing electro-optic correlations
in an efficient mechanical converter. Nature Physics. Springer Nature.
https://doi.org/10.1038/s41567-018-0210-0
chicago: Higginbotham, Andrew P, P. S. Burns, M. D. Urmey, R. W. Peterson, N. S.
Kampel, B. M. Brubaker, G. Smith, K. W. Lehnert, and C. A. Regal. “Harnessing
Electro-Optic Correlations in an Efficient Mechanical Converter.” Nature Physics.
Springer Nature, 2018. https://doi.org/10.1038/s41567-018-0210-0.
ieee: A. P. Higginbotham et al., “Harnessing electro-optic correlations in
an efficient mechanical converter,” Nature Physics, vol. 14, no. 10. Springer
Nature, pp. 1038–1042, 2018.
ista: Higginbotham AP, Burns PS, Urmey MD, Peterson RW, Kampel NS, Brubaker BM,
Smith G, Lehnert KW, Regal CA. 2018. Harnessing electro-optic correlations in
an efficient mechanical converter. Nature Physics. 14(10), 1038–1042.
mla: Higginbotham, Andrew P., et al. “Harnessing Electro-Optic Correlations in an
Efficient Mechanical Converter.” Nature Physics, vol. 14, no. 10, Springer
Nature, 2018, pp. 1038–42, doi:10.1038/s41567-018-0210-0.
short: A.P. Higginbotham, P.S. Burns, M.D. Urmey, R.W. Peterson, N.S. Kampel, B.M.
Brubaker, G. Smith, K.W. Lehnert, C.A. Regal, Nature Physics 14 (2018) 1038–1042.
date_created: 2019-05-03T09:17:20Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2021-01-12T08:07:15Z
day: '01'
doi: 10.1038/s41567-018-0210-0
extern: '1'
external_id:
arxiv:
- '1712.06535'
intvolume: ' 14'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.06535
month: '10'
oa: 1
oa_version: Preprint
page: 1038-1042
publication: Nature Physics
publication_identifier:
issn:
- 1745-2473
- 1745-2481
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Harnessing electro-optic correlations in an efficient mechanical converter
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2018'
...
---
_id: '6369'
abstract:
- lang: eng
text: We construct a metamaterial from radio-frequency harmonic oscillators, and
find two topologically distinct phases resulting from dissipation engineered into
the system. These phases are distinguished by a quantized value of bulk energy
transport. The impulse response of our circuit is measured and used to reconstruct
the band structure and winding number of circuit eigenfunctions around a dark
mode. Our results demonstrate that dissipative topological transport can occur
in a wider class of physical systems than considered before.
article_number: '220301'
arxiv: 1
author:
- first_name: Eric I.
full_name: Rosenthal, Eric I.
last_name: Rosenthal
- first_name: Nicole K.
full_name: Ehrlich, Nicole K.
last_name: Ehrlich
- first_name: Mark S.
full_name: Rudner, Mark S.
last_name: Rudner
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
- first_name: K. W.
full_name: Lehnert, K. W.
last_name: Lehnert
citation:
ama: Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. Topological
phase transition measured in a dissipative metamaterial. Physical Review B.
2018;97(22). doi:10.1103/physrevb.97.220301
apa: Rosenthal, E. I., Ehrlich, N. K., Rudner, M. S., Higginbotham, A. P., &
Lehnert, K. W. (2018). Topological phase transition measured in a dissipative
metamaterial. Physical Review B. American Physical Society (APS). https://doi.org/10.1103/physrevb.97.220301
chicago: Rosenthal, Eric I., Nicole K. Ehrlich, Mark S. Rudner, Andrew P Higginbotham,
and K. W. Lehnert. “Topological Phase Transition Measured in a Dissipative Metamaterial.”
Physical Review B. American Physical Society (APS), 2018. https://doi.org/10.1103/physrevb.97.220301.
ieee: E. I. Rosenthal, N. K. Ehrlich, M. S. Rudner, A. P. Higginbotham, and K. W.
Lehnert, “Topological phase transition measured in a dissipative metamaterial,”
Physical Review B, vol. 97, no. 22. American Physical Society (APS), 2018.
ista: Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. 2018. Topological
phase transition measured in a dissipative metamaterial. Physical Review B. 97(22),
220301.
mla: Rosenthal, Eric I., et al. “Topological Phase Transition Measured in a Dissipative
Metamaterial.” Physical Review B, vol. 97, no. 22, 220301, American Physical
Society (APS), 2018, doi:10.1103/physrevb.97.220301.
short: E.I. Rosenthal, N.K. Ehrlich, M.S. Rudner, A.P. Higginbotham, K.W. Lehnert,
Physical Review B 97 (2018).
date_created: 2019-05-03T09:29:49Z
date_published: 2018-06-04T00:00:00Z
date_updated: 2021-01-12T08:07:16Z
day: '04'
doi: 10.1103/physrevb.97.220301
extern: '1'
external_id:
arxiv:
- '1802.02243'
intvolume: ' 97'
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.02243
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
issn:
- 2469-9950
- 2469-9969
publication_status: published
publisher: American Physical Society (APS)
quality_controlled: '1'
status: public
title: Topological phase transition measured in a dissipative metamaterial
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2018'
...
---
_id: '64'
abstract:
- lang: eng
text: Tropical geometry, an established field in pure mathematics, is a place where
string theory, mirror symmetry, computational algebra, auction theory, and so
forth meet and influence one another. In this paper, we report on our discovery
of a tropical model with self-organized criticality (SOC) behavior. Our model
is continuous, in contrast to all known models of SOC, and is a certain scaling
limit of the sandpile model, the first and archetypical model of SOC. We describe
how our model is related to pattern formation and proportional growth phenomena
and discuss the dichotomy between continuous and discrete models in several contexts.
Our aim in this context is to present an idealized tropical toy model (cf. Turing
reaction-diffusion model), requiring further investigation.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikita
full_name: Kalinin, Nikita
last_name: Kalinin
- first_name: Aldo
full_name: Guzmán Sáenz, Aldo
last_name: Guzmán Sáenz
- first_name: Y
full_name: Prieto, Y
last_name: Prieto
- first_name: Mikhail
full_name: Shkolnikov, Mikhail
id: 35084A62-F248-11E8-B48F-1D18A9856A87
last_name: Shkolnikov
orcid: 0000-0002-4310-178X
- first_name: V
full_name: Kalinina, V
last_name: Kalinina
- first_name: Ernesto
full_name: Lupercio, Ernesto
last_name: Lupercio
citation:
ama: Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E.
Self-organized criticality and pattern emergence through the lens of tropical
geometry. Proceedings of the National Academy of Sciences of the United States
of America. 2018;115(35):E8135-E8142. doi:10.1073/pnas.1805847115
apa: Kalinin, N., Guzmán Sáenz, A., Prieto, Y., Shkolnikov, M., Kalinina, V., &
Lupercio, E. (2018). Self-organized criticality and pattern emergence through
the lens of tropical geometry. Proceedings of the National Academy of Sciences
of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1805847115
chicago: Kalinin, Nikita, Aldo Guzmán Sáenz, Y Prieto, Mikhail Shkolnikov, V Kalinina,
and Ernesto Lupercio. “Self-Organized Criticality and Pattern Emergence through
the Lens of Tropical Geometry.” Proceedings of the National Academy of Sciences
of the United States of America. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1805847115.
ieee: N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, and E.
Lupercio, “Self-organized criticality and pattern emergence through the lens of
tropical geometry,” Proceedings of the National Academy of Sciences of the
United States of America, vol. 115, no. 35. National Academy of Sciences,
pp. E8135–E8142, 2018.
ista: Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E.
2018. Self-organized criticality and pattern emergence through the lens of tropical
geometry. Proceedings of the National Academy of Sciences of the United States
of America. 115(35), E8135–E8142.
mla: Kalinin, Nikita, et al. “Self-Organized Criticality and Pattern Emergence through
the Lens of Tropical Geometry.” Proceedings of the National Academy of Sciences
of the United States of America, vol. 115, no. 35, National Academy of Sciences,
2018, pp. E8135–42, doi:10.1073/pnas.1805847115.
short: N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, E. Lupercio,
Proceedings of the National Academy of Sciences of the United States of America
115 (2018) E8135–E8142.
date_created: 2018-12-11T11:44:26Z
date_published: 2018-08-28T00:00:00Z
date_updated: 2025-06-03T11:21:16Z
day: '28'
department:
- _id: TaHa
doi: 10.1073/pnas.1805847115
ec_funded: 1
external_id:
arxiv:
- '1806.09153'
isi:
- '000442861600009'
intvolume: ' 115'
isi: 1
issue: '35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.09153
month: '08'
oa: 1
oa_version: Preprint
page: E8135 - E8142
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '7990'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-organized criticality and pattern emergence through the lens of tropical
geometry
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 115
year: '2018'
...
---
_id: '6497'
abstract:
- lang: eng
text: T cells are actively scanning pMHC-presenting cells in lymphoid organs and
nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the
T cell actomyosin cytoskeleton facilitates this task in distinct environments
is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative
regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface
stiffness in primary T cells. Nonetheless, intravital imaging revealed robust
motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and
differentiation during immune responses. In contrast, accumulation of Myo9b−/−
CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for
T cell crossing of basement membranes, such as those which are present between
dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control
of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell
adaptation from lymphoid to NLT surveillance and the establishment of protective
tissue–resident T cell populations.
article_processing_charge: No
author:
- first_name: Federica
full_name: Moalli, Federica
last_name: Moalli
- first_name: Xenia
full_name: Ficht, Xenia
last_name: Ficht
- first_name: Philipp
full_name: Germann, Philipp
last_name: Germann
- first_name: Mykhailo
full_name: Vladymyrov, Mykhailo
last_name: Vladymyrov
- first_name: Bettina
full_name: Stolp, Bettina
last_name: Stolp
- first_name: Ingrid
full_name: de Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: de Vries
- first_name: Ruth
full_name: Lyck, Ruth
last_name: Lyck
- first_name: Jasmin
full_name: Balmer, Jasmin
last_name: Balmer
- first_name: Amleto
full_name: Fiocchi, Amleto
last_name: Fiocchi
- first_name: Mario
full_name: Kreutzfeldt, Mario
last_name: Kreutzfeldt
- first_name: Doron
full_name: Merkler, Doron
last_name: Merkler
- first_name: Matteo
full_name: Iannacone, Matteo
last_name: Iannacone
- first_name: Akitaka
full_name: Ariga, Akitaka
last_name: Ariga
- first_name: Michael H.
full_name: Stoffel, Michael H.
last_name: Stoffel
- first_name: James
full_name: Sharpe, James
last_name: Sharpe
- first_name: Martin
full_name: Bähler, Martin
last_name: Bähler
- 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: Alba
full_name: Diz-Muñoz, Alba
last_name: Diz-Muñoz
- first_name: Jens V.
full_name: Stein, Jens V.
last_name: Stein
citation:
ama: Moalli F, Ficht X, Germann P, et al. The Rho regulator Myosin IXb enables nonlymphoid
tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine.
2018;2015(7):1869–1890. doi:10.1084/jem.20170896
apa: Moalli, F., Ficht, X., Germann, P., Vladymyrov, M., Stolp, B., de Vries, I.,
… Stein, J. V. (2018). The Rho regulator Myosin IXb enables nonlymphoid tissue
seeding of protective CD8+T cells. The Journal of Experimental Medicine.
Rockefeller University Press. https://doi.org/10.1084/jem.20170896
chicago: Moalli, Federica, Xenia Ficht, Philipp Germann, Mykhailo Vladymyrov, Bettina
Stolp, Ingrid de Vries, Ruth Lyck, et al. “The Rho Regulator Myosin IXb Enables
Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental
Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20170896.
ieee: F. Moalli et al., “The Rho regulator Myosin IXb enables nonlymphoid
tissue seeding of protective CD8+T cells,” The Journal of Experimental Medicine,
vol. 2015, no. 7. Rockefeller University Press, pp. 1869–1890, 2018.
ista: Moalli F, Ficht X, Germann P, Vladymyrov M, Stolp B, de Vries I, Lyck R, Balmer
J, Fiocchi A, Kreutzfeldt M, Merkler D, Iannacone M, Ariga A, Stoffel MH, Sharpe
J, Bähler M, Sixt MK, Diz-Muñoz A, Stein JV. 2018. The Rho regulator Myosin IXb
enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental
Medicine. 2015(7), 1869–1890.
mla: Moalli, Federica, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid
Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine,
vol. 2015, no. 7, Rockefeller University Press, 2018, pp. 1869–1890, doi:10.1084/jem.20170896.
short: F. Moalli, X. Ficht, P. Germann, M. Vladymyrov, B. Stolp, I. de Vries, R.
Lyck, J. Balmer, A. Fiocchi, M. Kreutzfeldt, D. Merkler, M. Iannacone, A. Ariga,
M.H. Stoffel, J. Sharpe, M. Bähler, M.K. Sixt, A. Diz-Muñoz, J.V. Stein, The Journal
of Experimental Medicine 2015 (2018) 1869–1890.
date_created: 2019-05-28T12:36:47Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-19T14:52:08Z
day: '06'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1084/jem.20170896
external_id:
isi:
- '000440822900011'
file:
- access_level: open_access
checksum: 86ae5331f9bfced9a6358a790a04bef4
content_type: application/pdf
creator: kschuh
date_created: 2019-05-28T12:40:05Z
date_updated: 2020-07-14T12:47:32Z
file_id: '6498'
file_name: 2018_rupress_Moalli.pdf
file_size: 3841660
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
intvolume: ' 2015'
isi: 1
issue: '7'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: 1869–1890
publication: The Journal of Experimental Medicine
publication_identifier:
eissn:
- 1540-9538
issn:
- 0022-1007
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective
CD8+T cells
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2015
year: '2018'
...
---
_id: '6499'
abstract:
- lang: eng
text: Expansion microscopy is a recently introduced imaging technique that achieves
super‐resolution through physically expanding the specimen by ~4×, after embedding
into a swellable gel. The resolution attained is, correspondingly, approximately
fourfold better than the diffraction limit, or ~70 nm. This is a major improvement
over conventional microscopy, but still lags behind modern STED or STORM setups,
whose resolution can reach 20–30 nm. We addressed this issue here by introducing
an improved gel recipe that enables an expansion factor of ~10× in each dimension,
which corresponds to an expansion of the sample volume by more than 1,000‐fold.
Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm
on conventional epifluorescence microscopes. X10 provides multi‐color images similar
or even superior to those produced with more challenging methods, such as STED,
STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest
and easiest option for high‐quality super‐resolution imaging currently available.
X10 should be usable in any laboratory, irrespective of the machinery owned or
of the technical knowledge.
article_number: e45836
article_processing_charge: No
author:
- first_name: Sven M
full_name: Truckenbrodt, Sven M
id: 45812BD4-F248-11E8-B48F-1D18A9856A87
last_name: Truckenbrodt
- first_name: Manuel
full_name: Maidorn, Manuel
last_name: Maidorn
- first_name: Dagmar
full_name: Crzan, Dagmar
last_name: Crzan
- first_name: Hanna
full_name: Wildhagen, Hanna
last_name: Wildhagen
- first_name: Selda
full_name: Kabatas, Selda
last_name: Kabatas
- first_name: Silvio O
full_name: Rizzoli, Silvio O
last_name: Rizzoli
citation:
ama: Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. X10
expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO
reports. 2018;19(9). doi:10.15252/embr.201845836
apa: Truckenbrodt, S. M., Maidorn, M., Crzan, D., Wildhagen, H., Kabatas, S., &
Rizzoli, S. O. (2018). X10 expansion microscopy enables 25‐nm resolution on conventional
microscopes. EMBO Reports. Embo Press. https://doi.org/10.15252/embr.201845836
chicago: Truckenbrodt, Sven M, Manuel Maidorn, Dagmar Crzan, Hanna Wildhagen, Selda
Kabatas, and Silvio O Rizzoli. “X10 Expansion Microscopy Enables 25‐nm Resolution
on Conventional Microscopes.” EMBO Reports. Embo Press, 2018. https://doi.org/10.15252/embr.201845836.
ieee: S. M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, and S.
O. Rizzoli, “X10 expansion microscopy enables 25‐nm resolution on conventional
microscopes,” EMBO reports, vol. 19, no. 9. Embo Press, 2018.
ista: Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. 2018.
X10 expansion microscopy enables 25‐nm resolution on conventional microscopes.
EMBO reports. 19(9), e45836.
mla: Truckenbrodt, Sven M., et al. “X10 Expansion Microscopy Enables 25‐nm Resolution
on Conventional Microscopes.” EMBO Reports, vol. 19, no. 9, e45836, Embo
Press, 2018, doi:10.15252/embr.201845836.
short: S.M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, S.O. Rizzoli,
EMBO Reports 19 (2018).
date_created: 2019-05-28T13:16:08Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2024-12-11T11:48:40Z
day: '01'
ddc:
- '580'
department:
- _id: JoDa
doi: 10.15252/embr.201845836
external_id:
isi:
- '000443682200009'
file:
- access_level: open_access
checksum: 6ec90abc637f09cca3a7b6424d7e7a26
content_type: application/pdf
creator: kschuh
date_created: 2019-05-28T13:17:19Z
date_updated: 2020-07-14T12:47:32Z
file_id: '6500'
file_name: 2018_embo_Truckenbrodt.pdf
file_size: 2005572
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
publication: EMBO reports
publication_identifier:
eissn:
- 1469-3178
issn:
- 1469-221X
publication_status: published
publisher: Embo Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: X10 expansion microscopy enables 25‐nm resolution on conventional microscopes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2018'
...
---
_id: '6558'
abstract:
- lang: eng
text: This paper studies the problem of distributed stochastic optimization in an
adversarial setting where, out of m machines which allegedly compute stochastic
gradients every iteration, an α-fraction are Byzantine, and may behave adversarially.
Our main result is a variant of stochastic gradient descent (SGD) which finds
ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations.
In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot
tolerate Byzantine failures. Further, we provide a lower bound showing that, up
to logarithmic factors, our algorithm is information-theoretically optimal both
in terms of sample complexity and time complexity.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Zeyuan
full_name: Allen-Zhu, Zeyuan
last_name: Allen-Zhu
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
citation:
ama: 'Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In:
Advances in Neural Information Processing Systems. Vol 2018. Neural Information
Processing Systems Foundation; 2018:4613-4623.'
apa: 'Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic
gradient descent. In Advances in Neural Information Processing Systems
(Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems
Foundation.'
chicago: Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic
Gradient Descent.” In Advances in Neural Information Processing Systems,
2018:4613–23. Neural Information Processing Systems Foundation, 2018.
ieee: D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,”
in Advances in Neural Information Processing Systems, Montreal, Canada,
2018, vol. 2018, pp. 4613–4623.
ista: 'Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent.
Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural
Information Processing Systems vol. 2018, 4613–4623.'
mla: Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances
in Neural Information Processing Systems, vol. 2018, Neural Information Processing
Systems Foundation, 2018, pp. 4613–23.
short: D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2018, pp.
4613–4623.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2018-12-02
date_created: 2019-06-13T08:22:37Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-19T15:12:45Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1803.08917'
isi:
- '000461823304061'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.08917
month: '12'
oa: 1
oa_version: Published Version
page: 4613-4623
publication: Advances in Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Byzantine stochastic gradient descent
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '6589'
abstract:
- lang: eng
text: Distributed training of massive machine learning models, in particular deep
neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace.
Several families of communication-reduction methods, such as quantization, large-batch
methods, and gradient sparsification, have been proposed. To date, gradient sparsification
methods--where each node sorts gradients by magnitude, and only communicates a
subset of the components, accumulating the rest locally--are known to yield some
of the largest practical gains. Such methods can reduce the amount of communication
per step by up to \emph{three orders of magnitude}, while preserving model accuracy.
Yet, this family of methods currently has no theoretical justification. This is
the question we address in this paper. We prove that, under analytic assumptions,
sparsifying gradients by magnitude with local error correction provides convergence
guarantees, for both convex and non-convex smooth objectives, for data-parallel
SGD. The main insight is that sparsification methods implicitly maintain bounds
on the maximum impact of stale updates, thanks to selection by magnitude. Our
analysis and empirical validation also reveal that these methods do require analytical
conditions to converge well, justifying existing heuristics.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Torsten
full_name: Hoefler, Torsten
last_name: Hoefler
- first_name: Mikael
full_name: Johansson, Mikael
last_name: Johansson
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
- first_name: Sarit
full_name: Khirirat, Sarit
last_name: Khirirat
- first_name: Cedric
full_name: Renggli, Cedric
last_name: Renggli
citation:
ama: 'Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli
C. The convergence of sparsified gradient methods. In: Advances in Neural Information
Processing Systems 31. Vol Volume 2018. Neural Information Processing Systems
Foundation; 2018:5973-5983.'
apa: 'Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat,
S., & Renggli, C. (2018). The convergence of sparsified gradient methods.
In Advances in Neural Information Processing Systems 31 (Vol. Volume 2018,
pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.'
chicago: Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov,
Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.”
In Advances in Neural Information Processing Systems 31, Volume 2018:5973–83.
Neural Information Processing Systems Foundation, 2018.
ieee: D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat,
and C. Renggli, “The convergence of sparsified gradient methods,” in Advances
in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol.
Volume 2018, pp. 5973–5983.
ista: 'Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli
C. 2018. The convergence of sparsified gradient methods. Advances in Neural Information
Processing Systems 31. NeurIPS: Conference on Neural Information Processing Systems
vol. Volume 2018, 5973–5983.'
mla: Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.”
Advances in Neural Information Processing Systems 31, vol. Volume 2018,
Neural Information Processing Systems Foundation, 2018, pp. 5973–83.
short: D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat,
C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural
Information Processing Systems Foundation, 2018, pp. 5973–5983.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2018-12-02
corr_author: '1'
date_created: 2019-06-27T09:32:55Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2025-06-26T12:23:06Z
day: '01'
department:
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1809.10505'
isi:
- '000461852000047'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.10505
month: '12'
oa: 1
oa_version: Preprint
page: 5973-5983
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Advances in Neural Information Processing Systems 31
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: The convergence of sparsified gradient methods
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: Volume 2018
year: '2018'
...
---
_id: '6664'
abstract:
- lang: eng
text: Reed-Muller (RM) and polar codes are a class of capacity-achieving channel
coding schemes with the same factor graph representation. Low-complexity decoding
algorithms fall short in providing a good error-correction performance for RM
and polar codes. Using the symmetric group of RM and polar codes, the specific
decoding algorithm can be carried out on multiple permutations of the factor graph
to boost the error-correction performance. However, this approach results in high
decoding complexity. In this paper, we first derive the total number of factor
graph permutations on which the decoding can be performed. We further propose
a successive permutation (SP) scheme which finds the permutations on the fly,
thus the decoding always progresses on a single factor graph permutation. We show
that SP can be used to improve the error-correction performance of RM and polar
codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping
the memory requirements of the decoders unaltered. Our results for RM and polar
codes of length 128 and rate 0.5 show that when SP is used and at a target frame
error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for
RM and polar codes respectively.
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: 'Warren '
full_name: 'Gross, Warren '
last_name: Gross
citation:
ama: 'Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes
by successive factor graph permutations. In: 2018 IEEE 10th International Symposium
on Turbo Codes & Iterative Information Processing. IEEE; 2018:1-5. doi:10.1109/istc.2018.8625281'
apa: 'Hashemi, S. A., Doan, N., Mondelli, M., & Gross, W. (2018). Decoding Reed-Muller
and polar codes by successive factor graph permutations. In 2018 IEEE 10th
International Symposium on Turbo Codes & Iterative Information Processing
(pp. 1–5). Hong Kong, China: IEEE. https://doi.org/10.1109/istc.2018.8625281'
chicago: Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren Gross. “Decoding
Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In 2018
IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing,
1–5. IEEE, 2018. https://doi.org/10.1109/istc.2018.8625281.
ieee: S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and
polar codes by successive factor graph permutations,” in 2018 IEEE 10th International
Symposium on Turbo Codes & Iterative Information Processing, Hong Kong,
China, 2018, pp. 1–5.
ista: 'Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar
codes by successive factor graph permutations. 2018 IEEE 10th International Symposium
on Turbo Codes & Iterative Information Processing. ISTC: Symposium on Turbo
Codes & Iterative Information Processing, 1–5.'
mla: Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive
Factor Graph Permutations.” 2018 IEEE 10th International Symposium on Turbo
Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5, doi:10.1109/istc.2018.8625281.
short: S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International
Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp.
1–5.
conference:
end_date: 2018-12-07
location: Hong Kong, China
name: 'ISTC: Symposium on Turbo Codes & Iterative Information Processing'
start_date: 2018-12-03
date_created: 2019-07-23T09:12:43Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:29Z
day: '01'
doi: 10.1109/istc.2018.8625281
extern: '1'
external_id:
arxiv:
- '1807.03912'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.03912
month: '12'
oa: 1
oa_version: Preprint
page: 1-5
publication: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information
Processing
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Decoding Reed-Muller and polar codes by successive factor graph permutations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6665'
abstract:
- lang: eng
text: We prove that, at least for the binary erasure channel, the polar-coding paradigm
gives rise to codes that not only approach the Shannon limit but, in fact, do
so under the best possible scaling of their block length as a function of the
gap to capacity. This result exhibits the first known family of binary codes that
attain both optimal scaling and quasi-linear complexity of encoding and decoding.
Specifically, for any fixed δ > 0, we exhibit binary linear codes that ensure
reliable communication at rates within ε > 0 of capacity with block length n =
O(1/ε 2+δ ), construction complexity Θ(n), and encoding/decoding complexity Θ(n
log n).
arxiv: 1
author:
- first_name: Arman
full_name: Fazeli, Arman
last_name: Fazeli
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Alexander
full_name: Vardy, Alexander
last_name: Vardy
citation:
ama: 'Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal
scaling: Polar codes with large kernels. In: 2018 IEEE Information Theory Workshop.
IEEE; 2018:1-5. doi:10.1109/itw.2018.8613428'
apa: 'Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear
codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information
Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428'
chicago: 'Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary
Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In 2018
IEEE Information Theory Workshop, 1–5. IEEE, 2018. https://doi.org/10.1109/itw.2018.8613428.'
ieee: 'A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with
optimal scaling: Polar codes with large kernels,” in 2018 IEEE Information
Theory Workshop, Guangzhou, China, 2018, pp. 1–5.'
ista: 'Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with
optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory
Workshop. ITW: Information Theory Workshop, 1–5.'
mla: 'Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes
with Large Kernels.” 2018 IEEE Information Theory Workshop, IEEE, 2018,
pp. 1–5, doi:10.1109/itw.2018.8613428.'
short: A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information
Theory Workshop, IEEE, 2018, pp. 1–5.
conference:
end_date: 2018-11-29
location: Guangzhou, China
name: 'ITW: Information Theory Workshop'
start_date: 2018-11-25
date_created: 2019-07-23T11:01:42Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2025-09-10T09:59:12Z
day: '01'
doi: 10.1109/itw.2018.8613428
extern: '1'
external_id:
arxiv:
- '1711.01339'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.01339
month: '11'
oa: 1
oa_version: Preprint
page: 1-5
publication: 2018 IEEE Information Theory Workshop
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9002'
relation: later_version
status: public
status: public
title: 'Binary linear codes with optimal scaling: Polar codes with large kernels'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6674'
abstract:
- lang: eng
text: Polar codes represent one of the major recent breakthroughs in coding theory
and, because of their attractive features, they have been selected for the incoming
5G standard. As such, a lot of attention has been devoted to the development of
decoding algorithms with good error performance and efficient hardware implementation.
One of the leading candidates in this regard is represented by successive-cancellation
list (SCL) decoding. However, its hardware implementation requires a large amount
of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly
reduce the memory consumption. In this paper, we consider the paradigm of PSCL
decoding from a practical standpoint, and we provide several improvements. First,
by changing the target signal-to-noise ratio and consequently modifying the construction
of the code, we are able to improve the performance at no additional computational,
latency, or memory cost. Second, we bridge the performance gap between SCL and
PSCL decoding by introducing a generalized PSCL decoder and a layered PSCL decoder.
In this way, we obtain almost the same performance of the SCL decoder with a significantly
lower memory requirement, as testified by hardware implementation results. Third,
we present an optimal scheme to allocate cyclic redundancy checks. Finally, we
provide a lower bound on the list size that guarantees optimal maximum a posteriori
performance for the binary erasure channel.
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: S. Hamed
full_name: Hassani, S. Hamed
last_name: Hassani
- first_name: Carlo
full_name: Condo, Carlo
last_name: Condo
- first_name: Rudiger L.
full_name: Urbanke, Rudiger L.
last_name: Urbanke
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. Decoder
partitioning: Towards practical list decoding of polar codes. IEEE Transactions
on Communications. 2018;66(9):3749-3759. doi:10.1109/tcomm.2018.2832207'
apa: 'Hashemi, S. A., Mondelli, M., Hassani, S. H., Condo, C., Urbanke, R. L., &
Gross, W. J. (2018). Decoder partitioning: Towards practical list decoding of
polar codes. IEEE Transactions on Communications. IEEE. https://doi.org/10.1109/tcomm.2018.2832207'
chicago: 'Hashemi, Seyyed Ali, Marco Mondelli, S. Hamed Hassani, Carlo Condo, Rudiger
L. Urbanke, and Warren J. Gross. “Decoder Partitioning: Towards Practical List
Decoding of Polar Codes.” IEEE Transactions on Communications. IEEE, 2018.
https://doi.org/10.1109/tcomm.2018.2832207.'
ieee: 'S. A. Hashemi, M. Mondelli, S. H. Hassani, C. Condo, R. L. Urbanke, and W.
J. Gross, “Decoder partitioning: Towards practical list decoding of polar codes,”
IEEE Transactions on Communications, vol. 66, no. 9. IEEE, pp. 3749–3759,
2018.'
ista: 'Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. 2018.
Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions
on Communications. 66(9), 3749–3759.'
mla: 'Hashemi, Seyyed Ali, et al. “Decoder Partitioning: Towards Practical List
Decoding of Polar Codes.” IEEE Transactions on Communications, vol. 66,
no. 9, IEEE, 2018, pp. 3749–59, doi:10.1109/tcomm.2018.2832207.'
short: S.A. Hashemi, M. Mondelli, S.H. Hassani, C. Condo, R.L. Urbanke, W.J. Gross,
IEEE Transactions on Communications 66 (2018) 3749–3759.
date_created: 2019-07-24T08:59:41Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2021-01-12T08:08:31Z
day: '01'
doi: 10.1109/tcomm.2018.2832207
extern: '1'
intvolume: ' 66'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 3749-3759
publication: IEEE Transactions on Communications
publication_identifier:
eissn:
- 1558-0857
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Decoder partitioning: Towards practical list decoding of polar codes'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2018'
...
---
_id: '6675'
abstract:
- lang: eng
text: 'We present a coding paradigm that provides a new achievable rate for the
primitive relay channel by combining compress-and-forward and decode-and-forward
with a chaining construction. In the primitive relay channel model, the source
broadcasts a message to the relay and to the destination; and the relay facilitates
this communication by sending an additional message to the destination through
a separate channel. Two well-known coding approaches for this setting are decode-and-forward
and compress-and-forward: in the former, the relay decodes the message and sends
some of the information to the destination; in the latter, the relay does not
attempt to decode, but it sends a compressed description of the received sequence
to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs
of blocks and we use compress-and-forward for the first block and decode-and-forward
for the second. In particular, in the first block, the relay does not attempt
to decode and it sends only a part of the compressed description of the received
sequence; in the second block, the relay decodes the message and sends this information
plus the remaining part of the compressed sequence relative to the first block.
As a result, we strictly outperform both compress-and- forward and decode-and-forward.
Furthermore, this paradigm can be implemented with a low-complexity polar coding
scheme that has the typical attractive features of polar codes, i.e., quasi-linear
encoding/decoding complexity and super-polynomial decay of the error probability.
Throughout the paper we consider as a running example the special case of the
erasure relay channel and we compare the rates achievable by our proposed scheme
with the existing upper and lower bounds.'
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
ama: 'Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive
relay channel. In: 2018 IEEE International Symposium on Information Theory.
IEEE; 2018:351-355. doi:10.1109/isit.2018.8437479'
apa: 'Mondelli, M., Hassani, H., & Urbanke, R. (2018). A new coding paradigm
for the primitive relay channel. In 2018 IEEE International Symposium on Information
Theory (pp. 351–355). Vail, CO, United States: IEEE. https://doi.org/10.1109/isit.2018.8437479'
chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm
for the Primitive Relay Channel.” In 2018 IEEE International Symposium on Information
Theory, 351–55. IEEE, 2018. https://doi.org/10.1109/isit.2018.8437479.
ieee: M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive
relay channel,” in 2018 IEEE International Symposium on Information Theory,
Vail, CO, United States, 2018, pp. 351–355.
ista: 'Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive
relay channel. 2018 IEEE International Symposium on Information Theory. ISIT:
International Symposium on Information Theory , 351–355.'
mla: Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.”
2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp.
351–55, doi:10.1109/isit.2018.8437479.
short: M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium
on Information Theory, IEEE, 2018, pp. 351–355.
conference:
end_date: 2018-06-22
location: Vail, CO, United States
name: 'ISIT: International Symposium on Information Theory '
start_date: 2018-06-17
date_created: 2019-07-24T09:10:38Z
date_published: 2018-06-16T00:00:00Z
date_updated: 2024-10-09T20:59:04Z
day: '16'
doi: 10.1109/isit.2018.8437479
extern: '1'
external_id:
arxiv:
- '1801.03153'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.03153
month: '06'
oa: 1
oa_version: Preprint
page: 351-355
publication: 2018 IEEE International Symposium on Information Theory
publication_identifier:
eissn:
- 2157-8117
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '7007'
relation: later_version
status: public
status: public
title: A new coding paradigm for the primitive relay channel
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6678'
abstract:
- lang: eng
text: We survey coding techniques that enable reliable transmission at rates that
approach the capacity of an arbitrary discrete memoryless channel. In particular,
we take the point of view of modern coding theory and discuss how recent advances
in coding for symmetric channels help provide more efficient solutions for the
asymmetric case. We consider, in more detail, three basic coding paradigms. The
first one is Gallager's scheme that consists of concatenating a linear code with
a non-linear mapping so that the input distribution can be appropriately shaped.
We explicitly show that both polar codes and spatially coupled codes can be employed
in this scenario. Furthermore, we derive a scaling law between the gap to capacity,
the cardinality of the input and output alphabets, and the required size of the
mapper. The second one is an integrated scheme in which the code is used both
for source coding, in order to create codewords distributed according to the capacity-achieving
input distribution, and for channel coding, in order to provide error protection.
Such a technique has been recently introduced by Honda and Yamamoto in the context
of polar codes, and we show how to apply it also to the design of sparse graph
codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates
the two tasks of source coding and channel coding by a chaining construction that
binds together several codewords. We present conditions for the source code and
the channel code, and we describe how to combine any source code with any channel
code that fulfill those conditions, in order to provide capacity-achieving schemes
for asymmetric channels. In particular, we show that polar codes, spatially coupled
codes, and homophonic codes are suitable as basic building blocks of the proposed
coding strategy. Rather than focusing on the exact details of the schemes, the
purpose of this tutorial is to present different coding techniques that can then
be implemented with many variants. There is no absolute winner and, in order to
understand the most suitable technique for a specific application scenario, we
provide a detailed comparison that takes into account several performance metrics.
article_type: original
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: 'Rudiger '
full_name: 'Urbanke, Rudiger '
last_name: Urbanke
citation:
ama: Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric
channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393.
doi:10.1109/tit.2018.2789885
apa: Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity
of asymmetric channels. IEEE Transactions on Information Theory. IEEE.
https://doi.org/10.1109/tit.2018.2789885
chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the
Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory.
IEEE, 2018. https://doi.org/10.1109/tit.2018.2789885.
ieee: M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric
channels,” IEEE Transactions on Information Theory, vol. 64, no. 5. IEEE,
pp. 3371–3393, 2018.
ista: Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric
channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.
mla: Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.”
IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp.
3371–93, doi:10.1109/tit.2018.2789885.
short: M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory
64 (2018) 3371–3393.
date_created: 2019-07-24T12:38:49Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T12:50:46Z
day: '01'
doi: 10.1109/tit.2018.2789885
extern: '1'
external_id:
arxiv:
- '1406.7373'
intvolume: ' 64'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.7373
month: '05'
oa: 1
oa_version: Preprint
page: 3371-3393
publication: IEEE Transactions on Information Theory
publication_identifier:
issn:
- 0018-9448
- 1557-9654
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6740'
relation: earlier_version
status: public
status: public
title: How to achieve the capacity of asymmetric channels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2018'
...
---
_id: '6728'
abstract:
- lang: eng
text: Polar codes are a channel coding scheme for the next generation of wireless
communications standard (5G). The belief propagation (BP) decoder allows for parallel
decoding of polar codes, making it suitable for high throughput applications.
However, the error-correction performance of polar codes under BP decoding is
far from the requirements of 5G. It has been shown that the error-correction performance
of BP can be improved if the decoding is performed on multiple permuted factor
graphs of polar codes. However, a different BP decoding scheduling is required
for each factor graph permutation which results in the design of a different decoder
for each permutation. Moreover, the selection of the different factor graph permutations
is at random, which prevents the decoder to achieve a desirable error correction
performance with a small number of permutations. In this paper, we first show
that the permutations on the factor graph can be mapped into suitable permutations
on the codeword positions. As a result, we can make use of a single decoder for
all the permutations. In addition, we introduce a method to construct a set of
predetermined permutations which can provide the correct codeword if the decoding
fails on the original permutation. We show that for the 5G polar code of length
1024, the error-correction performance of the proposed decoder is more than 0.25
dB better than that of the BP decoder with the same number of random permutations
at the frame error rate of 10 -4 .
arxiv: 1
author:
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on
permuted factor graphs. In: 2018 IEEE Global Communications Conference .
IEEE; 2018. doi:10.1109/glocom.2018.8647308'
apa: 'Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the
decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications
Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308'
chicago: Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On
the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global
Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308.
ieee: N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of
polar codes on permuted factor graphs,” in 2018 IEEE Global Communications
Conference , Abu Dhabi, United Arab Emirates, 2018.
ista: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar
codes on permuted factor graphs. 2018 IEEE Global Communications Conference .
GLOBECOM: Global Communications Conference.'
mla: Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.”
2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308.
short: N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications
Conference , IEEE, 2018.
conference:
end_date: 2018-12-13
location: Abu Dhabi, United Arab Emirates
name: 'GLOBECOM: Global Communications Conference'
start_date: 2018-12-09
date_created: 2019-07-30T06:43:15Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:42Z
day: '01'
doi: 10.1109/glocom.2018.8647308
extern: '1'
external_id:
arxiv:
- '1806.11195'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.11195
month: '12'
oa: 1
oa_version: Preprint
publication: '2018 IEEE Global Communications Conference '
publication_identifier:
isbn:
- '9781538647271'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: On the decoding of polar codes on permuted factor graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
article_processing_charge: No
arxiv: 1
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2025-09-10T14:00:58Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
isi:
- '000432129600012'
intvolume: ' 171'
isi: 1
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 171
year: '2018'
...
---
_id: '691'
abstract:
- lang: eng
text: "Background: Transport protein particle (TRAPP) is a multisubunit complex
that regulates membrane trafficking through the Golgi apparatus. The clinical
phenotype associated with mutations in various TRAPP subunits has allowed elucidation
of their functions in specific tissues. The role of some subunits in human disease,
however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective:
We aimed to expand the range of neurodevelopmental disorders associated with mutations
in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods:
Linkage and homozygosity mapping and candidate gene analysis were used to identify
homozygous mutations in families. Patient fibroblasts were used to study splicing
defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals
from three unrelated families with a founder homozygous splice mutation in TRAPPC6B,
encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental
disorder characterised by microcephaly, epilepsy and autistic features, and showed
splicing defect. Zebrafish trappc6b morphants replicated the human phenotype,
displaying decreased head size and neuronal hyperexcitability, leading to a lower
seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional
evidence of the role of TRAPPC6B in brain development and function."
article_processing_charge: No
article_type: original
author:
- first_name: Isaac
full_name: Marin Valencia, Isaac
last_name: Marin Valencia
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Anide
full_name: Johansen, Anide
last_name: Johansen
- first_name: Başak
full_name: Rosti, Başak
last_name: Rosti
- first_name: Mahmoud
full_name: Issa, Mahmoud
last_name: Issa
- first_name: Damir
full_name: Musaev, Damir
last_name: Musaev
- first_name: Gifty
full_name: Bhat, Gifty
last_name: Bhat
- first_name: Eric
full_name: Scott, Eric
last_name: Scott
- first_name: Jennifer
full_name: Silhavy, Jennifer
last_name: Silhavy
- first_name: Valentina
full_name: Stanley, Valentina
last_name: Stanley
- first_name: Rasim
full_name: Rosti, Rasim
last_name: Rosti
- first_name: Jeremy
full_name: Gleeson, Jeremy
last_name: Gleeson
- first_name: Farhad
full_name: Imam, Farhad
last_name: Imam
- first_name: Maha
full_name: Zaki, Maha
last_name: Zaki
- first_name: Joseph
full_name: Gleeson, Joseph
last_name: Gleeson
citation:
ama: Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation
in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly
epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54.
doi:10.1136/jmedgenet-2017-104627
apa: Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev,
D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates
with a neurodevelopmental disorder characterised by microcephaly epilepsy and
autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627
chicago: Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud
Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B
Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy
and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group,
2018. https://doi.org/10.1136/jmedgenet-2017-104627.
ieee: I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B
associates with a neurodevelopmental disorder characterised by microcephaly epilepsy
and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ
Publishing Group, pp. 48–54, 2018.
ista: Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat
G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson
J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental
disorder characterised by microcephaly epilepsy and autistic features. Journal
of Medical Genetics. 55(1), 48–54.
mla: Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates
with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and
Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing
Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.
short: I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev,
G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki,
J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54.
date_created: 2018-12-11T11:47:57Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-04-15T07:50:28Z
day: '01'
department:
- _id: GaNo
doi: 10.1136/jmedgenet-2017-104627
external_id:
isi:
- '000418199800007'
pmid:
- '28626029'
intvolume: ' 55'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/
month: '01'
oa: 1
oa_version: Submitted Version
page: 48 - 54
pmid: 1
project:
- _id: 254BA948-B435-11E9-9278-68D0E5697425
grant_number: '401299'
name: Probing development and reversibility of autism spectrum disorders
publication: Journal of Medical Genetics
publication_identifier:
issn:
- 0022-2593
publication_status: published
publisher: BMJ Publishing Group
publist_id: '7016'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental
disorder characterised by microcephaly epilepsy and autistic features
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2018'
...
---
_id: '692'
abstract:
- lang: eng
text: We consider families of confocal conics and two pencils of Apollonian circles
having the same foci. We will show that these families of curves generate trivial
3-webs and find the exact formulas describing them.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
citation:
ama: Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata.
2018;194(1):55-64. doi:10.1007/s10711-017-0265-6
apa: Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6
chicago: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.
ieee: A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae
Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.
ista: Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. 194(1), 55–64.
mla: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.
short: A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.
corr_author: '1'
date_created: 2018-12-11T11:47:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2025-04-15T06:50:29Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s10711-017-0265-6
ec_funded: 1
external_id:
isi:
- '000431418800004'
file:
- access_level: open_access
checksum: 1febcfc1266486053a069e3425ea3713
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T11:35:08Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7222'
file_name: 2018_Springer_Akopyan.pdf
file_size: 1140860
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 194'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 55 - 64
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '7014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 3-Webs generated by confocal conics and circles
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 194
year: '2018'
...
---
_id: '7'
abstract:
- lang: eng
text: Animal social networks are shaped by multiple selection pressures, including
the need to ensure efficient communication and functioning while simultaneously
limiting disease transmission. Social animals could potentially further reduce
epidemic risk by altering their social networks in the presence of pathogens,
yet there is currently no evidence for such pathogen-triggered responses. We tested
this hypothesis experimentally in the ant Lasius niger using a combination of
automated tracking, controlled pathogen exposure, transmission quantification,
and temporally explicit simulations. Pathogen exposure induced behavioral changes
in both exposed ants and their nestmates, which helped contain the disease by
reinforcing key transmission-inhibitory properties of the colony's contact network.
This suggests that social network plasticity in response to pathogens is an effective
strategy for mitigating the effects of disease in social groups.
acknowledgement: This project was funded by two European Research Council Advanced
Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science
Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research
Council Starting Grant (SocialVaccines, 243071) to S.C.
article_processing_charge: No
article_type: original
author:
- first_name: Nathalie
full_name: Stroeymeyt, Nathalie
last_name: Stroeymeyt
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Alessandro
full_name: Crespi, Alessandro
last_name: Crespi
- first_name: Danielle
full_name: Mersch, Danielle
last_name: Mersch
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Laurent
full_name: Keller, Laurent
last_name: Keller
citation:
ama: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network
plasticity decreases disease transmission in a eusocial insect. Science.
2018;362(6417):941-945. doi:10.1126/science.aat4793
apa: Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller,
L. (2018). Social network plasticity decreases disease transmission in a eusocial
insect. Science. AAAS. https://doi.org/10.1126/science.aat4793
chicago: Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch,
Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease
Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.
ieee: N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller,
“Social network plasticity decreases disease transmission in a eusocial insect,”
Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.
ista: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social
network plasticity decreases disease transmission in a eusocial insect. Science.
362(6417), 941–945.
mla: Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission
in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45,
doi:10.1126/science.aat4793.
short: N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science
362 (2018) 941–945.
date_created: 2018-12-11T11:44:07Z
date_published: 2018-11-23T00:00:00Z
date_updated: 2025-04-15T08:20:52Z
day: '23'
department:
- _id: SyCr
doi: 10.1126/science.aat4793
ec_funded: 1
external_id:
isi:
- '000451124500041'
intvolume: ' 362'
isi: 1
issue: '6417'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf
month: '11'
oa: 1
oa_version: Published Version
page: 941 - 945
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
publication: Science
publication_identifier:
issn:
- 1095-9203
publication_status: published
publisher: AAAS
publist_id: '8049'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/
record:
- id: '13055'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Social network plasticity decreases disease transmission in a eusocial insect
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 362
year: '2018'
...
---
_id: '70'
abstract:
- lang: eng
text: We consider the totally asymmetric simple exclusion process in a critical
scaling parametrized by a≥0, which creates a shock in the particle density of
order aT−1/3, T the observation time. When starting from step initial data, we
provide bounds on the limiting law which in particular imply that in the double
limit lima→∞limT→∞ one recovers the product limit law and the degeneration of
the correlation length observed at shocks of order 1. This result is shown to
apply to a general last-passage percolation model. We also obtain bounds on the
two-point functions of several airy processes.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
citation:
ama: Nejjar P. Transition to shocks in TASEP and decoupling of last passage times.
Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334.
doi:10.30757/ALEA.v15-49
apa: Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage
times. Latin American Journal of Probability and Mathematical Statistics.
Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49
chicago: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage
Times.” Latin American Journal of Probability and Mathematical Statistics.
Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49.
ieee: P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,”
Latin American Journal of Probability and Mathematical Statistics, vol.
15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.
ista: Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage
times. Latin American Journal of Probability and Mathematical Statistics. 15(2),
1311–1334.
mla: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage
Times.” Latin American Journal of Probability and Mathematical Statistics,
vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34,
doi:10.30757/ALEA.v15-49.
short: P. Nejjar, Latin American Journal of Probability and Mathematical Statistics
15 (2018) 1311–1334.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2025-04-14T07:27:49Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
- _id: JaMa
doi: 10.30757/ALEA.v15-49
ec_funded: 1
external_id:
arxiv:
- '1705.08836'
isi:
- '000460475800022'
file:
- access_level: open_access
checksum: 2ded46aa284a836a8cbb34133a64f1cb
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T09:44:10Z
date_updated: 2020-07-14T12:47:46Z
file_id: '5981'
file_name: 2018_ALEA_Nejjar.pdf
file_size: 394851
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1311-1334
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Latin American Journal of Probability and Mathematical Statistics
publication_identifier:
issn:
- 1980-0436
publication_status: published
publisher: Instituto Nacional de Matematica Pura e Aplicada
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transition to shocks in TASEP and decoupling of last passage times
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2018'
...
---
_id: '705'
abstract:
- lang: eng
text: Although dopamine receptors D1 and D2 play key roles in hippocampal function,
their synaptic localization within the hippocampus has not been fully elucidated.
In order to understand precise functions of pre- or postsynaptic dopamine receptors
(DRs), the development of protocols to differentiate pre- and postsynaptic DRs
is essential. So far, most studies on determination and quantification of DRs
did not discriminate between subsynaptic localization. Therefore, the aim of the
study was to generate a robust workflow for the localization of DRs. This work
provides the basis for future work on hippocampal DRs, in light that DRs may have
different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi
isolated by a sucrose gradient protocol were prepared for super-resolution direct
stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic
zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated
antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594
enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites.
D1R immunoreactivity clusters were observed within the presynaptic active zone
as well as at perisynaptic sites at the edge of the presynaptic active zone. The
results may be useful for the interpretation of previous studies and the design
of future work on DRs in the hippocampus. Moreover, the reduction of the complexity
of brain tissue by the use of synaptosomal preparations and dSTORM technology
may represent a useful tool for synaptic localization of brain proteins.
article_processing_charge: No
author:
- first_name: Andras
full_name: Miklosi, Andras
last_name: Miklosi
- first_name: Giorgia
full_name: Del Favero, Giorgia
last_name: Del Favero
- first_name: Tanja
full_name: Bulat, Tanja
last_name: Bulat
- first_name: Harald
full_name: Höger, Harald
last_name: Höger
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Doris
full_name: Marko, Doris
last_name: Marko
- first_name: Gert
full_name: Lubec, Gert
last_name: Lubec
citation:
ama: Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization
of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y
apa: Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D.,
& Lubec, G. (2018). Super resolution microscopical localization of dopamine
receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
Springer. https://doi.org/10.1007/s12035-017-0688-y
chicago: Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi
Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization
of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology.
Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.
ieee: A. Miklosi et al., “Super resolution microscopical localization of
dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology,
vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.
ista: Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G.
2018. Super resolution microscopical localization of dopamine receptors 1 and
2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.
mla: Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine
Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology,
vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.
short: A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G.
Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.
date_created: 2018-12-11T11:48:02Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-19T09:58:11Z
day: '01'
department:
- _id: RySh
doi: 10.1007/s12035-017-0688-y
external_id:
isi:
- '000431991500025'
intvolume: ' 55'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 4857 – 4869
publication: Molecular Neurobiology
publication_status: published
publisher: Springer
publist_id: '6991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution microscopical localization of dopamine receptors 1 and 2 in
rat hippocampal synaptosomes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 55
year: '2018'
...
---
_id: '7058'
abstract:
- lang: eng
text: We examine recent magnetic torque measurements in two compounds, γ−Li2IrO3
and RuCl3, which have been discussed as possible realizations of the Kitaev model.
The analysis of the reported discontinuity in torque, as an external magnetic
field is rotated across the c axis in both crystals, suggests that they have a
translationally invariant chiral spin order of the form ⟨Si⋅(Sj×Sk)⟩≠0 in the
ground state and persisting over a very wide range of magnetic field and temperature.
An extraordinary |B|B2 dependence of the torque for small fields, beside the usual
B2 part, is predicted by the chiral spin order. Data for small fields are available
for γ−Li2IrO3 and are found to be consistent with the prediction upon further
analysis. Other experiments such as inelastic scattering and thermal Hall effect
and several questions raised by the discovery of chiral spin order, including
its topological consequences, are discussed.
article_number: '205110 '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: A.
full_name: Shekhter, A.
last_name: Shekhter
- first_name: C. M.
full_name: Varma, C. M.
last_name: Varma
citation:
ama: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. Chiral spin order in some purported
Kitaev spin-liquid compounds. Physical Review B. 2018;98(20). doi:10.1103/physrevb.98.205110
apa: Modic, K. A., Ramshaw, B. J., Shekhter, A., & Varma, C. M. (2018). Chiral
spin order in some purported Kitaev spin-liquid compounds. Physical Review
B. APS. https://doi.org/10.1103/physrevb.98.205110
chicago: Modic, Kimberly A, B. J. Ramshaw, A. Shekhter, and C. M. Varma. “Chiral
Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” Physical Review
B. APS, 2018. https://doi.org/10.1103/physrevb.98.205110.
ieee: K. A. Modic, B. J. Ramshaw, A. Shekhter, and C. M. Varma, “Chiral spin order
in some purported Kitaev spin-liquid compounds,” Physical Review B, vol.
98, no. 20. APS, 2018.
ista: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. 2018. Chiral spin order in some
purported Kitaev spin-liquid compounds. Physical Review B. 98(20), 205110.
mla: Modic, Kimberly A., et al. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid
Compounds.” Physical Review B, vol. 98, no. 20, 205110, APS, 2018, doi:10.1103/physrevb.98.205110.
short: K.A. Modic, B.J. Ramshaw, A. Shekhter, C.M. Varma, Physical Review B 98 (2018).
date_created: 2019-11-19T13:01:31Z
date_published: 2018-11-05T00:00:00Z
date_updated: 2021-01-12T08:11:36Z
day: '05'
doi: 10.1103/physrevb.98.205110
extern: '1'
external_id:
arxiv:
- '1807.06637'
intvolume: ' 98'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.06637
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: APS
quality_controlled: '1'
status: public
title: Chiral spin order in some purported Kitaev spin-liquid compounds
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...