betaFeedback

WorksComputer Science

Low-Temperature Sampling via Equilibrium Disagreements

Abstract

We develop a new framework for sampling at low temperatures using Glauber dynamics. In this regime, the coexistence of competing modes (commonly referred to as phases) creates bottlenecks that can make worst-case mixing exponentially slow. The main new ingredient in our framework is to relate convergence within a phase to the geometry of disagreements between two independent configurations drawn from that phase. As applications of our approach, we consider three canonical models on random regular graphs that have been central to low-temperature sampling, and establish fast convergence from natural initialisations of Glauber dynamics for every fixed degree. We show: — For the hard-core model on random bipartite dd-regular graphs, Glauber dynamics initialised from either one-sided independent set mixes within the corresponding phase in n3/2+o(1)n^{3/2+o(1)} steps throughout the non-uniqueness regime λ>λc(d)λ>λ_c(d). — For the random-cluster model on random dd-regular graphs, for every real q>2q>2, Glauber dynamics initialised from the all-in edge set mixes within the ordered phase in n3/2+o(1)n^{3/2+o(1)} steps for all β≥βcβ\geq β_c. Similarly, Glauber dynamics initialised from the all-out edge set mixes within the disordered phase in n3/2+o(1)n^{3/2+o(1)} steps for β≤βcβ\leq β_c. — For the ferromagnetic Ising model on random dd-regular graphs, Glauber dynamics initialised from all-plus or all-minus mixes within the corresponding phase in n3/2+o(1)n^{3/2+o(1)} steps throughout the low-temperature regime β>βc(d)β>β_c(d). We also give an n2+o(1)n^{2+o(1)}-time algorithm that combines phase samples into samples from the full distribution, avoiding in particular time-costly approximations of the corresponding partition functions to the target sampling accuracy.

For the purpose of Open Access, the authors have applied a CC BY copyright licence to any Author Accepted Manuscript version arising from this submission. All data is provided in full in the results section of this paper.

Introduction

A central obstacle in sampling from high dimensional distributions is the presence of multiple modes in the underlying distribution, causing strong correlations and making standard sampling methods hard to analyse or even apply. Such multimodalities arise in various well-studied problems, canonical examples in computer science include the problem of sampling independent sets on bipartite graphs (hard core model with parameter λ\lambda) where the vast majority of independent sets are correlated with one of the two sides of the bipartition for large λ\lambda, or the ferromagnetic Ising model with large β\beta where typical spin configurations have a nontrivial bias towards the all-plus or all-minus configuration.

It is a standard fact by now that the presence of multiple modes typically creates bottlenecks that make the standard Glauber dynamics mix exponentially slowly from worst-case configurations. More generally, multimodalities and the underlying correlations pose a rather formidable obstruction that frequently obliterate standard analysis tools that we have at our disposal (including spectral independence and correlation decay algorithms). In fact, the presence of multiple phases frequently underpins various strong inapproximability results at low temperatures [Sly10, SS12].

The emergence of these competing modes is a central object of study in the theory of phase transitions and has been analysed in great detail for graph classes of particular interest, examples include random graphs and lattices. Still, from the sampling perspective, the picture is not well understood despite substantial progress that has been made in recent years in designing low-temperature sampling algorithms. We review in detail progress on this front but in summary, the state-of-the-art even for canonical models (such as the Ising and hard-core models) leaves open tantalizing parts of the parameter space, typically close to the corresponding phase-transition thresholds. In particular, existing approaches for sampling at low temperatures typically require extra conditions such as sufficiently strong correlations or additional structural conditions. However, it is widely conjectured that low-temperature sampling should not depend so heavily on the proximity to the corresponding phase transition threshold, so the key unresolved question is to identify those properties that will allow for a more universal approach.

