Entanglement entropy of random partitioning

Gergo Roósz, István A. Kovács, Ferenc Iglói

Research output: Contribution to journalArticlepeer-review


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 L, the points of which with probability p belong to the subsystem. The leading contribution to the average entanglement entropy is found to scale with the volume as a(p)LD, where a(p) is a non-universal function, to which there is a logarithmic correction term, b(p)LD1 ln L. In 1D the prefactor is given by b(p) = 3c f(p), where c is the central charge of the model and f(p) is a universal function. In 2D the prefactor has a different functional form of p below and above the percolation threshold.

Original languageEnglish (US)
JournalUnknown Journal
StatePublished - Oct 14 2019

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'Entanglement entropy of random partitioning'. Together they form a unique fingerprint.

Cite this