---
_id: '5859'
abstract:
- lang: eng
text: The emergence of syntax during childhood is a remarkable example of how complex
correlations unfold in nonlinear ways through development. In particular, rapid
transitions seem to occur as children reach the age of two, which seems to separate
a two-word, tree-like network of syntactic relations among words from the scale-free
graphs associated with the adult, complex grammar. Here, we explore the evolution
of syntax networks through language acquisition using the chromatic number, which
captures the transition and provides a natural link to standard theories on syntactic
structures. The data analysis is compared to a null model of network growth dynamics
which is shown to display non-trivial and sensible differences. At a more general
level, we observe that the chromatic classes define independent regions of the
graph, and thus, can be interpreted as the footprints of incompatibility relations,
somewhat as opposed to modularity considerations.
acknowledgement: This work was supported by the James McDonnell Foundation (B.C-M.,
S.V. and R.S.)
article_number: '181286'
article_processing_charge: No
article_type: original
author:
- first_name: Bernat
full_name: Corominas-Murtra, Bernat
id: 43BE2298-F248-11E8-B48F-1D18A9856A87
last_name: Corominas-Murtra
orcid: 0000-0001-9806-5643
- first_name: Martí Sànchez
full_name: Fibla, Martí Sànchez
last_name: Fibla
- first_name: Sergi
full_name: Valverde, Sergi
last_name: Valverde
- first_name: Ricard
full_name: Solé, Ricard
last_name: Solé
citation:
ama: Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in
the emergence of syntax networks. Royal Society Open Science. 2018;5(12).
doi:10.1098/rsos.181286
apa: Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic
transitions in the emergence of syntax networks. Royal Society Open Science.
The Royal Society. https://doi.org/10.1098/rsos.181286
chicago: Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard
Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society
Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286.
ieee: B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions
in the emergence of syntax networks,” Royal Society Open Science, vol.
5, no. 12. The Royal Society, 2018.
ista: Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions
in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286.
mla: Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of
Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The
Royal Society, 2018, doi:10.1098/rsos.181286.
short: B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open
Science 5 (2018).
date_created: 2019-01-20T22:59:18Z
date_published: 2018-12-12T00:00:00Z
date_updated: 2023-10-18T06:41:12Z
day: '12'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1098/rsos.181286
external_id:
isi:
- '000456566500027'
pmid:
- '30662738'
file:
- access_level: open_access
checksum: 9664d4417f6b792242e31eea77ce9501
content_type: application/pdf
creator: dernst
date_created: 2019-02-05T14:38:09Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5924'
file_name: 2018_RoyalSocOS_Corominas.pdf
file_size: 646732
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Royal Society Open Science
publication_identifier:
issn:
- 2054-5703
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chromatic transitions in the emergence of syntax networks
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: 5
year: '2018'
...
---
_id: '6183'
abstract:
- lang: eng
text: "We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z
- a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq
0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element
of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$.
We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued
measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this
measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect
to the Lebesgue measure, which\r\nis supported on finitely many intervals, called
bands. In fact, the density is\r\nanalytic inside the bands with a square-root
growth at the edges and internal\r\ncubic root cusps whenever the gap between
two bands vanishes. The shape of\r\nthese singularities is universal and no other
singularity may occur. We give a\r\nprecise asymptotic description of $m$ near
the singular points. These\r\nasymptotics generalize the analysis at the regular
edges given in the companion\r\npaper on the Tracy-Widom universality for the
edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744]
and they play a key role in the\r\nproof of the Pearcey universality at the cusp
for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend
the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von
Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically
rigid under\r\ndeformations and we conclude that these masses are quantized in
some important\r\ncases."
article_number: '1804.07752'
article_processing_charge: No
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. arXiv.'
apa: 'Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear
self-energy: Spectral bands, edges and cusps. arXiv.'
chicago: 'Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation
with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, n.d.'
ieee: 'J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy:
Spectral bands, edges and cusps,” arXiv. .'
ista: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. arXiv, 1804.07752.'
mla: 'Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral
Bands, Edges and Cusps.” ArXiv, 1804.07752.'
short: J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).
date_created: 2019-03-28T09:20:06Z
date_published: 2018-04-20T00:00:00Z
date_updated: 2023-12-18T10:46:08Z
day: '20'
department:
- _id: LaEr
external_id:
arxiv:
- '1804.07752'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07752
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
- id: '14694'
relation: later_version
status: public
status: public
title: 'The Dyson equation with linear self-energy: Spectral bands, edges and cusps'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '75'
abstract:
- lang: eng
text: We prove that any convex body in the plane can be partitioned into m convex
parts of equal areas and perimeters for any integer m≥2; this result was previously
known for prime powers m=pk. We also give a higher-dimensional generalization.
article_number: '1804.03057'
article_processing_charge: No
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number
of pieces. 2018. doi:10.48550/arXiv.1804.03057
apa: Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions
into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057
chicago: Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions
into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.
ieee: A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary
number of pieces.” arXiv, 2018.
ista: Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary
number of pieces. 1804.03057.
mla: Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of
Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.
short: A. Akopyan, S. Avvakumov, R. Karasev, (2018).
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-13T00:00:00Z
date_updated: 2023-12-18T10:51:02Z
day: '13'
department:
- _id: HeEd
- _id: JaMa
doi: 10.48550/arXiv.1804.03057
ec_funded: 1
external_id:
arxiv:
- '1804.03057'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.03057
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication_status: published
publisher: arXiv
related_material:
record:
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Convex fair partitions into arbitrary number of pieces
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '556'
abstract:
- lang: eng
text: 'We investigate the free boundary Schur process, a variant of the Schur process
introduced by Okounkov and Reshetikhin, where we allow the first and the last
partitions to be arbitrary (instead of empty in the original setting). The pfaffian
Schur process, previously studied by several authors, is recovered when just one
of the boundary partitions is left free. We compute the correlation functions
of the process in all generality via the free fermion formalism, which we extend
with the thorough treatment of “free boundary states.” For the case of one free
boundary, our approach yields a new proof that the process is pfaffian. For the
case of two free boundaries, we find that the process is not pfaffian, but a closely
related process is. We also study three different applications of the Schur process
with one free boundary: fluctuations of symmetrized last passage percolation models,
limit shapes and processes for symmetric plane partitions and for plane overpartitions.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Dan
full_name: Betea, Dan
last_name: Betea
- first_name: Jeremie
full_name: Bouttier, Jeremie
last_name: Bouttier
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
- first_name: Mirjana
full_name: Vuletic, Mirjana
last_name: Vuletic
citation:
ama: Betea D, Bouttier J, Nejjar P, Vuletic M. The free boundary Schur process and
applications I. Annales Henri Poincare. 2018;19(12):3663-3742. doi:10.1007/s00023-018-0723-1
apa: Betea, D., Bouttier, J., Nejjar, P., & Vuletic, M. (2018). The free boundary
Schur process and applications I. Annales Henri Poincare. Springer Nature.
https://doi.org/10.1007/s00023-018-0723-1
chicago: Betea, Dan, Jeremie Bouttier, Peter Nejjar, and Mirjana Vuletic. “The Free
Boundary Schur Process and Applications I.” Annales Henri Poincare. Springer
Nature, 2018. https://doi.org/10.1007/s00023-018-0723-1.
ieee: D. Betea, J. Bouttier, P. Nejjar, and M. Vuletic, “The free boundary Schur
process and applications I,” Annales Henri Poincare, vol. 19, no. 12. Springer
Nature, pp. 3663–3742, 2018.
ista: Betea D, Bouttier J, Nejjar P, Vuletic M. 2018. The free boundary Schur process
and applications I. Annales Henri Poincare. 19(12), 3663–3742.
mla: Betea, Dan, et al. “The Free Boundary Schur Process and Applications I.” Annales
Henri Poincare, vol. 19, no. 12, Springer Nature, 2018, pp. 3663–742, doi:10.1007/s00023-018-0723-1.
short: D. Betea, J. Bouttier, P. Nejjar, M. Vuletic, Annales Henri Poincare 19 (2018)
3663–3742.
date_created: 2018-12-11T11:47:09Z
date_published: 2018-11-13T00:00:00Z
date_updated: 2024-02-20T10:48:17Z
day: '13'
ddc:
- '500'
department:
- _id: LaEr
- _id: JaMa
doi: 10.1007/s00023-018-0723-1
ec_funded: 1
external_id:
arxiv:
- '1704.05809'
file:
- access_level: open_access
checksum: 0c38abe73569b7166b7487ad5d23cc68
content_type: application/pdf
creator: dernst
date_created: 2019-01-21T15:18:55Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5866'
file_name: 2018_Annales_Betea.pdf
file_size: 3084674
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
intvolume: ' 19'
issue: '12'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 3663-3742
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: Annales Henri Poincare
publication_identifier:
issn:
- 1424-0637
publication_status: published
publisher: Springer Nature
publist_id: '7258'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The free boundary Schur process and applications I
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: '5573'
abstract:
- lang: eng
text: Graph matching problems for large displacement optical flow of RGB-D images.
article_processing_charge: No
author:
- first_name: Hassan
full_name: Alhaija, Hassan
last_name: Alhaija
- first_name: Anita
full_name: Sellent, Anita
last_name: Sellent
- first_name: Daniel
full_name: Kondermann, Daniel
last_name: Kondermann
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: Alhaija H, Sellent A, Kondermann D, Rother C. Graph matching problems for GraphFlow
– 6D Large Displacement Scene Flow. 2018. doi:10.15479/AT:ISTA:82
apa: Alhaija, H., Sellent, A., Kondermann, D., & Rother, C. (2018). Graph matching
problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:82
chicago: Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother.
“Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute
of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:82.
ieee: H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, “Graph matching problems
for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology
Austria, 2018.
ista: Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems
for GraphFlow – 6D Large Displacement Scene Flow, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:82.
mla: Alhaija, Hassan, et al. Graph Matching Problems for GraphFlow – 6D Large
Displacement Scene Flow. Institute of Science and Technology Austria, 2018,
doi:10.15479/AT:ISTA:82.
short: H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).
contributor:
- contributor_type: researcher
first_name: Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
datarep_id: '82'
date_created: 2018-12-12T12:31:36Z
date_published: 2018-01-04T00:00:00Z
date_updated: 2024-02-21T13:41:17Z
day: '04'
ddc:
- '001'
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:82
file:
- access_level: open_access
checksum: 53c17082848e12f3c2e1b4185b578208
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:34Z
date_updated: 2020-07-14T12:47:05Z
file_id: '5600'
file_name: IST-2018-82-v1+1_GraphFlowMatchingProblems.zip
file_size: 1737958
relation: main_file
file_date_updated: 2020-07-14T12:47:05Z
has_accepted_license: '1'
keyword:
- graph matching
- quadratic assignment problem<
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '01'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
link:
- relation: research_paper
url: https://doi.org/10.1007/978-3-319-24947-6_23
status: public
title: Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...