Our main contribution in this work is to make a major step towards this goal, by developing a new framework for low-temperature sampling based on the structure of disagreements between two independent equilibrium configurations drawn from the same phase; we then show a generic approach on how to lift this structural understanding to fast sampling using canonical paths. The main feature of our approach is that for key models of interest it works throughout the low-temperature regime and applying the method is fairly intuitive/mechanical.

To demonstrate this, as main applications of our new approach, we apply the framework to three extensively studied models on random graphs: We give the precise statements in the upcoming sections, but here are our main results in a nutshell.3

  • For the hard-core model on random bipartite dd-regular graphs, Glauber dynamics initialised from either one-sided independent set mixes within O~(n3/2)\widetilde O(n^{3/2}) steps throughout the non-uniqueness regime λ>λc(d)\lambda> \lambda_c(d).

  • For the random-cluster model on random dd-regular graphs, for every real q>2q > 2, Glauber dynamics initialised from the all-in edge set mixes within O~(n3/2)\widetilde O(n^{3/2}) steps for all β≥βc\beta\ge\beta_c. Similarly for the disordered phase for β≤βc\beta\le\beta_c. Our results for both phases actually extend in a window around βc\beta_c allowing us to handle the full range of β\beta.

  • For the ferromagnetic Ising model on random dd-regular graphs, Glauber dynamics initialised

from all-plus or all-minus mixes within the corresponding phase in O~(n3/2)\widetilde{O}(n^{3/2}) steps throughout the low-temperature regime β>βc(d)\beta> \beta_c(d).

Another contribution of this work is also to show a fast O~(n2)\widetilde{O}(n^2) algorithm that combines the phase samples into an ε\varepsilon-sample from the full distribution, avoiding in particular time-costly approximations of the corresponding partition functions. We remark that, in the case of the Ising model, this is fairly easy to achieve by spin-flip symmetry, so this is more important for the other two models which do not enjoy such nice symmetry.

Note that our hard-core and ferro Ising results apply to every fixed λ>λc(d)\lambda> \lambda_c(d) and β>βc(d)\beta> \beta_c(d), with constants that may depend on the distance from the threshold. For the random-cluster model with q>2q > 2, our guarantees remain uniform in a neighbourhood of βc\beta_c, including at βc\beta_c itself. This distinction reflects the different nature of the phase transitions: the hard-core phases merge at the uniqueness threshold, whereas the ordered and disordered random-cluster phases remain distinct (and remain stable) at the threshold βc\beta_c. Extending our hard-core guarantees to activities whose distance from λc(d)\lambda_c(d) vanishes with nn remains an interesting open direction.

Our framework connects the geometry of equilibrium configurations to the convergence of Glauber dynamics. Although two independent samples from the same phase may differ on a linear number of vertices, their disagreements typically break into small, tree-like components. We use this structure to construct local paths and derive weak Poincaré inequalities, which imply rapid convergence from warm starts while allowing a small exceptional set of configuration pairs. Simulated annealing and monotonicity then turn these guarantees into convergence from natural deterministic initialisations. We explain the framework and its main ingredients in § 2.

Our results

Results for bipartite independent sets

For real λ>0\lambda> 0, the hard-core (HC) distribution on a graph G=(V,E)G = (V,E) is over the set of independent sets IG\mathcal{I}_G of the graph, given by μG(I)=λ∣I∣/ZG\mu_G(I) = \lambda^{|I|}/Z_G where ZG=∑I∈IGλ∣I∣Z_G = \sum_{I \in\mathcal{I}_G} \lambda^{|I|} is the partition function.

For an integer d≥3d \ge3, let2^{2} G=(V+⊔V−,E)G = (V^+ \sqcup V^-, E) be a bipartite dd-regular graph with ∣V+∣=n|V^+| = n. We let Gn,dbip\mathcal{G}^{\mathrm{bip}}_{n,d} be the uniform distribution over such bipartite graphs, and use G∼Gn,dbipG \sim\mathcal{G}^{\mathrm{bip}}_{n,d} to denote a random graph GG selected from Gn,dbip\mathcal{G}^{\mathrm{bip}}_{n,d} uniformly at random.3^{3}

