English

Entanglement entropy of random partitioning

Disordered Systems and Neural Networks 2022-02-18 v1

Abstract

We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent LL, the points of which with probability pp belong to the subsystem. The leading contribution to the average entanglement entropy is found to scale with the volume as a(p)LDa(p) L^D, where a(p)a(p) is a non-universal function, to which there is a logarithmic correction term, b(p)LD1lnLb(p)L^{D-1}\ln L. In 1D1D the prefactor is given by b(p)=c3f(p)b(p)=\frac{c}{3} f(p), where cc is the central charge of the model and f(p)f(p) is a universal function. In 2D2D the prefactor has a different functional form of pp below and above the percolation threshold.

Keywords

Cite

@article{arxiv.1910.06018,
  title  = {Entanglement entropy of random partitioning},
  author = {Gergö Roósz and István A. Kovács and Ferenc Iglói},
  journal= {arXiv preprint arXiv:1910.06018},
  year   = {2022}
}

Comments

9 pages, 9 figures

R2 v1 2026-06-23T11:42:46.098Z