Andrea Sportiello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Andrea Sportiello has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Filippo Colomo
INFN, Sezione di Firenze
6 shared publications - Andrei Georgievich Pronko
Steklov Mathematical Institute
4 shared publications - Sergio Caracciolo
Dipartimento di Fisica University of Milan and INFN via Celoria 16 20133 Milan Italy
3 shared publications - Vittorio Erba
École Polytechnique Fédérale de Lausanne
2 shared publications - Adrian Tanasa
LIPN UMR CNRS 7030 Univ Paris 13
1 shared publication - Axel Bacher
RISC, Johannes Kepler University, Linz, Austria
1 shared publication
Latest Publications
- Open Access
- 18 February 2025
- Published by Stichting SciPost in SciPost Physics
- Vol. 18 (2) , 057
Universality of closed nested paths in two-dimensional percolation
Recent work on percolation in d=2 [J. Phys. A: Math. Theor. 55, 204002 (2015)] introduced an operator that gives a weight k^{\ell} to configurations with \ell ‘nested paths’ (NP), i.e. disjoint cycles surrounding the origin, if there exists a cluster that percolates to the boundary of a disc of radius L , and weight zero otherwise. It was found that \mathbb{E}(k^{\ell}) \sim L^{-X_{NP}(k)} , and a formula for X_{NP}(k) was conjectured. Here we derive an exact result for X_{NP}(k) , valid for k ≥ -1 , replacing the previous conjecture. We find that the probability distribution \mathbb{P}_\ell (L) scales as $ L^{-1/4} (L)^ℓ[(1/ℓ!) Λ^ℓ]$ when \ell ≥ 0 and L \gg 1 , with \Lambda = 1/\sqrt{3} \pi . Extensive simulations for various critical percolation models confirm our theoretical predictions and support the universality of the NP observables.- 18 February 2025
- Published by Stichting SciPost in SciPost Physics
- Vol. 18 (2) , 057
Open AccessUniversality of closed nested paths in two-dimensional percolation
Recent work on percolation in d=2 [J. Phys. A: Math. Theor. 55, 204002 (2015)] introduced an operator that gives a weight k^{\ell} to configurations with \ell ‘nested paths’ (NP), i.e. disjoint cycles surrounding the origin, if there exists a cluster that percolates to the boundary of a disc of radius L , and weight zero otherwise. It was found that \mathbb{E}(k^{\ell}) \sim L^{-X_{NP}(k)} , and a formula for X_{NP}(k) was conjectured. Here we derive an exact result for X_{NP}(k) , valid for k ≥ -1 , replacing the previous conjecture. We find that the probability distribution \mathbb{P}_\ell (L) scales as $ L^{-1/4} (L)^ℓ[(1/ℓ!) Λ^ℓ]$ when \ell ≥ 0 and L \gg 1 , with \Lambda = 1/\sqrt{3} \pi . Extensive simulations for various critical percolation models confirm our theoretical predictions and support the universality of the NP observables. - Open Access
- 21 March 2021
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 183 (1) , 1-27
The Number of Optimal Matchings for Euclidean Assignment on the Line
We consider the Random Euclidean Assignment Problem in dimension $$d=1$$ , with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings (say, $$\sim \exp (S_N)$$ at size N). We characterize all possible optimal matchings of a given instance of the problem, and we give a simple product formula for their number. Then, we study the probability distribution of $$S_N$$ (the zero-temperature entropy of the model), in the uniform random ensemble. We find that, for large N, $$S_N \sim \frac{1}{2} N \log N + N s + {\mathcal {O}}\left( \log N \right) $$ , where s is a random variable whose distribution p(s) does not depend on N. We give expressions for the moments of p(s), both from a formulation as a Brownian process, and via singularity analysis of the generating functions associated to $$S_N$$ . The latter approach provides a combinatorial framework that allows to compute an asymptotic expansion to arbitrary order in 1/N for the mean and the variance of $$S_N$$ .- 21 March 2021
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 183 (1) , 1-27
Open AccessThe Number of Optimal Matchings for Euclidean Assignment on the Line
We consider the Random Euclidean Assignment Problem in dimension $$d=1$$ , with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings (say, $$\sim \exp (S_N)$$ at size N). We characterize all possible optimal matchings of a given instance of the problem, and we give a simple product formula for their number. Then, we study the probability distribution of $$S_N$$ (the zero-temperature entropy of the model), in the uniform random ensemble. We find that, for large N, $$S_N \sim \frac{1}{2} N \log N + N s + {\mathcal {O}}\left( \log N \right) $$ , where s is a random variable whose distribution p(s) does not depend on N. We give expressions for the moments of p(s), both from a formulation as a Brownian process, and via singularity analysis of the generating functions associated to $$S_N$$ . The latter approach provides a combinatorial framework that allows to compute an asymptotic expansion to arbitrary order in 1/N for the mean and the variance of $$S_N$$ . - 14 January 2020
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 53 (6) , 064001
The Dyck bound in the concave 1-dimensional random assignment model
We consider models of assignment for random N blue points and N red points on an interval of length 2 N , in which the cost for connecting a blue point in x to a red point in y is the concave function | x − y | p , for 0 < p < 1. Contrarily to the convex case p > 1, where the optimal matching is trivially determined, here the optimization is non-trivial. The purpose of this paper is to introduce a special configuration, that we call the Dyck matching , and to study its statistical properties. We compute exactly the average cost, in the asymptotic limit of large N , together with the first subleading correction. The scaling is remarkable: it is of order N for , order for , and for , and it is universal for a wide class of models. We conjecture that the average cost of the Dyck matching has the same scaling in N as the cost of the optimal matching, and we produce numerical data in support of this conjecture. We hope to produce a proof of this claim in future work.
- 14 January 2020
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 53 (6) , 064001
The Dyck bound in the concave 1-dimensional random assignment model
We consider models of assignment for random N blue points and N red points on an interval of length 2 N , in which the cost for connecting a blue point in x to a red point in y is the concave function | x − y | p , for 0 < p < 1. Contrarily to the convex case p > 1, where the optimal matching is trivially determined, here the optimization is non-trivial. The purpose of this paper is to introduce a special configuration, that we call the Dyck matching , and to study its statistical properties. We compute exactly the average cost, in the asymptotic limit of large N , together with the first subleading correction. The scaling is remarkable: it is of order N for , order for , and for , and it is universal for a wide class of models. We conjecture that the average cost of the Dyck matching has the same scaling in N as the cost of the optimal matching, and we produce numerical data in support of this conjecture. We hope to produce a proof of this claim in future work.
- 17 October 2018
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 174 (1) , 1-27
Arctic Curve of the Free-Fermion Six-Vertex Model in an L-Shaped Domain
- 17 October 2018
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 174 (1) , 1-27
Arctic Curve of the Free-Fermion Six-Vertex Model in an L-Shaped Domain
- Open Access
Arctic curve of the free-fermion six-vertex model in an L-shaped domain
We consider the six-vertex model in an L-shaped domain of the square lattice, with domain wall boundary conditions, in the case of free-fermion vertex weights. We describe how the recently developed `Tangent method' can be used to determine the form of the arctic curve. The obtained result is in agreement with numerics.
Open AccessArctic curve of the free-fermion six-vertex model in an L-shaped domain
We consider the six-vertex model in an L-shaped domain of the square lattice, with domain wall boundary conditions, in the case of free-fermion vertex weights. We describe how the recently developed `Tangent method' can be used to determine the form of the arctic curve. The obtained result is in agreement with numerics.
- Open Access
A combinatorial approach to Rauzy-type dynamics I: permutations and the Kontsevich--Zorich--Boissy classification theorem
Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example concerns an action on permutations, associated to interval exchange transformations (IET) for the Poincar\'e map on compact orientable translation surfaces. The equivalence classes on the objects induced by the group action are related to components of the moduli spaces of Abelian differentials with prescribed singularities, and, in two variants of the problem, have been classified by Kontsevich and Zorich, and by Boissy, through methods involving both combinatorics and algebraic geometry. We provide here a purely combinatorial proof of both classification theorems, and in passing establish a few previously unnoticed features. As will be shown elsewhere, our methods extend also to other Rauzy-type dynamics, both on labeled and unlabeled structures. Some of these dynamics have a geometrical interpretation (e.g., matchings, related to IET on non-orientable surfaces), while some others do not have one so far.
Open AccessA combinatorial approach to Rauzy-type dynamics I: permutations and the Kontsevich--Zorich--Boissy classification theorem
Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example concerns an action on permutations, associated to interval exchange transformations (IET) for the Poincar\'e map on compact orientable translation surfaces. The equivalence classes on the objects induced by the group action are related to components of the moduli spaces of Abelian differentials with prescribed singularities, and, in two variants of the problem, have been classified by Kontsevich and Zorich, and by Boissy, through methods involving both combinatorics and algebraic geometry. We provide here a purely combinatorial proof of both classification theorems, and in passing establish a few previously unnoticed features. As will be shown elsewhere, our methods extend also to other Rauzy-type dynamics, both on labeled and unlabeled structures. Some of these dynamics have a geometrical interpretation (e.g., matchings, related to IET on non-orientable surfaces), while some others do not have one so far.
- 13 January 2017
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 50 (7) , 074003
Critical behaviour of spanning forests on random planar graphs
As a follow-up of previous work of the authors, we analyse the statistical mechanics model of random spanning forests on random planar graphs. Special emphasis is given to the analysis of the critical behaviour. Exploiting an exact relation with a model of -loops and dimers, previously solved by Kostov and Staudacher, we identify critical and multicritical loci, and find them consistent with recent results of Bousquet-Mélou and Courtiel. This is also consistent with the KPZ relation, and the Berker–Kadanoff phase in the anti-ferromagnetic regime of the Potts Model on periodic lattices, predicted by Saleur. To our knowledge, this is the first known example of KPZ appearing explicitly to work within a Berker–Kadanoff phase. We set up equations for the generating function, at the value t = −1 of the fugacity, which is of combinatorial interest, and we investigate the resulting numerical series, a favourite problem of Tony Guttmann's.
- 13 January 2017
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 50 (7) , 074003
Critical behaviour of spanning forests on random planar graphs
As a follow-up of previous work of the authors, we analyse the statistical mechanics model of random spanning forests on random planar graphs. Special emphasis is given to the analysis of the critical behaviour. Exploiting an exact relation with a model of -loops and dimers, previously solved by Kostov and Staudacher, we identify critical and multicritical loci, and find them consistent with recent results of Bousquet-Mélou and Courtiel. This is also consistent with the KPZ relation, and the Berker–Kadanoff phase in the anti-ferromagnetic regime of the Potts Model on periodic lattices, predicted by Saleur. To our knowledge, this is the first known example of KPZ appearing explicitly to work within a Berker–Kadanoff phase. We set up equations for the generating function, at the value t = −1 of the fugacity, which is of combinatorial interest, and we investigate the resulting numerical series, a favourite problem of Tony Guttmann's.
- Open Access
Generalized emptiness formation probability in the six-vertex model
In the six-vertex model with domain wall boundary conditions, the emptiness formation probability is the probability that a rectangular region in the top left corner of the lattice is frozen. We generalize this notion to the case where the frozen region has the shape of a generic Young diagram. We derive here a multiple integral representation for this correlation function.
Open AccessGeneralized emptiness formation probability in the six-vertex model
In the six-vertex model with domain wall boundary conditions, the emptiness formation probability is the probability that a rectangular region in the top left corner of the lattice is frozen. We generalize this notion to the case where the frozen region has the shape of a generic Young diagram. We derive here a multiple integral representation for this correlation function.
- 23 September 2016
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 49 (41) , 415203
Generalized emptiness formation probability in the six-vertex model
In the six-vertex model with domain wall boundary conditions, the emptiness formation probability is the probability that a rectangular region in the top left corner of the lattice is frozen. We generalize this notion to the case where the frozen region has the shape of a generic Young diagram. We derive here a multiple integral representation for this correlation function.
- 23 September 2016
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 49 (41) , 415203
Generalized emptiness formation probability in the six-vertex model
In the six-vertex model with domain wall boundary conditions, the emptiness formation probability is the probability that a rectangular region in the top left corner of the lattice is frozen. We generalize this notion to the case where the frozen region has the shape of a generic Young diagram. We derive here a multiple integral representation for this correlation function.
- Top Cited Papers
- 27 July 2016
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 164 (6) , 1488-1523
Arctic Curves of the Six-Vertex Model on Generic Domains: The Tangent Method
- 27 July 2016
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 164 (6) , 1488-1523
Top Cited PapersArctic Curves of the Six-Vertex Model on Generic Domains: The Tangent Method