Author Correction: Hypergraph reconstruction from network data (Communications Physics, (2021), 4, 1, (135), 10.1038/s42005-021-00637-w)

Jean Gabriel Young; Giovanni Petri; Tiago P. Peixoto

doi:10.1038/s42005-022-00846-x

Author Correction: Hypergraph reconstruction from network data (Communications Physics, (2021), 4, 1, (135), 10.1038/s42005-021-00637-w)

Jean Gabriel Young, Giovanni Petri, Tiago P. Peixoto

Research output: Contribution to journal › Comment/debate › peer-review

Abstract

The authors have corrected the mistake and verified that the properties of Eq. (12) derived in the original article still hold. They have also re-ran every calculation using the updated equation. The empirical findings are qualitatively unchanged; the authors have found highly similar compression ratios when comparing the clique descriptions to the optimal descriptions obtained by minimising the description length (DL). The exact values of the minimum description length (MDL) are different since the modification to Eq. (12) changes the absolute value of P(H), and since the Monte Carlo Markov chain algorithm is stochastic and therefore yields slightly different results from runs to runs. Below is a detailed list of changes brought about by modifying Eq. (12) and running new simulations.

Original language	English
Article number	74
Journal	Communications Physics
Volume	5
Issue number	1
DOIs	https://doi.org/10.1038/s42005-022-00846-x
Publication status	Published - 29 Mar 2022

Bibliographical note

Funding Information:
The authors thank Huan Wang, Yanbang Wang, and Kyuhan Lee for bringing the mistake in Eq. (12) to their attention.

Funding

The authors thank Huan Wang, Yanbang Wang, and Kyuhan Lee for bringing the mistake in Eq. (12) to their attention.

ASJC Scopus subject areas

General Physics and Astronomy

Access to Document

10.1038/s42005-022-00846-xLicence: CC BY

Cite this

@article{eded7d6aebde4a7ca7d6bc8f696208f3,

title = "Author Correction: Hypergraph reconstruction from network data (Communications Physics, (2021), 4, 1, (135), 10.1038/s42005-021-00637-w)",

abstract = "The authors have corrected the mistake and verified that the properties of Eq. (12) derived in the original article still hold. They have also re-ran every calculation using the updated equation. The empirical findings are qualitatively unchanged; the authors have found highly similar compression ratios when comparing the clique descriptions to the optimal descriptions obtained by minimising the description length (DL). The exact values of the minimum description length (MDL) are different since the modification to Eq. (12) changes the absolute value of P(H), and since the Monte Carlo Markov chain algorithm is stochastic and therefore yields slightly different results from runs to runs. Below is a detailed list of changes brought about by modifying Eq. (12) and running new simulations.",

author = "Young, {Jean Gabriel} and Giovanni Petri and Peixoto, {Tiago P.}",

note = "Funding Information: The authors thank Huan Wang, Yanbang Wang, and Kyuhan Lee for bringing the mistake in Eq. (12) to their attention. ",

year = "2022",

month = mar,

day = "29",

doi = "10.1038/s42005-022-00846-x",

language = "English",

volume = "5",

journal = "Communications Physics",

issn = "2399-3650",

publisher = "Springer Nature",

number = "1",

}

TY - JOUR

T1 - Author Correction

T2 - Hypergraph reconstruction from network data (Communications Physics, (2021), 4, 1, (135), 10.1038/s42005-021-00637-w)

AU - Young, Jean Gabriel

AU - Petri, Giovanni

AU - Peixoto, Tiago P.

N1 - Funding Information: The authors thank Huan Wang, Yanbang Wang, and Kyuhan Lee for bringing the mistake in Eq. (12) to their attention.

PY - 2022/3/29

Y1 - 2022/3/29

N2 - The authors have corrected the mistake and verified that the properties of Eq. (12) derived in the original article still hold. They have also re-ran every calculation using the updated equation. The empirical findings are qualitatively unchanged; the authors have found highly similar compression ratios when comparing the clique descriptions to the optimal descriptions obtained by minimising the description length (DL). The exact values of the minimum description length (MDL) are different since the modification to Eq. (12) changes the absolute value of P(H), and since the Monte Carlo Markov chain algorithm is stochastic and therefore yields slightly different results from runs to runs. Below is a detailed list of changes brought about by modifying Eq. (12) and running new simulations.

AB - The authors have corrected the mistake and verified that the properties of Eq. (12) derived in the original article still hold. They have also re-ran every calculation using the updated equation. The empirical findings are qualitatively unchanged; the authors have found highly similar compression ratios when comparing the clique descriptions to the optimal descriptions obtained by minimising the description length (DL). The exact values of the minimum description length (MDL) are different since the modification to Eq. (12) changes the absolute value of P(H), and since the Monte Carlo Markov chain algorithm is stochastic and therefore yields slightly different results from runs to runs. Below is a detailed list of changes brought about by modifying Eq. (12) and running new simulations.

UR - http://www.scopus.com/inward/record.url?scp=85127397269&partnerID=8YFLogxK

U2 - 10.1038/s42005-022-00846-x

DO - 10.1038/s42005-022-00846-x

M3 - Comment/debate

AN - SCOPUS:85127397269

SN - 2399-3650

VL - 5

JO - Communications Physics

JF - Communications Physics

IS - 1

M1 - 74

ER -

Author Correction: Hypergraph reconstruction from network data (Communications Physics, (2021), 4, 1, (135), 10.1038/s42005-021-00637-w)

Abstract

Bibliographical note

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this