It is by now a classical result [50, 21 SS12, 35] that, whp over G∼Gn,dbipG \sim\mathcal{G}^{\mathrm{bip}}_{n,d}, for λ>λc(d)\lambda> \lambda_c(d) the distribution μG\mu_G undergoes a phase transition at λ=λc(d)\lambda= \lambda_c(d), where λc(d)=(d−1)d−1(d−2)d\lambda_c(d) = \frac{(d-1)^{d-1}}{(d-2)^d} is known as the tree uniqueness threshold. Namely, for λ>λc(d)\lambda> \lambda_c(d), the distribution μG\mu_G exhibits a bimodality where the two modes are non-trivially correlated with one of the two sides of the graph (i.e. one side has a constant fraction more vertices in the independent set than the other). This bimodality causes bottlenecks and makes Glauber dynamics mix exponentially slowly from worst-case configurations; in fact, this bimodality on the random bipartite graph is behind strong inapproximability results for λ>λc(d)\lambda> \lambda_c(d), see [Sly10, SS12, GŠV16].

To state our phase sampling results, let IG+\mathcal{I}_G^+ denote the independent sets with at least as many vertices occupied on the ++ side versus on the −- side. Let IG=IG+⊔IG−\mathcal{I}_G = \mathcal{I}_G^+ \sqcup\mathcal{I}_G^- denote the independent sets that favor the − side instead. We consider the conditional distributions

μG+(⋅)=μG(⋅∣IG+),μG−(⋅)=μG(⋅∣IG−)\mu_G^+(\cdot)=\mu_G(\cdot\mid\mathcal{I}_G^+),\qquad\mu_G^-(\cdot)=\mu_G(\cdot\mid\mathcal{I}_G^-)

which focus on independent sets that favor one of the two-sides. We will refer to μG±\mu_G^\pm as the phase distributions, whereas to μG\mu_G as the full distribution. We let ZG±=∑I∈IG±λ∣I∣Z_G^\pm=\sum_{I\in\mathcal{I}_G^\pm}\lambda^{|I|} denote the corresponding partition functions.

Our main result for the hard-core model on random bipartite graphs is as follows. At each step, the hard-core Glauber dynamics (Xt)t≥0(X_t)_{t\geq0} chooses a vertex u.a.r. and resamples whether to include it in the current independent set from μG\mu_G conditional on the states of its neighbours. For a bipartite graph GG, we use (Xt+)t≥0(X_t^+)_{t\geq0} to denote Glauber dynamics initialised at the one-side independent set X0+=V+X_0^+=V^+, and define similarly (Xt−)t≥0(X_t^-)_{t\geq0}. Below, we use O~\widetilde{O} to denote asymptotics up to an no(1)n^{o(1)} factor.

Theorem 1. Let d≥3d\geq3 be an integer and λ>λc(d)\lambda>\lambda_c(d). For any K>0K>0, the following holds whp over G∼Gn,dbipG\sim\mathcal{G}_{n,d}^{\mathrm{bip}}. Let ε=1/nK\varepsilon=1/n^K. Then,

  1. (Xt+)t≥0(X_t^+)_{t\geq0} on GG is within TVTV-distance ε\varepsilon from μG+\mu_G^+ in t=O~(n3/2)t=\widetilde{O}(n^{3/2}) steps. Similarly for (Xt−)t≥0(X_t^-)_{t\geq0}.

  2. There is an algorithm that outputs in time O~(n2)\widetilde{O}(n^2) an ε\varepsilon-sample from the full distribution μG\mu_G.

We give the proof of the first part of Theorem 1 in § 3.2 (where it is stated as Lemma 12). We complete the proof of Theorem 1 in § 3.3.2, after developing the general framework to combine the individual phase samplers in the appropriate mixture.

