Bethe $M$-layer construction for the percolation problem

One way to perform field theory computations for the bond percolation problem is through the Kasteleyn and Fortuin mapping to the n+1 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> states Potts model in the limit of n \to 0 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>→</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> . In this paper, we show that it is possible to recover the \epsilon <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>ϵ</mml:mi> </mml:math> -expansion for critical exponents in finite dimension directly using the M <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>M</mml:mi> </mml:math> -layer expansion, without the need to perform any analytical continuation. Moreover, we also show explicitly that the critical exponents for site and bond percolation are the same. This computation provides a reference for applications of the M <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>M</mml:mi> </mml:math> -layer method to systems where the underlying field theory is unknown or disputed.

Authors

Institutions

Publication Details

Journal
SciPost Physics
Published
2025-01-23
DOI
https://doi.org/10.21468/scipostphys.18.1.030
Citations
3
Primary Topic
Random Matrices and Applications
Type
article
Field-Weighted Citation Impact
7.89
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bethe $M$-layer construction for the percolation problem

Marco Tarzia, Maria Chiara Angelini, Tommaso Rizzo, Saverio Palazzi
3 citations
SciPost Physics
Random Matrices and Applications
7.89
article

Bethe $M$-layer construction for the percolation problem

Marco Tarzia, Maria Chiara Angelini, Tommaso Rizzo, Saverio Palazzi
article en
3 citations

Abstract

One way to perform field theory computations for the bond percolation problem is through the Kasteleyn and Fortuin mapping to the n+1 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> states Potts model in the limit of n \to 0 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>→</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> . In this paper, we show that it is possible to recover the \epsilon <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>ϵ</mml:mi> </mml:math> -expansion for critical exponents in finite dimension directly using the M <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>M</mml:mi> </mml:math> -layer expansion, without the need to perform any analytical continuation. Moreover, we also show explicitly that the critical exponents for site and bond percolation are the same. This computation provides a reference for applications of the M <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>M</mml:mi> </mml:math> -layer method to systems where the underlying field theory is unknown or disputed.

SciPost PhysicsVol. 18(1)
Institut Universitaire de France (FR), Laboratoire de Physique Théorique de la Matière Condensée (FR), Institute for Complex Systems (IT), Istituto Nazionale di Fisica Nucleare, Sezione di Roma I (IT), Sapienza University of Rome (IT)
Openalex Percentile: Top 3%
Random Matrices and Applications
7.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.