Results for the Random-Cluster model

For real parameters β>0\beta>0, q>1q>1 the random-cluster (RC) distribution on a graph G=(V,E)G=(V,E) is over all edge subsets F⊆EF\subseteq E given by

πG(F)∝(eβ−1)∣F∣qκ(F)(∀F⊆E),\pi_G(F)\propto(e^\beta-1)^{|F|}q^{\kappa(F)}\qquad(\forall F\subseteq E),

where κ(F)\kappa(F) is the number of connected components of (V,F)(V,F), including isolated vertices. For integer q≥3q\geq3, the random-cluster model is an edge-representation of the well-known Potts model (with q=2q=2 being the Ising case).

For real q>2q>2 and every degree d≥3d\geq3, [2] showed that on the random dd-regular graph, the model undergoes a phase transition from “disordered” to “ordered” at β=βc(q,d)\beta=\beta_c(q,d) where

βc(q,d)=log⁡(q−1(q−1)1−2/d−1),\beta_c(q,d)=\log\left(\frac{q-1}{(q-1)^{1-2/d}-1}\right),

see also [36, 37, 3, 24]. Roughly, in the disordered regime β<βc\beta<\beta_c, the components in a typical configuration have size O(log⁡n)O(\log n) whereas in the ordered regime β>βc\beta>\beta_c there is a giant component of size Ω(n)\Omega(n); at β=βc\beta=\beta_c the two types of configurations have inverse-polynomially large mass.

The critical point βc\beta_c lies strictly inside a so-called metastability window (βu,βs)(\beta_u,\beta_s), where βu\beta_u and βs=log⁡(1+q/(d−2))\beta_s=\log(1+q/(d-2)) are the lower and upper uniqueness thresholds of the RC model on the wired dd-regular tree. For integer q≥3q\geq3, it has been established that the ordered and disordered phases are both present throughout this window as “locally stable” modes, although only one dominates away from βc\beta_c. For every fixed β\beta in this window, the metastability result of Coja-Oghlan et al. [19] implies that the worst-case mixing time of RC Glauber dynamics is exp⁡(Ω(n))\exp(\Omega(n)) whp on the random dd-regular graph.

To state our mixing results more formally, for mc=mc(q,d)∈(0,1)m_{\mathrm{c}}=m_{\mathrm{c}}(q,d)\in(0,1) to be specified6, we consider the following subsets of configurations which will be most relevant

References

  1. [1]Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. Spectral independence in high-dimensional expanders and applications to the hardcore model. In 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 1319–1330, 2020.arxiv.org/abs/2001.00303
  2. [2]Ferenc Bencs, Márton Borbényi, and Péter Csikvári. Random cluster model on regular graphs. Communications in Mathematical Physics, 399(1):203–248, 2023.DOI
  3. [3]Anirban Basak, Amir Dembo, and Allan Sly. Potts and random cluster measures on locally regular-tree-like graphs. Communications in Mathematical Physics, 406(7):168, 2025.arxiv.org/abs/2312.16008
  4. [4]Antonio Blanca and Reza Gheissari. Random-cluster dynamics on random regular graphs in tree uniqueness. Communications in Mathematical Physics, 386(2):1243–1287, 2021.DOI
  5. [5]Antonio Blanca and Reza Gheissari. On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics. Probability Theory and Related Fields, 191(3):1121–1168, 2025.arxiv.org/abs/2304.03182
  6. [6]Antonio Blanca, Reza Gheissari, Heehyun Park, and Xusheng Zhang. Rapid mixing of Potts Glauber dynamics throughout uniqueness, 2026. arXiv:2610.42059.arxiv.org/abs/2610.42059
  7. [7]Antonio Blanca, Reza Gheissari, Heehyun Park, and Xusheng Zhang. Uniqueness and mixing in the low-temperature random-cluster model on trees and random graphs, 2026. arXiv:2604.20693.arxiv.org/abs/2604.20693
  8. [9]Xiaoyu Chen, Zongchen Chen, Yitong Yin, and Xinyuan Zhang. Rapid mixing at the uniqueness threshold. In Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 879–890, 2025.arxiv.org/abs/2411.03413
  9. [10]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, and Corrine Yap. Algorithms for the ferromagnetic Potts model on expanders. Combinatorics, Probability and Computing, 33(4):487–517, 2024.
  10. [11]Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, and Guus Regts. Statistical physics approaches to Unique Games. In Proceedings of the 35th Computational Complexity Conference, CCC ’20, 2020.DOI
  11. [12]Charlie Carlson, Ewan Davies, and Alexandra Kolla. Efficient algorithms for the Potts model on small-set expanders. Chicago Journal of Theoretical Computer Science, 2024(1):1–31, 2024.
  12. [13]Xiaoyu Chen, Weiming Feng, Yitong Yin, and Xinyuan Zhang. Optimal mixing for two-state anti-ferromagnetic spin systems. In 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 588–599, 2022.arxiv.org/abs/2203.07771
  13. [14]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Štefankovič, and Eric Vigoda. #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. Journal of Computer and System Sciences, 82(5):690–711, 2016.
  14. [15]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda. Fast algorithms at low temperatures via Markov chains. Random Structures & Algorithms, 58(2):294–321, 2021.
  15. [16]Zongchen Chen, Andreas Galanis, Daniel Štefankovič, and Eric Vigoda. Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, pages 2198–2207. SIAM, 2022.arxiv.org/abs/2105.01784
  16. [17]Zongchen Chen, Kuikui Liu, and Eric Vigoda. Rapid mixing of Glauber dynamics up to uniqueness via contraction. In 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 1307–1318, 2020.
  17. [18]Zongchen Chen, Kuikui Liu, and Eric Vigoda. Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1537–1550, 2021.
  18. [19]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelo-manana, Daniel Štefankovič, and Eric Vigoda. Metastability of the Potts ferromagnet on random regular graphs. Communications in Mathematical Physics, 401(1):185–225, 2023.
  19. [20]Xiaoyu Chen and Xinyuan Zhang. A near-linear time sampler for the Ising model with external field. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4478–4503, 2023.arxiv.org/abs/2207.09391
  20. [21]Martin Dyer, Alan Frieze, and Mark Jerrum. On counting independent sets in sparse graphs. SIAM Journal on Computing, 31(5):1527–1541, 2002.
  21. [23]Amir Dembo and Andrea Montanari. Ising models on locally tree-like graphs. The Annals of Applied Probability, 20(2):565–592, 2010.DOI
  22. [24]Hang Du and Yanxin Zhou. Characterizing the limiting critical Potts measures on locally regular-tree-like expander graphs, 2025. arXiv:2505.24283.
  23. [25]Weiming Feng, Heng Guo, and Jiaheng Wang. Swendsen–Wang dynamics for the ferromagnetic Ising model with external fields. Information and Computation, 294:105066, 2023.arxiv.org/abs/2205.01985
  24. [27]Weiming Feng and Minji Yang. Rapid mixing of Glauber dynamics for monotone systems via entropic independence. In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4894–4929, 2026.
  25. [28]Andreas Galanis, Leslie Ann Goldberg, and Paulina Smolarova. Planting and MCMC sampling from the Potts model, 2024. arXiv preprint arXiv:2410.14409.
  26. [29]Andreas Galanis, Leslie Ann Goldberg, and Paulina Smolarova. Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. Combinatorics, Probability and Computing, 34(3):359–391, 2025.
  27. [30]Andreas Galanis, Leslie Ann Goldberg, and Paulina Smolarova. Planting and MCMC sampling from the Potts model. In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), volume 364 of Leibniz International Proceedings in Informatics (LIPIcs), pages 39:1–39:19, 2026.
  28. [31]Heng Guo and Mark Jerrum. Random cluster dynamics for the Ising model is rapidly mixing. Annals of Applied Probability, 28(2):1292–1313, 2018.
  29. [32]Reza Gheissari and Alistair Sinclair. Low-temperature Ising dynamics with random initializations. Annals of Applied Probability, 33(5):3916–3957, 2023.arxiv.org/abs/2106.11296
  30. [33]Reza Gheissari, Allan Sly, and Youngtak Sohn. Rapid phase ordering for Ising and Potts dynamics on random regular graphs. arXiv preprint arXiv:2505.15783, 2025.
  31. [34]Andreas Galanis, Daniel Štefankovič, and Eric Vigoda. Inapproximability for antiferromagnetic spin systems in the tree non uniqueness region. J. ACM, 62(6), 2015.
  32. [35]Andreas Galanis, Daniel Štefankovič, and Eric Vigoda. Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. Combinatorics, Probability and Computing, 25(4):500–559, 2016.
  33. [36]Andreas Galanis, Daniel Štefankovič, Eric Vigoda, and Linji Yang. Ferromagnetic Potts model: Refined #BIS-hardness and related results. SIAM Journal on Computing, 45(6):2004–2065, 2016.
  34. [37]Tyler Helmuth, Matthew Jenssen, and Will Perkins. Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. Annales de l’Institut Henri Poincaré, Probabilités et statistiques, 59(2):817–848, 2023.arxiv.org/abs/2006.11580
  35. [39]Matthew Jenssen, Peter Keevash, and Will Perkins. Algorithms for #BIS-hard problems on expander graphs. SIAM Journal on Computing, 49(4):681–710, 2020.
  36. [40]Matthew Jenssen, Alexandru Malekshahian, and Jinyoung Park. A refined graph container lemma and applications to the hard-core model on bipartite expanders. Random Structures & Algorithms, 68(1):e70041, 2026.DOI
  37. [41]Matthew Jenssen, Will Perkins, and Aditya Potukuchi. Approximately counting independent sets in bipartite graphs via graph containers. Random Structures & Algorithms, 63(1):215–241, 2023.
  38. [42]Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing, 22(5):1087–1116, 1993.
  39. [43]Nicholas Kocurek, Shayan Oveis Gharan, and Dante Tjowasi. Sampling from the hardcore model on random regular bipartite graphs above the uniqueness threshold, 2026. arXiv preprint arXiv:2604.21847.arxiv.org/abs/2604.21847
  40. [44]Zhangsong Li. Near linear mixing of random-cluster Glauber dynamics on random regular graphs, 2026. arXiv:2611.05794.arxiv.org/abs/2611.05794
  41. [45]Chao Liao, Jiabao Lin, Pinyan Lu, and Zhenyu Mao. Counting independent sets and colorings on random regular bipartite graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), volume 145 of Leibniz International Proceedings in Informatics (LIPIcs), pages 34:1–34:12, 2019.arxiv.org/abs/1903.07531
  42. [46]Zhangsong Li and Allan Sly. Improved rapid phase ordering for Ising dynamics on random regular graphs, 2026. arXiv preprint arXiv:2610.27673.arxiv.org/abs/2610.27673
  43. [48]Andrea Montanari, Elchanan Mossel, and Allan Sly. The weak limit of Ising models on locally tree-like graphs. Probability Theory and Related Fields, 152(1–2):31–51, 2012.
  44. [49]Brendan D. McKay, Nicholas C. Wormald, and Beata Wysocka. Short cycles in random regular graphs. The Electronic Journal of Combinatorics, 11(1):R66, 2004.DOI
  45. [50]Elchanan Mossel, Dror Weitz, and Nicholas Wormald. On the hardness of sampling independent sets beyond the tree threshold. Probability Theory and Related Fields, 143(3–4):401–439, 2009.arxiv.org/abs/math/0701471

Paper details

vlnc:W_yg33w92t
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 1

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents