1. Introduction
Spin models from statistical mechanics have been used to model voting behaviour (see e.g. [Reference Brock and Durlauf2, Reference Contucci and Ghirlanda5, Reference Kirsch14, Reference Kirsch and Langner15, Reference Löwe, Schubert and Vermet24, Reference Opoku, Edusei and Ansah25, Reference Toth34]. These stochastic models of voting describe the typical voting behaviour in terms of a probability distribution over the set of all possible voting outcomes for a population of
$n\in\mathbb{N}$ voters deciding on a binary matter. A complete record of all individual decisions is called a voting configuration
$\left(x_{1},\ldots,x_{n}\right)\in\left\{ -1,1\right\} ^{n}$. These binary choices, with values encoded as
$\pm1$, cover both referenda and elections for public office with two candidates. The individual votes are random variables
$X_{i}$,
$i=1,2,\ldots,n$, with joint distribution
$\mathbb{P}$. In the literature, it is customary to impose the symmetry condition
for all voting configurations
$\left(x_{1},\ldots,x_{n}\right)$. The justification for this is that there is no fundamental distinction between the two alternatives. We assume that each voter has fixed preferences concerning all possible issues that can be put to vote. However, the way the question is phrased in the referendum, or the order in which the candidates appear on the ballot, is assumed to be random, so it is reasonable to expect any given voter to choose
$+1$ with the same probability as
$-1$.
Definition 1. A probability measure on
$\left\{ -1,1\right\} ^{n}$ that satisfies (1) is called a voting measure.
With only two alternatives, we can apply the majority rule to determine the winning alternative, and measure the outcome of the vote by adding all votes to obtain the voting margin
$S_{n}\,:\!=\,\sum_{i=1}^{n}X_{i}$. If the voting margin is positive, the decision is in favour of the proposal; otherwise, it is against. The expected per-capita absolute voting margin is
$\mathbb{E}\left(\left|S_{n}\right|/n\right)$, and it captures the essence of voting behaviour under the model described by
$\mathbb{P}$.
We would like to note that even though the motivation for the study of the models in this article is voting theory, all of these models can also be considered spin models in the context of statistical physics, where there is a tendency for the spins to align.
The focus of this article is the asymptotic behaviour of sequences of voting measures as the population size n goes to infinity. Empirical data on elections give us an idea of the properties these models should have to reflect real-world voting. Penrose’s square root law [Reference Penrose26] has been the gold standard in the field of voting theory. Penrose investigated the question of how to equalise the influence of each voter on the decision in a two-tier voting system. A two-tier voting system consists of several groups or constituencies of possibly different sizes and a council that makes decisions on behalf of the union of these groups. Each group sends a representative to the council who votes according to the preferences of the group. The voting weights in the council have to take into account the potentially different group sizes. According to Penrose’s square root law, the optimal weights in the council should be proportional to the square root of the size of each group. Aside from equalising the influence of each voter on the council vote, other criteria have been proposed. This is the problem of optimal voting weights, a topic treated by a variety of authors [Reference Kirsch14, Reference Kirsch and Langner15, Reference Kirsch and Toth19, Reference Kirsch and Toth20, Reference Slomczynski, Zastawniak and Zyczkowski27–Reference Slomczynski and Zyczkowski31, Reference Toth34]. It is but one of the applications for voting models with real-world consequences.
A different but related subject is the study of dynamic models of binary voting, which can also be interpreted as models of opinion dynamics. One work which shares some overlap with the present article is [Reference Toth35], in which we specify a dynamic model of binary voting in which the population is subdivided into a large number of groups (such as work groups or friendship groups) whose members discuss the issue to be voted on and influence each other. After discussion takes place, there is a general tendency for everybody to adopt the majority opinion prevalent in the group. However, we allow for contrarian tendencies which manifest in a refusal to adopt said opinion. This is triggered randomly for each member of the group and the probability is what we call a ‘flip parameter’. Several rounds of these discussions take place sequentially, updating opinions across the population in each round. This type of model is very general in that a wide variety of behaviours can be observed, depending on the choice of the flip parameters. Therefore, in [Reference Toth35], we study how the general class of these models behaves if we suppose the flip parameters are randomly chosen with a certain correlation structure inherent in the joint distribution of all flip parameters. Thus, the main differences from the present work lie in the dynamic aspect of the model considered in [Reference Toth35], the small size of groups (in that, instead of holding the number of groups fixed, we study groups of fixed sizes), and the modelling approach of selecting the parameters at random. In the present article, following the approach in the works cited in the last paragraph, we study static models of voting with fixed parameters.
A basic assumption in [Reference Penrose26] is the independence of all voters. Intuitively speaking, the assumption that all voters are independent seems unrealistic. Gelman et al. [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12] criticised the square root law based on statistical evidence. In particular,
$\mathbb{E}\left(\left|S_{n}\right|/n\right)$ is a characteristic of the distribution of voting configurations under a voting measure which can be statistically estimated. Gelman et al. pointed out that under the assumption of independence of all voters, which leads to a binomial distribution of the sum of all votes,
$\mathbb{E}\left(\left|S_{n}\right|/n\right)$ should be of order
$1/\sqrt{n}$ as n goes to infinity. This would imply that larger countries or constituencies should on average have far closer elections, i.e. smaller per-capita voting margins, than smaller countries. Gelman et al. argued that although this can be observed in the data on U.S. and European elections to some extent, the per-capita voting margins decrease as a far lower power of n than the power
$1/2$ specified by the square root law. Indeed, the typical magnitude of
$\mathbb{E}\left(\left|S_{n}\right|/n\right)$ seems to be of order
$n^{-\alpha}$ with
$0.1\leq\alpha\leq0.2$. This has implications for the determination of the optimal voting weights in two-tier voting systems.
Models of voting behaviour are often adapted from statistical physics. Two categories are the collective bias model and the Curie-Weiss model. See Section 4 for a discussion of these models and how they fit into the framework introduced in Definition 3 below.
In this article, we will deal with the multivariate (i.e. multi-group) setting. This is due to the application of these models to two-tier voting systems, in which the overall population is subdivided into a fixed number of groups, such as e.g. states of a federal republic. We could describe each group’s voters by a separate voting model, but this would preclude us from considering correlated voting across group boundaries. Therefore, we choose to analyse multi-group models. The general framework is a set of binary random variables double-indexed by the group and individual
$X_{\lambda i}\in\left\{ -1,1\right\} $, where
$\lambda=1,\ldots,M$ indicates the group and
$i=1,\ldots,n_{\lambda}$ the individual voter. The group sizes
$n_{\lambda}$ sum to n, the overall population size. We will assume that all M groups grow without bound as the overall population goes to infinity. Each
$n_{\lambda}$ is thus actually a sequence
$\left(n_{\lambda}(n)\right)_{n\in\mathbb{N}}$ that goes to infinity as
$n\rightarrow\infty$. So for each value of the overall population n, we have a vector of group sizes
$\left(n_{1},\ldots,n_{M}\right)$.
Our aim in this article is to study sequences of de Finetti measures
$\left(\mu_{n}\right)_{n}$ with certain concentration properties. Aside from the case of each
$\mu_{n}$ living on the compact set
$\left[-1,1\right]^{M}$, we will also consider more general measures with supports in
$\mathbb{R}^{M}$. All these sequences will have in common that they converge weakly to
$\delta_{0}$, the Dirac measure at the origin. This convergence assumption represents a tendency towards lower social cohesion or lower central influence as the size of the population increases.
We will use the Rademacher distribution in the definition of de Finetti voting models below.
Definition 2. The Rademacher distribution with parameter
$s\in\left[-1,1\right]$ is a probability measure
$P_{s}$ on
$\left\{ -1,1\right\} $ given by
$P_{s}\left\{ 1\right\} \,:\!=\,\frac{1+s}{2}$.
Notation 1. We will write, for all
$t\in\left[-1,1\right]^{M}$ and all
$\left(x_{11},\ldots,x_{Mn_{M}}\right)\in\left\{ -1,1\right\} ^{n}$,
\begin{align*}P_{t}^{\otimes n}\left(x_{11},\ldots,x_{Mn_{M}}\right)\,:\!=\,\prod_{\lambda=1}^{M}\prod_{i=1}^{n_{\lambda}}P_{t_{\lambda}}\left\{ x_{\lambda i}\right\} .\end{align*}
Let
$E_{t}$ stand for the expectation with respect to the product measure
$P_{t}^{\otimes n}$.
Recall that
$M\in\mathbb{N}$ is the number of groups and
$n=\sum_{\lambda=1}^{M}n_{\lambda}\in\mathbb{N}$ is the size of the overall population.
Definition 3. Let
$\left(\mu_{n}\right)_{n}$ be a sequence of probability measures on
$\mathbb{R}^{M}$ which are symmetric with respect to the origin, i.e.
$\mu_{n}\left(A\right)=\mu_{n}\left(-A\right)$ holds for all measurable sets
$A\subset\mathbb{R}^{M}$ and all
$n\in\mathbb{N}$. The voting measure
$\mathbb{P}_{n}$ is defined by
for all voting configurations
$\left(x_{11},\ldots,x_{Mn_{M}}\right)\in\left\{ -1,1\right\} ^{n}$ and all
$n\in\mathbb{N}$. The expression
$\bar{m}$ is some function
$m\in\mathbb{R}^{M}\mapsto\bar{m}\in\mathbb{R}^{M}$ with the following properties:
• The function
$m\mapsto\bar{m}$ is increasing in each component of m, and its range lies in
$\left[-1,1\right]^{M}$.• For each
$\lambda$,
$\lim_{m\rightarrow0}\frac{\bar{m}_{\lambda}}{m_{\lambda}}=1$.• The limit of
$\bar{m}$ taken as each component of m goes to
$\infty$ is 1, and the limit as each component goes to
$-\infty$ is
$-1$.
We will call such sequences of voting measures
$\left(\mathbb{P}_{n}\right)_{n}$ de Finetti voting models with de Finetti sequence
$\left(\mu_{n}\right)_{n}$. We will refer to
$\left(\mu_{n}\right)_{n}$ as the sequence of de Finetti measures of
$\left(\mathbb{P}_{n}\right)_{n}$.
Remark 1. Note that the assumed symmetry of each probability measure
$\mu_{n}$ implies the symmetry condition (1) for each
$\mathbb{P}_{n}$.
Remark 2. We will concentrate on the case where
$\left(\mu_{n}\right)_{n}$ is supported on
$\left[-1,1\right]^{M}$ with
$\bar{m}=m$. The reason we consider the more general setup with supports not contained in
$\left[-1,1\right]^{M}$ is that some voting models, such as the Curie-Weiss model defined in Section 4, fall into this category. However, there are no significant mathematical differences between the more restrictive assumption of a compact support and the general case.
For large population sizes n, Definition 3 covers all models with exchangeable random variables
$X_{\lambda i}$ within each group
$\lambda$. (See [Reference Diaconis and Freedman6] for the result that states that for finite numbers n of exchangeable random variables, the total variation distance between the joint distribution of the random variables and the distribution of a mixture as in the formula above is at most of order
$1/n$.) In the language of voting theory, these voting systems are called ‘neutral’, as the identity of the individual voters (at least within each group) does not affect the outcome.
Definition 4. Suppose
$\left(\mathbb{P}_{n}\right)_{n}$ is a de Finetti voting model. We define the group voting margins for each group
$\lambda$ as follows:
Instead of the voting margin
$S_{n}$ of a single-group model, we will be interested in the joint distribution of the group voting margins
$S_{n,1},\ldots,S_{n,M}$; more precisely, we will study the asymptotic behaviour of the sums
normalised by sequences
$\left(\gamma_{n,\lambda}\right)_{n\in\mathbb{N}}$ to ensure that
$\boldsymbol{S}_{n}$ converges to some limiting distribution as n goes to infinity.
We will stipulate that
$\left(\mu_{n}\right)_{n}$ converges weakly to
$\delta_{0}$. This represents an underlying tendency towards lower social cohesion which is reflected in the convergence to 0 of the correlation
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$ between two votes belonging to any groups
$\lambda$ and
$\nu$. Note that this does not necessarily imply that the limiting distribution of
$\boldsymbol{S}_{n}$ features independent entries. We will return to the topic of the correlations
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$ in Proposition 1 and in Section 4.
In Section 2, we present limit theorems for
$\boldsymbol{S}_{n}$ given sequences
$\left(\mu_{n}\right)_{n}$ that converge weakly to
$\delta_{0}$ and show that the speed of convergence is crucial for the limiting distribution. The main results are the limit results of Theorems 4 and 6 and Corollary 2 concerning the behaviour of the expected per-capita voting margins. Section 3 contains the proofs of these results. Section 4 discusses some voting models featured prominently in the literature and how they fit into the framework introduced in Definition 3; Example 1 provides a de Finetti voting model which fits the empirical evidence. Finally, Section 5 presents the conclusions.
2. Results
Notation 2. In the following, for any vectors
$x,y\in\mathbb{R}^{d}$, let the expression
$x\circ y\in\mathbb{R}^{d}$ stand for the componentwise product of x and y. We will use the symbol ‘
$\ast$’ to denote the convolution of two measures. The symbol ‘
$\xrightarrow[n\rightarrow\infty]{\mathrm{d}}$’ stands for convergence in distribution as n goes to infinity. We will write
$\mathcal{N}\left(0,C\right)$ for a centred multivariate normal distribution with covariance matrix C, and
$\delta_{x}$ for the Dirac measure at
$x\in\mathbb{R}^{d}$. We will denote by
$I_{k}$ the identity matrix of dimension
$k\in\mathbb{N}$. For
$a,b\in\mathbb{R}^{M}$ with
$a\leq b$ componentwise, we will use
$\left[a,b\right]$ to denote
$\prod_{\lambda=1}^{M}\left[a_{\lambda},b_{\lambda}\right]$. Let
$\left\Vert \cdot\right\Vert _{\infty}$ stand for the sup norm on
$\mathbb{R}^{d}$ for any
$d\in\mathbb{N}$, as well as on the set of all functions
$f\,:\,\mathbb{R}^{d}\rightarrow\mathbb{R}$.
We will be working with sequences of vectors
$\left(\varepsilon_{n}\right)_{n}$ in
$\left(0,\infty\right)^{M}$ such that
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$.
Lemma 1. Let
$\left(\mu_{n}\right)_{n}$ be a sequence of probability measures on
$\mathbb{R}^{M}$. Then the following statements are equivalent:
(i) The sequence
$\left(\mu_{n}\right)_{n}$ converges weakly to
$\delta_{0}$.(ii) For all
$\delta>0$, we have
$\mu_{n}\left(\prod_{\lambda=1}^{M}\left[-\delta,\delta\right]\right)\xrightarrow[n\rightarrow\infty]{}1$.(iii) There is a sequence
$\left(\varepsilon_{n}\right)_{n}$ in
$\left(0,\infty\right)^{M}$ with
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$ such that
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$.
This lemma states that by considering all sequences
$\left(\varepsilon_{n}\right)_{n}$ as in (iii) above, we are covering all sequences of probability measures
$\left(\mu_{n}\right)_{n}$ that converge weakly to
$\delta_{0}$.
We will use the following notation for the asymptotic behaviour of sequences.
Notation 3. For any complex-valued sequences
$\left(f_{n}\right)_{n},\left(g_{n}\right)_{n}$, we will write
$f_{n}=\Theta\left(g_{n}\right)$ if
$f_{n}=O\left(g_{n}\right)$ if
and
$f_{n}=o\left(g_{n}\right)$ if
The convergence speed of
$\left(\mu_{n}\right)_{n}$ turns out to be crucial for the limiting distribution of the suitably normalised sums
$\boldsymbol{S}_{n}$. First we present a theorem that says that under ‘fast convergence’, a term we will give formal meaning to in Definition 5, we obtain a universal limit for the normalised sums which is independent of the specific sequence of de Finetti measures, with only the convergence speed mattering.
Theorem 4. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with group sizes
$n_{\lambda}$, group voting margins
$S_{n,\lambda}$,
$\lambda=1,\ldots,M$, and de Finetti measures
$\left(\mu_{n}\right)_{n}$. Let
$\left(\varepsilon_{n}\right)_{n}$ be a sequence in
$\left(0,\infty\right)^{M}$ with
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$ for each coordinate
$\lambda$. If
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$, then
This theorem says that if convergence is fast enough—that is, faster than
$1/\sqrt{n_{\lambda}}$ in each component—then the specifics of the sequence of distributions
$\left(\mu_{n}\right)_{n}$ are lost in the limit. The groups become independent in the limit, and each normalised group voting margin
$S_{n,\lambda}/\sqrt{n_{\lambda}}$ converges to a standard normal distribution. As we will next see, this universality is lost if the convergence speed is not faster than the critical speed
$1/\sqrt{n_{\lambda}}$. Then, the specifics of the sequence
$\left(\mu_{n}\right)_{n}$ affect the limiting distribution of the normalised sums. For this reason, we assume that each
$\mu_{n}$ is a contraction of some fixed probability measure
$\mu$ on
$\mathbb{R}^{M}$.
For the next theorem, we need to define the notation for a contraction.
Notation 5. If
$\mu$ is a probability measure on
$\mathbb{R}^{d}$ and
$h\in\left(0,\infty\right)^{d}$, then we denote by
$h\circ\mu$ the rescaled measure of
$\mu$ by h, which is given by
$h\circ\mu\left(A\right)\,:\!=\,\mu\left(h\circ A\right)$ for all measurable sets
$A\subset\mathbb{R}^{d}$.
Theorem 6. Let
$\mu$ be a probability measure on
$\mathbb{R}^{M}$ and
$\left(\varepsilon_{n}\right)_{n}$ a sequence in
$\left(0,\infty\right)^{M}$ with
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$. We define for each
$n\in\mathbb{N}$ the probability measure
$\mu_{n}\,:\!=\,\left(\frac{1}{\varepsilon_{n,1}},\ldots,\frac{1}{\varepsilon_{n,M}}\right)\circ\mu$. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with group sizes
$n_{\lambda}$, group voting margins
$S_{n,\lambda}$,
$\lambda=1,\ldots,M$, and de Finetti measures
$\left(\mu_{n}\right)_{n}$.
(i) If for each component
$\lambda$
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$, then
\begin{align*}\left(\frac{S_{n,1}}{\sqrt{n_{1}}},\ldots,\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mathcal{N}\left(0,I_{M}\right).\end{align*}
-
(ii) If for each component
$\lambda$
$\lim_{n\rightarrow\infty}\varepsilon_{n,\lambda}\sqrt{n_{\lambda}}=h_{\lambda}>0$, we set
$h\,:\!=\,\left(h_{1},\ldots,h_{M}\right)$, and then
\begin{align*}\left(\frac{S_{n,1}}{\sqrt{n_{1}}},\ldots,\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mathcal{N}\left(0,I_{M}\right)\ast\left(h\circ\mu\right).\end{align*}
-
(iii) If for each component
$\lambda$
$\frac{1}{\sqrt{n_{\lambda}}}=o\left(\varepsilon_{n,\lambda}\right)$, we set
$\gamma_{n,\lambda}\,:\!=\,\varepsilon_{n,\lambda}n_{\lambda}$ for each n and each
$\lambda$, and then
\begin{align*}\left(\frac{S_{n,1}}{\gamma_{n,1}},\ldots,\frac{S_{n,M}}{\gamma_{n,M}}\right)\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mu.\end{align*}
Under fast contraction, i.e.
$\varepsilon_{n,\lambda}=o\left(1/\sqrt{n_{\lambda}}\right)$ for each
$\lambda$, we obtain the universal limiting distribution
$\mathcal{N}\left(0,I_{M}\right)$ as in Theorem 4. However, if the contraction speed is critical, i.e.
$\lim_{n\rightarrow\infty}\varepsilon_{n,\lambda}\sqrt{n_{\lambda}}=h_{\lambda}>0$ for each
$\lambda$, then the limiting distribution for the normalised sums is the convolution of the rescaled version
$h\circ\mu$ of the measure
$\mu$, which is used to define the contracting sequence
$\left(\mu_{n}\right)_{n}$, and a multivariate normal noise with independent components and standard normal marginal distributions. Lastly, if the contraction speed is subcritical, then the sums must be normalised differently than in the supercritical and critical cases. The normalisation factor is
$\gamma_{n,\lambda}=\varepsilon_{n,\lambda}n_{\lambda}$ for each component
$\lambda$. The assumption
$1/\sqrt{n_{\lambda}}=o\left(\varepsilon_{n,\lambda}\right)$ implies that
$\gamma_{n,\lambda}$ goes to infinity faster than
$\sqrt{n_{\lambda}}$. The limiting distribution of the normalised sums in the subcritical case is the measure
$\mu$.
From Theorem 6, the corresponding result for single-group models (with
$M=1$ and
$n_{1}=n$) follows.
Corollary 1. Let
$\mu$ be a probability measure on
$\mathbb{R}$ and
$\left(\varepsilon_{n}\right)_{n}$ a sequence in
$\left(0,\infty\right)$ with
$\varepsilon_{n}\xrightarrow[n\rightarrow\infty]{}0$. We define for each
$n\in\mathbb{N}$ the probability measure
$\mu_{n}\,:\!=\,\frac{1}{\varepsilon_{n}}\circ\mu$. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with de Finetti measures
$\left(\mu_{n}\right)_{n}$.
(i) If
$\varepsilon_{n}=o\left(\frac{1}{\sqrt{n}}\right)$, then
\begin{align*}\frac{S_{n}}{\sqrt{n}}\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mathcal{N}\left(0,1\right).\end{align*}
-
(ii) If
$\lim_{n\rightarrow\infty}\varepsilon_{n}\sqrt{n}=h>0$, then
\begin{align*}\frac{S_{n}}{\sqrt{n}}\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mathcal{N}\left(0,1\right)\ast\left(h\circ\mu\right).\end{align*}
-
(iii) If
$\frac{1}{\sqrt{n_{\lambda}}}=o\left(\varepsilon_{n}\right)$, we set
$\gamma_{n}\,:\!=\,\varepsilon_{n}n$ for each n. Then
\begin{align*}\frac{S_{n}}{\gamma_{n}}\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mu.\end{align*}
The next definition formalises the different convergence speeds in Theorem 6. We will classify some voting models that fit the de Finetti framework in Section 4 according to the speed of convergence to
$\delta_{0}$ of their de Finetti measures
$\left(\mu_{n}\right)_{n}$.
Definition 5. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with group sizes
$n_{\lambda}$,
$\lambda=1,\ldots,M$, de Finetti measures
$\left(\mu_{n}\right)_{n}$, and
$\left(\varepsilon_{n}\right)_{n}$ a sequence in
$\left(0,\infty\right)^{M}$ with
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$. Assume
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$ holds.
(i) If for each component
$\lambda$
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$, we will say the model exhibits fast (or supercritical) convergence.(ii) If for each component
$\lambda$
$\lim_{n\rightarrow\infty}\varepsilon_{n,\lambda}\sqrt{n_{\lambda}}=h_{\lambda}>0$, we will say the model has critical convergence speed.(iii) If for each component
$\lambda$
$\frac{1}{\sqrt{n_{\lambda}}}=o\left(\varepsilon_{n,\lambda}\right)$, we will say the model exhibits slow (or subcritical) convergence.
Theorem 6 states that there is a phase transition in the space of convergence speeds with a critical speed of order
$1/\sqrt{n_{\lambda}}$, as well as supercritical and subcritical regimes.
Next we state that different components (or groups)
$\lambda$ can be in different regimes depending on the contraction speed
$\varepsilon_{n,\lambda}$ for each group.
Theorem 7. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with group sizes
$n_{\lambda}$, group voting margins
$S_{n,\lambda}$,
$\lambda=1,\ldots,M$, de Finetti measures
$\left(\mu_{n}\right)_{n}$ defined as a contraction of a probability measure
$\mu$ on
$\mathbb{R}^{M}$ as in Theorem 6, and
$\left(\varepsilon_{n}\right)_{n}$ a sequence in
$\left(0,\infty\right)^{M}$ with
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$. Let the M groups be partitioned into three clusters
$C_{1},C_{2},$ and
$C_{3}$, each of which comprises
$M_{i}>0$ of the M groups, respectively. Let the contraction speeds of
$\left(\varepsilon_{n}\right)_{n}$ and the definition of the sequence
$\left(\gamma_{n}\right)_{n}$ be those given in the following display:
\begin{align*}\varepsilon_{n,\lambda} & =o\left(\frac{1}{\sqrt{n_{\lambda}}}\right), & \gamma_{n,\lambda} & \,:\!=\,\sqrt{n_{\lambda}}, & \lambda & \in C_{1},\\\lim_{n\rightarrow\infty}\varepsilon_{n,\lambda}\sqrt{n_{\lambda}} & =h_{\lambda}>0, & \gamma_{n,\lambda} & \,:\!=\,\sqrt{n_{\lambda}}, & \lambda & \in C_{2},\\\frac{1}{\sqrt{n_{\lambda}}} & =o\left(\varepsilon_{n,\lambda}\right), & \gamma_{n,\lambda} & \,:\!=\,\varepsilon_{n,\lambda}n_{\lambda}, & \lambda & \in C_{3}\end{align*}
We set
$h\,:\!=\,\left(h_{M_{1}+1},\ldots,h_{M_{1}+M_{2}},1,\ldots,1\right)\in\mathbb{R}^{M_{2}+M_{3}}$.
Then
where
$\mu_{C_{2},C_{3}}$ is the marginal distribution of the coordinates belonging to
$C_{2}$ and
$C_{3}$ under the measure
$\mu$.
Note that the groups in
$C_{1}$ are asymptotically independent both of each other and of the groups belonging to
$C_{2}$ and
$C_{3}$, whereas the groups in
$C_{2}$ and
$C_{3}$ preserve the dependence given by the probability measure
$\mu$, with some additive noise introduced in
$C_{2}$ which is due to the critical nature of the contraction speed for that cluster.
We turn to the behaviour of the expected per-capita voting margins
$\mathbb{E}\left(\left|S_{n,\lambda}\right|/n_{\lambda}\right)$, as these can be used to assess the goodness of fit of the model to the data presented in [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12].
Corollary 2. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with group sizes
$n_{\lambda}$, group voting margins
$S_{n,\lambda}$,
$\lambda=1,\ldots,M$, de Finetti measures
$\left(\mu_{n}\right)_{n}$ defined as a contraction of a probability measure
$\mu$ on
$\mathbb{R}^{M}$ as in Theorem 6, and
$\left(\varepsilon_{n}\right)_{n}$ a sequence in
$\left(0,\infty\right)^{M}$ with
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$.
(i) If for some
$\lambda$
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$, then
\begin{align*}\mathbb{E}\left(\frac{\left|S_{n,\lambda}\right|}{n_{\lambda}}\right)=\Theta\left(n_{\lambda}^{-1/2}\right).\end{align*}
-
(ii) If for some
$\lambda$
$\lim_{n\rightarrow\infty}\varepsilon_{n,\lambda}\sqrt{n_{\lambda}}=h_{\lambda}>0$, then
\begin{align*}\mathbb{E}\left(\frac{\left|S_{n,\lambda}\right|}{n_{\lambda}}\right)=\Theta\left(n_{\lambda}^{-1/2}\right).\end{align*}
-
(iii) If for some
$\lambda$
$\frac{1}{\sqrt{n_{\lambda}}}=o\left(\varepsilon_{n,\lambda}\right)$, then
\begin{align*}\mathbb{E}\left(\frac{\left|S_{n,\lambda}\right|}{n_{\lambda}}\right)=\Theta\left(\varepsilon_{n,\lambda}\right).\end{align*}
Hence, if
$\varepsilon_{n,\lambda}=n_{\lambda}^{-\alpha}$ with
$0.1\leq\alpha\leq0.2$, then we land in the empirical range given in [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12] for the group voting margins
$\mathbb{E}\left(\left|S_{n,\lambda}\right|/n_{\lambda}\right)$. In accordance with Definition 5, the empirical evidence suggests that de Finetti voting models with subcritical convergence speeds best describe real-world voting behaviour. So it seems that the assumption of a decay of social cohesion as the population grows is correct; however, this decay is fairly slow. See Example 1 in Section 4 for a simple example of such a de Finetti voting model where the parameters can be adjusted to fit the empirical per-capita voting margins presented in [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12].
Another way to assess the asymptotic loss of social cohesion is to look at the behaviour of correlations
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$ between two votes for any groups
$\lambda$ and
$\nu$. Note that because of the exchangeability of the random variables
$\left\{ X_{\lambda i}\,|\,i=1,\ldots,n_{\lambda}\right\} $ for any group
$\lambda$, it does not matter which two votes we pick for our correlation as long as they are two different votes:
Recall the transformation
$m\mapsto\bar{m}$ from Definition 3.
Proposition 1. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model and
$\left(\varepsilon_{n}\right)_{n}$ a sequence in
$\left(0,\infty\right)^{M}$ with
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$. If
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$, then
The proposition says that as a consequence of the loss of social cohesion represented by the assumption
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$ and
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$, individual votes become asymptotically uncorrelated, even if both votes belong to the same group. This is an interesting contrast to the results above which state that, provided that convergence is not supercritical, the group voting margins do not, in general, become independent in the large-population limit.
Remark 3. Note that we cannot say anything about the speed of convergence of
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)\xrightarrow[n\rightarrow\infty]{}0$ unless in addition to the speed of convergence of each
$\varepsilon_{n,\lambda}\xrightarrow[n\rightarrow\infty]{}0$ we also make an assumption about the speed of convergence of
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$.
Finally, we give a local limit theorem for the case of fast convergence. In this regime, the convergence in distribution can be strengthened to local convergence, i.e. convergence of the scaled point probabilities for the normalised sums to the Lebesgue density function
$\phi$ of
$\mathcal{N}\left(0,I_{M}\right)$. For this, we need to make an assumption about the tails of
$\left(\mu_{n}\right)_{n}$.
Theorem 8. Let
$\left(\mathbb{P}_{n}\right)_{n}$ be a de Finetti voting model with group sizes
$n_{\lambda}$, group voting margins
$S_{n,\lambda}$,
$\lambda=1,\ldots,M$, and de Finetti measures
$\left(\mu_{n}\right)_{n}$. Let
$\left(\varepsilon_{n}\right)_{n}$ be a sequence in
$\left(0,\infty\right)^{M}$ with the property that for each component
$\lambda$
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$. If
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$ and there is a constant
$\tau\in\left(0,1\right)^{M}$ such that
then
\begin{align*}\sup\nolimits_{x\in\mathcal{L}_{n}}\left|\frac{\prod_{\lambda=1}^{M}\sqrt{n_{\lambda}}}{2^{M}}\mathbb{P}\left(\left(\frac{S_{n,1}}{\sqrt{n_{1}}},\ldots,\frac{S_{n,M}}{\sqrt{n_{M}}}\right)=x\right)-\phi(x)\right|\xrightarrow[n\to\infty]{}0,\end{align*}
where
$\mathcal{L}_{n}$ is the lattice on which the vector
$\left(\frac{S_{n,1}}{\sqrt{n_{1}}},\ldots,\frac{S_{n,M}}{\sqrt{n_{M}}}\right)$ lives.
Note that the summability condition (3) on the sequence
$\left(n^{\frac{M-1}{2}}\mu_{n}\left(\mathbb{R}^{M}\backslash\left[-\tau,\tau\right]\right)\right)_{n}$ is a weaker assumption regarding the convergence speed of
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$ than an exponential concentration property in which for each
$\delta>0$ there are
$C,D>0$ such that
The Curie-Weiss model defined in Section 4 satisfies such an exponential concentration condition (31) in its high-temperature regime.
3. Proofs
3.1. Proof of Lemma 1
We show the implications (i)
$\implies$(ii), (ii)
$\implies$(iii), and (iii)
$\implies$(i).
3.1.1. (i)
$\implies$(ii).
Let
$\delta>0$ and let
$f\,:\,\mathbb{R}^{M}\rightarrow\mathbb{R}$ be a continuous and bounded function with the properties
\begin{align*}f\geq0,\quad f(0)=0,\quad\mathrm{and}\quad f(x)=1,x\in\mathbb{R}^{M}\backslash\prod_{\lambda=1}^{M}\left[-\delta,\delta\right].\end{align*}
The weak convergence of
$\left(\mu_{n}\right)_{n}$ to
$\delta_{0}$ implies
Since
$f\geq0$ and f equals 1 on
$\mathbb{R}^{M}\backslash\prod_{\lambda=1}^{M}\left[-\delta,\delta\right]$, we have
\begin{align*}\mu_{n}\left(\mathbb{R}^{M}\backslash\prod_{\lambda=1}^{M}\left[-\delta,\delta\right]\right)\xrightarrow[n\rightarrow\infty]{}0.\end{align*}
3.1.2.
$(ii)\implies(iii)$.
By (ii), for all
$m\in\mathbb{N}$ we have
\begin{equation}\mu_{n}\left(\mathbb{R}^{M}\backslash\prod_{\lambda=1}^{M}\left[-\frac{1}{m},\frac{1}{m}\right]\right)\xrightarrow[n\rightarrow\infty]{}0.\end{equation}
We define the natural numbers
$n_{1},n_{2},\ldots$ as follows:
\begin{align*}n_{m}\,:\!=\,\min\left\{ k\in\mathbb{N}\,\left|\,\mu_{n}\left(\prod_{\lambda=1}^{M}\left[-\frac{1}{m},\frac{1}{m}\right]\right)\geq1-\frac{1}{m},n\geq k\right.\right\} ,\quad m\in\mathbb{N}.\end{align*}
Note that the sets in the display are non-empty for each m by (4). Set
By construction,
$\left\Vert \varepsilon_{n}\right\Vert _{\infty}\xrightarrow[n\rightarrow\infty]{}0$ and
$\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}1$.
3.1.3.
$(iii)\implies(i)$.
Let
$f\,:\,\mathbb{R}^{M}\rightarrow\mathbb{R}$ be a continuous and bounded function. Let
$\eta>0$. Since f is continuous, there is a
$\delta>0$ such that, for all
$x\in\mathbb{R}^{M}$,
Then
Let
$n_{0}\in\mathbb{N}$ be large enough that
We continue with our calculation:
\begin{align*} ({5}) & =\int_{\left[-\varepsilon_{n},\varepsilon_{n}\right]}\left|f(x)-f(0)\right|\,\mu_{n}\left(\mathrm{d}x\right)+\int_{\mathbb{R}^{M}\backslash\left[-\varepsilon_{n},\varepsilon_{n}\right]}\left|f(x)-f(0)\right|\,\mu_{n}\left(\mathrm{d}x\right)\\ & \leq\eta\mu_{n}\left(\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)+2\left\Vert f\right\Vert _{\infty}\eta,\end{align*}
which proves the weak convergence of
$\left(\mu_{n}\right)_{n}$ to
$\delta_{0}$.
3.2. Proof of Theorem 4
The proofs of the theorems in Section 2 use characteristic functions. Thus, we have to show pointwise convergence of the sequence of characteristic functions of the normalised sums to the characteristic function of the limiting distribution. In the case of Theorem 4, we define
$\varphi_{n}$ to be the characteristic function of the distribution of
and
$\varphi_{\mathcal{N}\left(0,I_{M}\right)}$ to be the characteristic function of
$\mathcal{N}\left(0,I_{M}\right)$. Then our task is to show
$\varphi_{n}(t)\xrightarrow[n\rightarrow\infty]{}\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)$ for all
$t\in\mathbb{R}^{M}$. We will only prove the result for sequences of de Finetti measures on
$\left[-1,1\right]^{M}$. The results for de Finetti sequences on
$\mathbb{R}^{M}$ can be shown analogously.
We will use the following notation for ‘asymptotic equivalence’.
Notation 9. Complex-valued sequences
$\left(f_{n}\right)_{n},\left(g_{n}\right)_{n}$ are called asymptotically equivalent (as
$n\to\infty$), and we write
$f_{n}\approx g_{n}$, if
Recall Definition 2 and Notation 1. By Definition 3,
$\varphi_{n}(t)$ can be expressed as
\begin{align}\mathbb{E}\exp\left(it\cdot\boldsymbol{S}_{n}\right) & =\mathbb{E}\exp\left(i\left(t_{1}\frac{S_{n,1}}{\sqrt{n_{1}}}+\cdots+t_{M}\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\right)\nonumber \\ & =\int_{\left[-1,1\right]^{M}}E_{m}\exp\left(i\left(t_{1}\frac{S_{n,1}}{\sqrt{n_{1}}}+\cdots+t_{M}\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\right)\mu_{n}\left(\mathrm{d}m\right).\end{align}
We first note that from the boundedness of the integrand in (6) and the concentration property
we obtain
\begin{equation} ({6}) \approx\int_{\left[-\varepsilon_{n},\varepsilon_{n}\right]}E_{m}\exp\left(i\left(t_{1}\frac{S_{n,1}}{\sqrt{n_{1}}}+\cdots+t_{M}\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\right)\mu_{n}\left(\mathrm{d}m\right).\end{equation}
This step follows from the next lemma, provided that (7) converges to a non-zero limit, which we will show in (14).
Lemma 2. Let
$f_{n}\,:\,\left[-1,1\right]^{M}\rightarrow\mathbb{C}$ be measurable functions with
$\left\Vert f_{n}\right\Vert _{\infty}\leq1$,
$n\in\mathbb{N}$, and
$\left(\mu_{n}\right)_{n}$ the de Finetti sequence in the statement of Theorem 4. Then
Proof. We estimate
\begin{align*}\left|\int_{\left[-1,1\right]^{M}}f_{n}\,\mathrm{d}\mu_{n}-\int_{\left[-\varepsilon_{n},\varepsilon_{n}\right]}f_{n}\,\mathrm{d}\mu_{n}\right| & =\left|\int_{\mathbb{R}^{M}\backslash\left[-\varepsilon_{n},\varepsilon_{n}\right]}f_{n}\,\mathrm{d}\mu_{n}\right|\leq\int_{\mathbb{R}^{M}\backslash\left[-\varepsilon_{n},\varepsilon_{n}\right]}\left|f_{n}\right|\,\mathrm{d}\mu_{n}\\ & \leq\mu_{n}\left(\mathbb{R}^{M}\backslash\left[-\varepsilon_{n},\varepsilon_{n}\right]\right)\xrightarrow[n\rightarrow\infty]{}0.\end{align*}
Next we have to calculate the expectation
Under
$P_{m}^{\otimes n}$, all random variables
$X_{\lambda i}$,
$\lambda=1,\ldots,M$,
$i=1,\ldots,n_{\lambda}$, are independent. Within each group
$\lambda$, the
$X_{\lambda i}$ are even independent and identically distributed. We subtract the expected value
$m_{\lambda}$ of each
$X_{\lambda i}$ under
$P_{m}^{\otimes n}$. Note that for
$t_{\lambda}=0$,
\begin{align*}E_{m}\exp\left(i\left(t_{\lambda}\frac{\sum_{j}\left(X_{\lambda j}-m_{\lambda}\right)}{\sqrt{n_{\lambda}}}\right)\right)=1.\end{align*}
Now assume
$t_{\lambda}\neq0$. Using a Taylor expansion yields
\begin{align*}E_{m}\exp\left(i\left(t_{\lambda}\frac{\sum_{j}\left(X_{\lambda j}-m_{\lambda}\right)}{\sqrt{n_{\lambda}}}\right)\right) & =\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}+O\left(\frac{1}{n_{\lambda}^{3/2}}\right)\right)^{n_{\lambda}}.\end{align*}
Thus, the conditional expectation in the integral in (7) can be written as
\begin{align*}\prod_{\lambda\,:\,t_{\lambda}\neq0}\exp\left(im_{\lambda}t_{\lambda}\sqrt{n_{\lambda}}\right)\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}+O\left(\frac{1}{n_{\lambda}^{3/2}}\right)\right)^{n_{\lambda}}.\end{align*}
Set
\begin{align*}a_{n,\lambda} & \,:\!=\,\exp\left(im_{\lambda}t_{\lambda}\sqrt{n_{\lambda}}\right),\\b_{n,\lambda} & \,:\!=\,\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}+O\left(\frac{1}{n_{\lambda}^{3/2}}\right)\right)^{n_{\lambda}},\\c_{n,\lambda} & \,:\!=\,a_{n,\lambda}b_{n,\lambda}\end{align*}
for each n and each
$\lambda$.
First we analyse the asymptotic behaviour of
$\left(a_{n,\lambda}\right)_{n}$.
Lemma 3. For all
$n\in\mathbb{N}$ and all
$\lambda=1,\ldots,M$ we have
and
Proof. Since
$t_{\lambda}\neq0$ and m takes values on the interval
$\left[-\varepsilon_{n},\varepsilon_{n}\right]$,
$a_{n,\lambda}$ lies on the unit circle in the complex plane, specifically in the section defined by
$A_{n}$. The convergence speed
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$ implies
$\pm\left|t_{\lambda}\right|\varepsilon_{n,\lambda}\sqrt{n_{\lambda}}\xrightarrow[n\rightarrow\infty]{}0$ and therefore
$A_{n}\searrow\left\{ 1\right\} $ as
$n\rightarrow\infty$.
Next we deal with the sequence
$\left(b_{n,\lambda}\right)_{n}$. We estimate
\begin{align}\left|b_{n,\lambda}-\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\right| &\leq\left|b_{n,\lambda}-\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}\right| \nonumber\\&\quad+\left|\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}-\exp\left(-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}\right)\right|.\end{align}
We will find upper bounds for each of the summands in (8).
Lemma 4. There is a constant
$C>0$ such that for all
$n\in\mathbb{N}$ we have
\begin{align*}\left|b_{n,\lambda}-\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}\right|\leq\frac{C}{n_{\lambda}^{3/2}}.\end{align*}
Proof. We define
$r_{n_{\lambda}}\,:\!=\,\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}$ and
$s_{n_{\lambda}}$ to be the
$O\left(\frac{1}{n_{\lambda}^{3/2}}\right)$ term in the definition of
$b_{n,\lambda}$. Then we have
\begin{align*}b_{n,\lambda}=\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}+s_{n_{\lambda}}\right)^{n_{\lambda}}=\sum_{k=0}^{n_{\lambda}}\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{n_{\lambda}-k}s_{n_{\lambda}}^{k}=\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{n_{\lambda}}\sum_{k=0}^{n_{\lambda}}\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{k}.\end{align*}
We calculate
\begin{align*}\left|b_{n,\lambda}-\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}\right| & =\left|\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{n_{\lambda}}\sum_{k=0}^{n_{\lambda}}\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{k}-\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{n_{\lambda}}\right|\\ & =\left|1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right|^{n_{\lambda}}\left|\sum_{k=0}^{n_{\lambda}}\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{k}-1\right|\\ & =\left|1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right|^{n_{\lambda}}\left|\frac{1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}+1}}{1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}}-1\right|,\end{align*}
where in the last step we applied the formula for the value of a geometric series with complex summands. We note that
$r_{n_{\lambda}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}\frac{t_{\lambda}^{2}}{2}$ and hence
\begin{align*}\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}0\quad\mathrm{and}\quad\left|1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right|^{n_{\lambda}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}\exp\left(-\frac{t_{\lambda}^{2}}{2}\right).\end{align*}
There is a constant
$C_{1}>0$ such that
We continue with
\begin{align*}\left|\frac{1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}+1}}{1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}}-1\right| & =\left|\frac{1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}+1}-1+\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}}{1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}}\right|\\ & =\left|\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right|\left|\frac{1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}}}{1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}}\right|.\end{align*}
Now we note that
\begin{align*}1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}1,\quad1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}1,\quad\mathrm{and}\quad1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}1.\end{align*}
The above implies
\begin{align*}1-\frac{r_{n_{\lambda}}}{n_{\lambda}},1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}},1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}}=\Theta(1)\end{align*}
and the existence of a constant
$C_{2}>0$ such that
\begin{align*}\left|\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right|\left|\frac{1-\left(\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right)^{n_{\lambda}}}{1-\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}}\right|\leq C_{2}\left|\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right|,\quad n_{\lambda}\in\mathbb{N}.\end{align*}
Since
$1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}1$, there is a constant
$C_{3}>0$ such that
\begin{align*}\left|\frac{s_{n_{\lambda}}}{1-\frac{r_{n_{\lambda}}}{n_{\lambda}}}\right|\leq C_{3}\left|s_{n_{\lambda}}\right|,\quad n_{\lambda}\in\mathbb{N}.\end{align*}
Finally, since
$\left|s_{n_{\lambda}}\right|=O\left(\frac{1}{n_{\lambda}^{3/2}}\right)$, there is a constant
$C_{4}>0$ such that
The claim follows from setting
$C\,:\!=\,C_{1}C_{2}C_{3}C_{4}>0$.
Next we will find an upper bound for the second summand in (8).
Lemma 5. There is a constant
$D>0$ such that for all
$n\in\mathbb{N}$ we have
\begin{align*}\left|\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}-\exp\left(-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}\right)\right|\leq\frac{D}{n_{\lambda}}.\end{align*}
Proof. We again define
$r_{n_{\lambda}}\,:\!=\,\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}$. Recall that
$r_{n_{\lambda}}\xrightarrow[n_{\lambda}\rightarrow\infty]{}\frac{t_{\lambda}^{2}}{2}$. Choose
$m_{0}\in\mathbb{N}$ large enough that
\begin{equation}\left|\frac{r_{n_{\lambda}}}{n_{\lambda}}\right|<\frac{1}{2}\quad\mathrm{and}\quad\left|r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right|+2\frac{r_{n_{\lambda}}^{2}}{n_{\lambda}}<1,\quad n_{\lambda}\geq m_{0}.\end{equation}
We use Taylor expansions for the functions
$\exp$ and
$\ln$:
\begin{align*}\exp z & =1+z+O\left(z^{2}\right),\quad z\in\mathbb{R},\ \left|z\right|\leq1,\\\ln\left(1+z\right) & =z+O\left(z^{2}\right),\quad z\in\mathbb{R},\ \left|z\right|\leq\frac{1}{2},\end{align*}
More precisely, we have the bounds
on the remainder terms of order 2, as is easy to see from the Lagrange form of said remainder terms. The constant
$m_{0}$ in (9) is chosen to be such that the value of z in the Taylor expansions will be small enough in our calculations.
Then, for all
$n_{\lambda}\geq m_{0}$, we have
\begin{align*}\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}} & =\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{n_{\lambda}}=\exp\left[n_{\lambda}\ln\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)\right]\\ & =\exp\left[n_{\lambda}\left(-\frac{r_{n_{\lambda}}}{n_{\lambda}}+s_{n_{\lambda}}\right)\right]=\exp\left[-r_{n_{\lambda}}+n_{\lambda}s_{n_{\lambda}}\right],\end{align*}
where the remainder term
$s_{n_{\lambda}}$ satisfies
$\left|s_{n_{\lambda}}\right|\leq2\left(\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{2}=O\left(\frac{1}{n_{\lambda}^{2}}\right)$ by (11). We continue with our calculation:
\begin{align*}\exp\left(-r_{n_{\lambda}}+n_{\lambda}s_{n_{\lambda}}\right) & =\exp\left[-\frac{t_{\lambda}^{2}}{2}-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}\right]\\ & =\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\exp\left[-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}\right]\\ & =\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\left[1-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}+u_{n_{\lambda}}\right],\end{align*}
where the remainder term
$u_{n_{\lambda}}$ satisfies
\begin{align}\left|u_{n_{\lambda}}\right| & \leq\frac{e}{2}\left(\left(-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}\right)^{2}\right)\nonumber \\ & =O\left(\left(-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}\right)^{2}\right)\nonumber \\ & =O\left(\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)^{2}\right)+O\left(\left(n_{\lambda}s_{n_{\lambda}}\right)^{2}\right)=O\left(\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)^{2}\right)+O\left(\frac{1}{n_{\lambda}^{2}}\right),\end{align}
by (10). We used
$O\left(\left(n_{\lambda}s_{n_{\lambda}}\right)^{2}\right)=O\left(\frac{n_{\lambda}^{2}}{n_{\lambda}^{4}}\right)=O\left(\frac{1}{n_{\lambda}^{2}}\right)$ in the last step above. Now we estimate the difference
\begin{align*}& \quad \left|\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}-\exp\left(-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}\right)\right| \\& =\left|\left(1-\frac{r_{n_{\lambda}}}{n_{\lambda}}\right)^{n_{\lambda}}-\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\right|\\ & =\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\left|1-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}+u_{n_{\lambda}}-1\right|\\ & =\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\left|-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}+u_{n_{\lambda}}\right|.\end{align*}
Taking into account
$n_{\lambda}s_{n_{\lambda}}=O\left(\frac{1}{n_{\lambda}}\right)$ and (12), we have
\begin{align}&\quad \exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\left|-\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+n_{\lambda}s_{n_{\lambda}}+u_{n_{\lambda}}\right| \nonumber \\& \leq\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\left[\left|r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right|+\left|n_{\lambda}s_{n_{\lambda}}\right|+\left|u_{n_{\lambda}}\right|\right]\nonumber \\ & =O\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+O\left(\frac{1}{n_{\lambda}}\right) \nonumber \\ &\quad +O\left(\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)^{2}\right)+O\left(\frac{1}{n_{\lambda}^{2}}\right)\nonumber \\ & =O\left(r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right)+O\left(\frac{1}{n_{\lambda}}\right).\end{align}
Using the definition of
$r_{n_{\lambda}}$ and the assumption
$\varepsilon_{n,\lambda}=o\left(\frac{1}{\sqrt{n_{\lambda}}}\right)$, we have
\begin{align*}\left|r_{n_{\lambda}}-\frac{t_{\lambda}^{2}}{2}\right| & =m_{\lambda}^{2}\frac{t_{\lambda}^{2}}{2}\leq\varepsilon_{n,\lambda}^{2}\frac{t_{\lambda}^{2}}{2}=o\left(\frac{1}{n_{\lambda}}\right).\end{align*}
It follows from the above and (13) that
\begin{align*}\left|\left(1-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}\right)^{n_{\lambda}}-\exp\left(-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}\right)\right|=O\left(\frac{1}{n_{\lambda}}\right),\end{align*}
and hence the statement of the lemma is proved.
Lemmas 4 and 5 imply the following corollary.
Corollary 3. The range of
$b_{n,\lambda}$ over all possible values of
$m_{\lambda}\in\left[-\varepsilon_{n,\lambda},\varepsilon_{n,\lambda}\right]$ lies in a
$\frac{D}{n_{\lambda}}$-neighbourhood
$B_{n}$ of the set
$\left[\exp\left(-\frac{t_{\lambda}^{2}}{2}\right),\exp\left(-\left(1-\varepsilon_{n,\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2}\right)\right]$ in
$\mathbb{C}$. The set sequence
$B_{n}$ converges:
\begin{align*}B_{n}\searrow\left\{ \exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\right\} \quad\mathrm{as }n\rightarrow\infty.\end{align*}
Since
$\mu_{n}$ is symmetric, once we integrate
$c_{n,\lambda}$ with respect to
$\mu_{n}$, only the integral of the real part
$\mathrm{Re}\left(c_{n,\lambda}\right)$ remains. This real part is the radius of the circle on which all values of
$c_{n,\lambda}$ lie, and these radii are the values that comprise the set
$B_{n}$. As each
$\mu_{n}$ is a probability measure and we assumed
$\mu_{n}\left[-\varepsilon_{n},\varepsilon_{n}\right]\xrightarrow[n\rightarrow\infty]{}1$, we have
\begin{align} ({7}) & \xrightarrow[n\rightarrow\infty]{}\prod_{\lambda=1}^{M}\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)=\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t).\end{align}
As we see, (7) converges to a non-zero limit as
$n\rightarrow\infty$, thereby proving the asymptotic equivalence of (7) to
$\varphi_{n}(t)$.
This concludes the proof of Theorem 4.
3.3. Proof of Theorem 6
We now show the statements of Theorem 6. The first statement is a corollary of Theorem 4. To prove the second statement, we once again have to calculate
$\varphi_{n}(t)=\mathbb{E}\exp\left(it\cdot\boldsymbol{S}_{n}\right)$. The normalisation
$\gamma_{n,\lambda}=\sqrt{n_{\lambda}}$ is the same as in Theorem 4. Since
$\mu_{n}$ is the contraction of
$\mu$, which has support in
$\left[-1,1\right]^{M}$, the support of
$\mu_{n}$ is a subset of
$\left[-\varepsilon_{n},\varepsilon_{n}\right]$ for each
$n\in\mathbb{N}$, and hence
At this point, we change variables by setting
$s\,:\!=\,\left(\frac{1}{\varepsilon_{n,1}},\ldots,\frac{1}{\varepsilon_{n,M}}\right)\circ m$. Then
\begin{align} ({15}) & =\int_{\left[-1,1\right]^{M}}E_{\varepsilon_{n}\circ s}\exp\left(i\left(t_{1}\frac{S_{n,1}}{\sqrt{n_{1}}}+\cdots+t_{M}\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\right)\mu_{n}\left(\mathrm{d}\left(\varepsilon_{n}\circ s\right)\right)\nonumber \\ & =\int_{\left[-1,1\right]^{M}}E_{\varepsilon_{n}\circ s}\exp\left(i\left(t_{1}\frac{S_{n,1}}{\sqrt{n_{1}}}+\cdots+t_{M}\frac{S_{n,M}}{\sqrt{n_{M}}}\right)\right)\mu\left(\mathrm{d}s\right),\end{align}
where we used that, by definition,
$\mu_{n}\left(\varepsilon_{n}\circ A\right)=\mu\left(A\right)$ for all measurable sets A. The conditional expectations
$E_{\varepsilon_{n}\circ s}\exp\left(it_{\lambda}\frac{S_{n,\lambda}}{\sqrt{n_{\lambda}}}\right)$ can be expressed via a Taylor expansion as
\begin{align*}E_{\varepsilon_{n}\circ s}\exp\left(it_{\lambda}\frac{S_{n,\lambda}}{\sqrt{n_{\lambda}}}\right) & =\exp\left(i\varepsilon_{n,\lambda}s_{\lambda}t_{\lambda}\sqrt{n_{\lambda}}\right)\left(1-\left(1-\varepsilon_{n,\lambda}^{2}s_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2n_{\lambda}}+O\left(\frac{1}{n_{\lambda}^{3/2}}\right)\right)^{n_{\lambda}}\\ & \xrightarrow[n\rightarrow\infty]{}\exp\left(it_{\lambda}h_{\lambda}s_{\lambda}\right)\exp\left(-\frac{t_{\lambda}^{2}}{2}\right).\end{align*}
By dominated convergence, we obtain
\begin{align*} ({16}) & \xrightarrow[n\rightarrow\infty]{}\int_{\left[-1,1\right]^{M}}\prod_{\lambda=1}^{M}\exp\left(it_{\lambda}h_{\lambda}s_{\lambda}\right)\exp\left(-\frac{t_{\lambda}^{2}}{2}\right)\mu\left(\mathrm{d}s\right)=\varphi_{\mu}\left(h\circ t\right)\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t),\end{align*}
where
$\varphi_{\mu}$ is the characteristic function of
$\mu$.
Since
$\varphi_{\mu}\left(h\circ t\right)=\varphi_{h\circ\mu}\left(t\right)$, this concludes the proof of the second statement of Theorem 6.
In the statement (iii), we have the normalisation sequences
$\gamma_{n,\lambda}\,:\!=\,\varepsilon_{n,\lambda}n_{\lambda}$. Let
$\varphi_{n}$ be the characteristic function of the distribution of
The proof of (iii) proceeds as outlined above and yields
We once again expand the conditional expectation in the integral above:
\begin{align*}E_{\varepsilon_{n}\circ s}\exp\left(it_{\lambda}\frac{S_{n,\lambda}}{\gamma_{n,\lambda}}\right) & =\exp\left(i\varepsilon_{n,\lambda}s_{\lambda}t_{\lambda}\frac{n_{\lambda}}{\gamma_{n,\lambda}}\right)\left(1-\left(1-\varepsilon_{n,\lambda}^{2}s_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{2\gamma_{n,\lambda}^{2}}+O\left(\frac{1}{\gamma_{n,\lambda}^{3}}\right)\right)^{n_{\lambda}}.\end{align*}
Recall that we assumed
$1/\sqrt{n_{\lambda}}=o\left(\varepsilon_{n,\lambda}\right)$. It follows that
$1/n_{\lambda}=o\left(\varepsilon_{n,\lambda}^{2}\right)$ and
$n_{\lambda}\varepsilon_{n,\lambda}^{2}\xrightarrow[n\rightarrow\infty]{}\infty$. Hence,
$n_{\lambda}=o\left(\varepsilon_{n,\lambda}^{2}n_{\lambda}^{2}\right)$, and since
$\gamma_{n,\lambda}^{2}=\varepsilon_{n,\lambda}^{2}n_{\lambda}^{2}$ we have
By dominated convergence,
\begin{align*}\varphi_{n}(t) & \xrightarrow[n\rightarrow\infty]{}\int_{\left[-1,1\right]^{M}}\prod_{\lambda=1}^{M}\exp\left(is_{\lambda}t_{\lambda}\right)\mu\left(\mathrm{d}s\right)=\varphi_{\mu}\left(t\right),\end{align*}
and our proof is complete.
We omit the proof of Theorem 7 as it amounts to a repetition of the arguments presented above, carefully keeping track of the coordinates belonging to each of the three clusters. Corollaries 1 and 2 follow immediately from Theorem 7.
3.4. Proof of Proposition 1
We calculate the correlation
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$ using Definition 3:
\begin{align*}\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right) & =\int_{\mathbb{R}^{M}}E_{\bar{m}}\left(X_{\lambda1}X_{\nu2}\right)\,\mu_{n}\left(\mathrm{d}m\right) \\& =\int_{\mathbb{R}^{M}}\left(P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}=X_{\nu2}\right)-P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}\neq X_{\nu2}\right)\right)\,\mu_{n}\left(\mathrm{d}m\right)\\ & =2\int_{\mathbb{R}^{M}}P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}=X_{\nu2}\right)\,\mu_{n}\left(\mathrm{d}m\right)-1.\end{align*}
We express
$P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}=X_{\nu2}\right)$ in terms of
$\bar{m}$:
\begin{align*}P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}=X_{\nu2}\right) & =P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}=X_{\nu2}=1\right)+P_{\bar{m}}^{\otimes n}\left(X_{\lambda1}=X_{\nu2}=-1\right)\\ & =\frac{1+\bar{m}_{\lambda}}{2}\frac{1+\bar{m}_{\nu}}{2}+\frac{1-\bar{m}_{\lambda}}{2}\frac{1-\bar{m}_{\nu}}{2}=\frac{1+\bar{m}_{\lambda}\bar{m}_{\nu}}{2},\end{align*}
where in the second step we used that all
$X_{\kappa i}$ are independent random variables under
$P_{\bar{m}}^{\otimes n}$. Hence,
We have
and we upper-bound each summand in turn:
where we used the fact that
$\lim_{m\rightarrow0}\frac{m_{\kappa}}{\bar{m}_{\kappa}}=1$ for all
$\kappa=1,\ldots,M$, and
where we used that
$\left\Vert \bar{m}_{\lambda}\bar{m}_{\nu}\right\Vert _{\infty}\leq1$.
3.5. Proof of Theorem 8
For our proof of the local limit theorem, Theorem 8, we will need the following auxiliary lemmas.
Lemma 6. Let
$Y\,:\!=\,\left(Y_{1},\ldots,Y_{d}\right)$ be a random vector with values on the lattice
$\prod_{\lambda=1}^{d}\left(v_{\lambda}+w_{\lambda}\mathbb{Z}\right)$, where
$v_{\lambda}\in\mathbb{R}$ and
$w_{\lambda}>0$, and let
$\varphi$ be the characteristic function of the distribution of Y. Then for all
$k_{1},\ldots,k_{d}\in\mathbb{Z}$ we have
and for all
$t\in\mathbb{R}^{d}$ such that
$0\lt t_{\lambda}\lt \frac{2\pi}{w_{\lambda}}$ for at least one component
$\lambda$, we have
Proof. The lemma follows from the proof of Theorem 3.5.2 on page 140 in [Reference Durrett7].
Lemma 6 gives an upper bound for the characteristic function of a random vector on a lattice (such as
$\boldsymbol{S}_{n}$), which we shall use in our calculations later on. We will use the following inversion formulas to recover distributions from their characteristic functions.
Lemma 7. Let
$\left(Y_{1},\ldots,Y_{d}\right)$ be a random vector as in Lemma 6 with characteristic function
$\varphi$. Then, for all
$x\in\prod_{\lambda=1}^{d}\left(v_{\lambda}+w_{\lambda}\mathbb{Z}\right)$,
\begin{align*}\mathbb{P}\left(\left(Y_{1},\ldots,Y_{d}\right)=x\right)=\frac{\prod_{\lambda=1}^{d}w_{\lambda}}{\left(2\pi\right)^{d}}\int_{\prod_{\lambda}\left[-\frac{\pi}{w_{\lambda}},\frac{\pi}{w_{\lambda}}\right]}e^{-it\cdot x}\,\varphi(t)\,\mathrm{d}t.\end{align*}
Proof. See e.g. Section 3.10 in [Reference Durrett7].
Lemma 8. Let
$\varphi$ be the characteristic function of some probability distribution on
$\mathbb{R}^{d}$ such that
$\varphi$ is Lebesgue integrable. Then
for all
$x\in\mathbb{R}^{d}$ defines a continuous Lebesgue density function f for said probability distribution.
Proof. This is Theorem 5.5 in [Reference Wengenroth36] (alternatively, see Theorem 3.3.14 in [Reference Durrett7]).
Now we start the proof proper of Theorem 8. Let
$\mathbb{1}_{A}$ be the indicator function of a measurable set A. The lattice on which
$\boldsymbol{S}_{n}$ lives is
$\mathcal{L}_{n}\,:\!=\,\prod_{\lambda=1}^{M}\left(\sqrt{n_{\lambda}}+\frac{2}{\sqrt{n_{\lambda}}}\mathbb{Z}\right)$. Let
$x\in\mathcal{L}_{n}$. By Lemmas 7 and 8, we have
\begin{align}& \quad \left|\frac{\prod_{\lambda=1}^{M}\sqrt{n_{\lambda}}}{2^{M}}\mathbb{P}\left(\boldsymbol{S}_{n}=x\right)-\phi(x)\right| \nonumber \\& =\frac{1}{\left(2\pi\right)^{M}}\left|\int_{\prod_{\lambda}\left[-\frac{\pi\sqrt{n_{\lambda}}}{2},\frac{\pi\sqrt{n_{\lambda}}}{2}\right]}e^{-it\cdot x}\varphi_{n}(t)\,\mathrm{d}t-\int_{\mathbb{R}^{M}}e^{-it\cdot x}\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)\,\mathrm{d}t\right|\nonumber \\ & \leq\frac{1}{\left(2\pi\right)^{M}}\int_{\mathbb{R}^{M}}\mathbb{1}_{\prod_{\lambda}\left[-\frac{\pi\sqrt{n_{\lambda}}}{2},\frac{\pi\sqrt{n_{\lambda}}}{2}\right]}(t)\left|\varphi_{n}(t)-\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)\right|\mathrm{d}t \end{align}
Note that both (18) and (19) are independent of the point
$x\in\mathcal{L}_{n}$. The term (19) converges to 0 as
$n\rightarrow\infty$, since
$\left|\varphi_{\mathcal{N}\left(0,I_{M}\right)}\right|$ is integrable. Thus, our remaining task is to show that (18) converges to 0. By Theorem 4, which we have already shown,
$\varphi_{n}(t)\xrightarrow[n\rightarrow\infty]{}\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)$ holds for all
$t\in\mathbb{R}^{M}$. Hence, we can prove that (18) converges to 0 by finding an appropriate integrable majorant and applying the theorem of dominated convergence.
We pick some
$0<\delta<\pi/2$ and partition the set
$\prod_{\lambda}\left[-\frac{\pi\sqrt{n_{\lambda}}}{2},\frac{\pi\sqrt{n_{\lambda}}}{2}\right]$ into the disjoint sets
$A_{n}\,:\!=\,\prod_{\lambda}\left[-\delta\sqrt{n_{\lambda}},\delta\sqrt{n_{\lambda}}\right]$ and
$B_{n}\,:\!=\,\prod_{\lambda}\left[-\frac{\pi\sqrt{n_{\lambda}}}{2},\frac{\pi\sqrt{n_{\lambda}}}{2}\right]\backslash A_{n}$ for each
$n\in\mathbb{N}$. For all
$s\in\left[-1,1\right]$, let
$\varphi_{\mathcal{R}(s)}$ be the characteristic function of the Rademacher distribution on
$\left\{ -1,1\right\} $ (see Definition 2).
We construct an integrable majorant first over
$A_{n}$ and then
$B_{n}$. The following upper bound holds over
$A_{n}$:
The next lemma will provide an upper bound for the characteristic function of the Rademacher distribution.
Lemma 9. For any
$x\in\mathbb{R}$ and any
$n\in\mathbb{N}$, the upper bound
\begin{align*}\left|\exp\left(ix\right)-\sum_{k=0}^{n}\frac{\left(ix\right)^{k}}{k!}\right|\leq\min\left\{ \frac{\left|x\right|^{n+1}}{\left(n+1\right)!},\frac{2\left|x\right|^{n}}{n!}\right\}\end{align*}
holds.
Proof. We use Taylor expansions with the remainder term in Legendre form. First we expand to order n,
and then to order
$n-1$,
\begin{align*}\exp\left(ix\right)-\sum_{k=0}^{n-1}\frac{\left(ix\right)^{k}}{k!}=\frac{\left(ix\right)^{n}\exp\left(i\xi_{n}\right)}{n!}.\end{align*}
The variables
$\xi_{n}$ and
$\xi_{n+1}$ each lie between 0 and x. Combining the two displays above yields
\begin{align}\exp\left(ix\right)-\sum_{k=0}^{n}\frac{\left(ix\right)^{k}}{k!} & =\exp\left(ix\right)-\sum_{k=0}^{n-1}\frac{\left(ix\right)^{k}}{k!}-\frac{\left(ix\right)^{n}}{n!}\nonumber \\ & =\frac{\left(ix\right)^{n}\exp\left(i\xi_{n}\right)}{n!}-\frac{\left(ix\right)^{n}}{n!}.\end{align}
Taking into account
$\left|i^{n}\right|=\left|i^{n+1}\right|=\left|\exp\left(i\xi_{n}\right)\right|=1$, we obtain the desired result by applying upper bounds to the absolute value of (21) and (22).
Applying the lemma to
$x=X_{\lambda1}-s$ and
$n=2$ and taking the expectation
$E_{s}$, we obtain
\begin{align}&\quad \left|E_{s}\exp\left(iu\left(X_{\lambda1}-s\right)\right)-E_{s}\left(\sum_{k=0}^{2}\frac{\left(iu\right)^{k}\left(X_{\lambda1}-s\right)^{k}}{k!}\right)\right| \nonumber \\& \leq u^{2}E_{s}\min\left\{ \frac{\left|u\right|\left|X_{\lambda1}-s\right|^{3}}{3!},\left|X_{\lambda1}-s\right|^{2}\right\} \nonumber \\ & \leq u^{2}\min\left\{ \frac{\left|u\right|E_{s}\left|X_{\lambda1}-s\right|^{3}}{3!},E_{s}\left|X_{\lambda1}-s\right|^{2}\right\} .\end{align}
We calculate the expectations in the upper bound above:
We calculate an upper bound for the Rademacher characteristic function:
\begin{align*}\left|\varphi_{\mathcal{R}(s)}(u)\right| & =\left|E_{s}\exp\left(iu\left(X_{\lambda1}-s\right)\right)\right|\left|\exp\left(ius\right)\right|\\ & \leq\left|1-\left(1-s^{2}\right)\frac{u^{2}}{2}\right|+u^{2}\left(1-s^{2}\right)\min\left\{ \left|u\right|\left|s\right|,1\right\} \\ & \leq1-\left(1-s^{2}\right)\frac{u^{2}}{2}+\left(1-s^{2}\right)\frac{u^{2}}{4}\leq\exp\left(-\left(1-s^{2}\right)\frac{u^{2}}{4}\right).\end{align*}
Above, in the first inequality, we used a Taylor expansion of order 2 with remainder term upper-bounded by (23). The second inequality holds for all
$u\in\mathbb{R}$ such that
$\left|u\right|\left|s\right|\leq1/4$, for which we have
The third inequality follows from
$1-x\leq\exp\left(-x\right)$ for all
$x\in\mathbb{R}$.
Therefore,
\begin{align*}\left|\varphi_{\mathcal{R}\left(m_{\lambda}\right)}\left(\frac{t_{\lambda}}{\sqrt{n_{\lambda}}}\right)\right|\leq\exp\left(-\left(1-m_{\lambda}^{2}\right)\frac{t_{\lambda}^{2}}{4n_{\lambda}}\right)\end{align*}
holds for all
$n\in\mathbb{N}$ large enough.
By assumption, there is some
$\tau\in\left(0,1\right)^{M}$ with the property (3). We continue with our calculation:
\begin{align} ({20}) & \leq\mathbb{1}_{A_{n}}(t)\int_{\left[-1,1\right]^{M}}\exp\left(-\frac{1}{4}\sum_{\lambda}\left(1-m_{\lambda}^{2}\right)t_{\lambda}^{2}\right)\mu_{n}(\mathrm{d}m)\nonumber \\ & \leq\int_{\left[-\tau,\tau\right]}\exp\left(-\frac{1}{4}\sum_{\lambda}\left(1-m_{\lambda}^{2}\right)t_{\lambda}^{2}\right)\mu_{n}(\mathrm{d}m)+\mathbb{1}_{A_{n}}(t)\,\mu_{n}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right)\nonumber \\ & \leq\exp\left(-\frac{1}{4}\sum_{\lambda}\left(1-\tau_{\lambda}^{2}\right)t_{\lambda}^{2}\right)+\mathbb{1}_{A_{n}}(t)\,\mu_{n}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right).\end{align}
It is clear that the first summand in (24) is integrable. For the second summand, we have
\begin{align*}\mathbb{1}_{A_{n}}(t)\,\mu_{n}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right) & \leq\mathbb{1}_{A_{1}}\left(t\right)\mu_{1}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right) \\&\quad +\sum_{k=1}^{\infty}\mathbb{1}_{A_{k+1}\backslash A_{k}}\left(t\right)\,\mu_{k}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right)\\ & =\!:\,f(t).\end{align*}
Let
$\boldsymbol{\lambda}^{M}$ be the Lebesgue measure on
$\mathbb{R}^{M}$. We show that the function f on the right-hand side is an integrable majorant for all
$\mathbb{1}_{A_{n}}(t)\,\mu_{n}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right)$,
$n\in\mathbb{N}$:
Each summand in the series above can be bounded above by
\begin{align*}& \quad \boldsymbol{\lambda}^{M}\left(A_{k+1}\backslash A_{k}\right)\mu_{k}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right) \\& \leq O\left(\left(\sqrt{k+1}-\sqrt{k}\right)\left(\sqrt{k+1}\right)^{M-1}\right)\mu_{k}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right),\end{align*}
which is summable in k by (3).
As
$\left|\varphi_{\mathcal{N}\left(0,I_{M}\right)}\right|$ is integrable as well, we have thus found an integrable majorant for
$\mathbb{1}_{A_{n}}(t)\left|\varphi_{n}(t)-\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)\right|$. By Theorem 4,
$\left|\varphi_{n}(t)-\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)\right|\xrightarrow[n\rightarrow\infty]{}0$ pointwise, so we conclude that the integral of
$\mathbb{1}_{A_{n}}(t)\left|\varphi_{n}(t)-\varphi_{\mathcal{N}\left(0,I_{M}\right)}(t)\right|$ over
$\mathbb{R}^{M}$ converges to 0 as
$n\rightarrow\infty$.
We proceed with the integrand over the set
$B_{n}$:
\begin{align}\mathbb{1}_{B_{n}}(t)\left|\varphi_{n}(t)\right| & \leq\mathbb{1}_{B_{n}}(t)\int_{\left[-1,1\right]^{M}}\prod_{\lambda}\left|\varphi_{\mathcal{R}\left(m_{\lambda}\right)}\left(\frac{t}{\sqrt{n_{\lambda}}}\right)\right|^{n_{\lambda}}\mu_{n}(\mathrm{d}m)\nonumber \\ & \leq\mathbb{1}_{B_{n}}(t)\int_{\left[-1,1\right]^{M}}\left(\theta(m)\right)^{n}\mu_{n}(\mathrm{d}m),\end{align}
where the existence of
is a consequence of Lemma 6. We continue with the calculation of an upper bound using the constant
$\tau$ from (3):
\begin{align*} ({25}) \leq\mathbb{1}_{B_{n}}(t)\int_{\left[-\tau,\tau\right]}\left(\theta(m)\right)^{n}\,\mu_{n}(\mathrm{d}m)+\mathbb{1}_{B_{n}}(t)\,\mu_{n}\left(\left[-1,1\right]^{M}\backslash\left[-\tau,\tau\right]\right).\end{align*}
On the interval
$\left[-\tau,\tau\right]$,
$\theta$ is bounded away from 1:
This leads us to our final upper bound
For the last expression, we can construct an integrable majorant in the same manner as for the second summand in (24). This concludes the proof of Theorem 8.
4. Examples of de Finetti voting models
We discuss two classes of voting models featured prominently in the literature that are de Finetti voting models according to Definition 3. As mentioned in the introduction, models of voting behaviour are often adapted from statistical physics. Two categories are the collective bias model (CBM) and the Curie-Weiss model (CWM). The single-group CBM first appeared in Straffin’s work on voting systems [Reference Straffin, Brams, Lucas, Stran and Springer32] with a uniform de Finetti measure. It was later generalised in the works [Reference Kirsch14, Reference Kirsch and Langner15]. The CWM in its single-group version has a long history in statistical physics and was first defined by Husimi [Reference Husimi13] and Temperley [Reference Temperley33]. It has seen a multitude of applications to the social sciences (see [Reference Brock and Durlauf2] for the first instance in which the CWM was used in such a context). The multi-group version of the CWM was defined independently in [Reference Berthet, Rigollet and Srivastava1, Reference Contucci and Gallo4]. Subsequently, the model has received considerable attention from other authors (see [Reference Collet3, Reference Fedele8, Reference Fedele and Contucci9, Reference Kirsch and Toth17, Reference Kirsch and Toth18, Reference Kirsch and Toth21–Reference Löwe and Schubert23).
In the CWM, the voters tend to align with each other and there is no external influence on them. In the CBM, the voters do not care about others’ opinions, but there is some central influence (such as a cultural or religious institution) that induces correlation between the voters. In this sense, the two models are opposites. However, mathematically, they have more in common than a cursory glance would suggest. A multi-group CBM is defined by the voting measure
for all voting configurations
$\left(x_{11},\ldots,x_{Mn_{M}}\right)$. In the integral above,
$\mu$ is a symmetric probability measure on
$\left[-1,1\right]^{M}$; also, recall the probability measure
$P_{m}^{\otimes n}$ from Notation 1. By (26), the CBM is a de Finetti voting model according to Definition 3 with a constant sequence of de Finetti measures
$\mu_{n}\,:\!=\,\mu$,
$n\in\mathbb{N}$.
The variable m in the integral (26) measures the prevalent bias in the population. A positive bias means the voters are more likely to be in favour of the proposal. For a fixed bias m, the voters are conditionally independent in their decisions. In a CBM,
The above limit theorem provides useful information on the large-population behaviour of the CBM with the single exception of the (degenerate) case
$\mu=\delta_{0}$, in which all voters are independent and we have the central limit theorem
See [Reference Kirsch and Toth20] for these results.
While a CBM is a de Finetti voting model, it does not satisfy the assumption of decreasing social cohesion embodied by the weak convergence of
$\mu_{n}$ to
$\delta_{0}$, except when
$\mu=\delta_{0}$. For more on single-group CBMs in the context of voting theory, see [Reference Kirsch14], and for an in-depth discussion of multi-group versions of the CBM, see [Reference Kirsch and Toth20].
The single-group CWM is defined for all voting configurations
$\left(x_{1},\ldots,x_{n}\right)$ by
\begin{align*}\mathbb{P}_{\mathrm{CWM}}\left(X_{1}=x_{1},\ldots,X_{n}=x_{n}\right)\,:\!=\,Z_{\beta,n}^{-1}\exp\left(\frac{\beta}{2n}\left(\sum_{i=1}^{n}x_{i}\right)^{2}\right),\end{align*}
where
$Z_{\beta,n}$ is a normalisation constant which depends on
$\beta$ and n. The parameter
$\beta\geq0$ is the inverse temperature in the physical context of the CWM as a model of ferromagnetism. As a voting model,
$\beta$ measures the degree of influence the voters exert over each other. As we see, the most probable voting configurations are those with unanimous votes in favour of or against the proposal. However, there are only two of these extreme configurations, whereas there is a multitude of low-probability configurations with roughly equal numbers of votes for and against. This is the ‘conflict between energy and entropy’. Which one of these pseudo-forces dominates depends on the regime the model is in, determined by the value of the parameter
$\beta\geq0$. Using the Hubbard–Stratonovich transformation, the CWM can also be expressed in the following way (see e.g. Chapter 2 of [Reference Friedli and Velenik10] or Theorem 5.6 in the monograph [Reference Kirsch16]):
\begin{align}& \quad \mathbb{P}_{\mathrm{CWM}}\left(X_{1}=x_{1},\ldots,X_{n}=x_{n}\right) \nonumber \\
& =\left(Z^{\prime}_{\beta,n}\right)^{-1}\int_{\left[-1,1\right]}P_{m}^{\otimes n}\left(x_{11},\ldots,x_{Mn_{M}}\right)\frac{\exp\left(-nF\left(m\right)\right)}{1-m^{2}}\,\mathrm{d}m,\end{align}
for all voting configurations
$\left(x_{1},\ldots,x_{n}\right)$. Here
is a normalisation constant and the function F above is given by
\begin{equation*}F\left(m\right)\,:\!=\,\frac{1}{2}\left(\frac{1}{\beta}\left(\frac{1}{2}\ln\frac{1+m}{1-m}\right)^{2}+\ln\left(1-m^{2}\right)\right), \qquad m\in\left[-1,1\right].\end{equation*}
The representation (29) of the CWM is called the ‘de Finetti representation’. We note that for fixed n we can define
where
$\boldsymbol{\lambda}$ is the Lebesgue measure, and the CWM is a CBM. However, this is only true for fixed n. Whereas in (26) the de Finetti measure
$\mu$ is static, i.e. independent of n, in (29) we see that there is a different de Finetti measure
$\mu_{n}$ for each model of size n. Hence, taken as a class of models with any
$n\in\mathbb{N}$, the CWM is not a special case of the CBM.
The CWM has three distinct ‘regimes’ in which the voting margin
$S_{n}$ behaves differently. For
$\beta<1$, the so-called ‘high-temperature regime’,
$S_{n}/\sqrt{n}$ converges in distribution to a centred normal distribution. The sequence of de Finetti measures defined in (30) converges weakly to the Dirac measure at 0. Moreover, it has a concentration property: for any
$\delta>0$, there are constants
$C,D>0$ such that
This exponential decay is key to analysing the asymptotic behaviour of the CWM. In the ‘critical regime’,
$\beta=1$, a limit theorem holds for
$S_{n}/n^{3/4}$ with a limiting distribution which is not normal. Instead, the distribution has a density proportional to
$\exp\left(-x^{4}/12\right)$,
$x\in\mathbb{R}$. In the ‘low-temperature regime’,
$\beta>1$,
$S_{n}/n$ converges to the convex combination of two Dirac measures,
$1/2\left(\delta_{-m(\beta)}+\delta_{m(\beta)}\right)$, where
$0\lt m(\beta)<1$ is the positive solution of the Curie-Weiss equation
$x=\tanh(\beta x)$.
The multi-group version of the CWM defined in (29) is given by a positive semi-definite coupling matrix
$J=\left(J_{\lambda\nu}\right)_{\lambda,\nu=1,\ldots,M}\in\mathbb{R}^{M\times M}$ and the Gibbs measure
\begin{equation}\mathbb{P}_{\mathrm{CWM}}\left(X_{11}=x_{11},\ldots,X_{Mn_{M}}=x_{Mn_{M}}\right)\,:\!=\,Z_{J,n}^{-1}\exp\left(\frac{1}{2}\sum_{\lambda,\nu=1}^{M}\frac{J_{\lambda\nu}}{\sqrt{n_{\lambda}n_{\nu}}}\sum_{i=1}^{n_{\lambda}}\sum_{j=1}^{n_{\nu}}x_{\lambda i}x_{\nu j}\right)\end{equation}
for all voting configurations. The normalisation constant
$Z_{J,n}$ depends on the group sizes
$n_{\lambda}=n_{\lambda}(n)$ and the coupling matrix J. The entries
$J_{\lambda\nu}$ of the coupling matrix give the strength of interaction between any pair of voters, one belonging to group
$\lambda$ and the other to group
$\nu$. For this probability measure, there is a de Finetti representation given by
Above, the mapping
$m\mapsto\bar{m}$ is
$\bar{m}\,:\!=\,\left(\tanh m_{\lambda}\right)_{\lambda=1,\ldots,M}$. The CWM has a sequence of de Finetti measures given by
with
$\boldsymbol{\lambda}^{M}$ being the Lebesgue measure on
$\mathbb{R}^{M}$. See [Reference Kirsch and Toth21, display (12)] for the form of
$F_{J,n}$ and [Reference Kirsch and Toth21, Section 2] for the three regimes of the model. An alternative representation with compactly supported de Finetti measures can be obtained by a change of variables in the integral in (32), setting
$t\,:\!=\,\left(\tanh x_{\lambda}\right)_{\lambda=1,\ldots,M}$, which yields de Finetti measures
$\mu^{\prime}_{n}$ whose support belongs to
$\left[-1,1\right]^{M}$. The multi-group CWM thus fits into the framework outlined in Definition 3.
The parameter space of the multi-group CWM is
Analogously to the single-group model, the multi-group CWM has three regimes. If J is positive definite, the high-temperature regime is the region in
$\Phi$ where
$C\,:\!=\,\left(I_{M}-J\right)^{-1}$ is positive definite. If
$J=\left(\beta\right)_{\lambda,\nu=1,\ldots,M}$,
$\beta<1$ characterises the high-temperature regime. In both cases, this regime features weak interactions between voters. The sequence
$\left(\mu_{n}\right)_{n}$ given in (33) exhibits a critical convergence speed according to Definition 5, and the limiting distribution of
$\left(S_{n,1}/\sqrt{n_{1}},\ldots,S_{n,M}/\sqrt{n_{M}}\right)$ is
$\mathcal{N}\left(0,C\right)$ with a (generally) non-diagonal covariance matrix C. As such, the limiting distribution of
$\left(S_{n,1}/\sqrt{n_{1}},\ldots,S_{n,M}/\sqrt{n_{M}}\right)$ can be expressed as the convolution of two normal distributions:
where
$\Sigma=\left(J^{-1}-I_{M}\right)^{-1}$ if the coupling matrix J is positive definite, and
$\Sigma=\left(\beta/\left(1-\beta\right)\right)_{\lambda,\nu=1,\ldots,M}$ is singular if J is a homogeneous matrix with all its entries equal to some
$0\leq\beta<1$. The critical regime of the CWM fits into the subcritical regime according to Definition 5. Lastly, the low-temperature regime of the CWM features a sequence
$\left(\mu_{n}\right)_{n}$ defined in (33) which does not converge weakly to
$\delta_{0}$. See [Reference Kirsch and Toth21, Sections 3 and 5.2] for more details.
In the CWM, all groups must be in the same regime of convergence speeds given in Definition 5, unless there are clusters of groups which are already independent for finite n, because the coupling constants between groups belonging to different clusters are equal to 0. This setup is realised by choosing the coupling matrix J to be a block diagonal matrix. For CBMs, since the de Finetti sequence
$\left(\mu_{n}\right)_{n}$ is constant and equal to
$\mu$ given in (26),
$\mu_{n}$ does not converge to
$\delta_{0}$ at all, except in the degenerate case
$\mu=\delta_{0}$ noted above.
No version of either the CBM or the CWM exhibits behaviour in line with the empirical evidence provided in [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12] and discussed in the introduction. Depending on the de Finetti measure
$\mu$, the CBM produces expected per-capita absolute voting margins for each group
$\lambda$,
$\mathbb{E}\left(\left|S_{n,\lambda}\right|/n_{\lambda}\right)$, of order
$1/\sqrt{n_{\lambda}}$ or 1, as follows from the limit theorems given in (27) and (28), with nothing in between. The CWM features three distinct regimes with
$\mathbb{E}\left(\left|S_{n,\lambda}\right|/n_{\lambda}\right)$ of order
$1/\sqrt{n_{\lambda}}$,
$1/n_{\lambda}^{1/4}$, and 1, respectively. (See [Reference Kirsch and Toth21, Section 3] for these results.)
De Finetti regimes of the CBM and the CWM.

We sum up the convergence behaviour of the CBM and the CWM in Table 1. As for
$J=0$ being the only case in which the CWM is in the fast-convergence regime, we note that since J is assumed to be either a positive definite or a homogeneous matrix, this is indeed the only J for which the CWM is in fast convergence. If we allowed slightly more general J, such as block diagonal matrices with one or more blocks equal to 0, then the groups
$\lambda$ for which
$J_{\lambda\nu}=0$ for all
$\nu=1,\ldots,M$ are in fast convergence, whereas other groups might fall into other regimes.
We next take a look at the asymptotic behaviour of the correlations between two votes
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$. By Proposition 1, de Finetti voting models with an asymptotic loss of social cohesion, represented by the weak convergence of the de Finetti measures
$\left(\mu_{n}\right)_{n}$ to
$\delta_{0}$, feature decaying correlations, i.e.
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)\xrightarrow[n\rightarrow\infty]{}0$. Given the de Finetti measure
$\mu$ of the CBM defined in (26), we have the equality
So correlations do not depend on the size of the population, and, except for some special cases such as
$\mu=\delta_{0}$, correlations are non-zero in a CBM.
In the CWM, the asymptotic behaviour of the correlations
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$ depends on the regime the model is in. We have (cf. [Reference Kirsch and Toth21, Section 5.2])
\begin{align*}\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right) & =\begin{cases}\Theta\left(\frac{1}{n}\right) & \mathrm{in the high-temperature regime,}\\\Theta\left(\frac{1}{\sqrt{n}}\right) & \mathrm{in the critical regime,}\\\Theta\left(1\right) & \mathrm{in the low-temperature regime.}\end{cases}\end{align*}
So we see that in a CWM the loss of social cohesion in the high-temperature and the critical regime is reflected in the decay of correlations between pairs of votes. In the low-temperature regime, where social cohesion does not decay, neither do we have a decay of
$\mathbb{E}\left(X_{\lambda1}X_{\nu2}\right)$.
Finally, we provide a concrete example of a de Finetti voting model in line with the cited empirical evidence.
Example 1. Let
$0.1\leq\alpha_{1},\ldots,\alpha_{M}\leq0.2$. Let
$\mu$ be a probability measure on the space
$\left\{ -1,1\right\} ^{M}$ that is symmetric with respect to the origin. We set
and let
$\left(\mathbb{P}_{n}\right)_{n}$ be the de Finetti voting model with de Finetti sequence
$\left(\mu_{n}\right)_{n}$. This model falls into the contraction pattern defined in Theorem 6. Since
$0.1\leq\alpha_{1},\ldots,\alpha_{M}\leq0.2$, its convergence speed is subcritical according to Definition 5. By Theorem 6, we have the limit theorem
\begin{align*}\left(\frac{S_{n,1}}{n_{1}^{1-\alpha_{1}}},\ldots,\frac{S_{n,M}}{n_{M}^{1-\alpha_{M}}}\right)\xrightarrow[n\rightarrow\infty]{\mathrm{d}}\mu.\end{align*}
Corollary 2 states that the expected per-capita voting margins exhibit the following behaviour:
\begin{align*}\mathbb{E}\left(\frac{\left|S_{n,\lambda}\right|}{n_{\lambda}}\right)=\Theta\left(n_{\lambda}^{-\alpha_{\lambda}}\right),\quad\lambda=1,\ldots,M.\end{align*}
Thus, choosing the parameters
$\alpha_{\lambda}$,
$\lambda=1,\ldots,M$, allows us to obtain a good fit of the model to the data in [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12]. Note that any possible correlation structure between the groups can be realised by choosing the probability measure
$\mu$ appropriately. Hence, this choice can make the model fit the empirical correlations between the voting margins
$S_{\lambda}$ and
$S_{\nu}$ of different groups
$\lambda$ and
$\nu$. Because of both the discrete support and the symmetry of
$\mu$ with respect to the origin, this is a fairly simple statistical model of binary voting. If desired, one can introduce further symmetries in
$\mu$ to reduce the number of parameters. See [Reference Kirsch and Toth19] for a paper about optimal voting weights in a two-tier voting system under a CWM with a reduced set of parameters.
5. Conclusion
We have discussed existing multi-group voting models such as the CBM and the CWM. None of these models exhibits voting behaviour in line with the empirical evidence presented in [Reference Gelman, Katz and Bafumi11, Reference Gelman, Katz and Tuerlinckx12]. Therefore, we have introduced a general framework of probabilistic voting models defined by a de Finetti representation. When the de Finetti measures converge weakly to the Dirac measure at the origin, these models satisfy limit theorems for the vector of group voting margins. The convergence speed of the de Finetti measures falls into one of three regimes:
• If the convergence speed is fast (supercritical), which means faster than
$1/\sqrt{n}$, where n is the population, then we obtain for the normalised group voting margins a universal limiting distribution which is multivariate normal with independent standard normal entries.-
• If the convergence speed is critical, which means of order
$1/\sqrt{n}$, and the de Finetti measures are a contraction of some underlying probability measure
$\mu$, then we obtain as the limiting distribution of the normalised group voting margins a rescaled version of
$\mu$ plus an additive multivariate normal noise with independent entries. -
• Slow (subcritical) convergence speeds require normalisation of the group voting margins by sequences which go to infinity faster than
$\sqrt{n}$, the normalisation factor in the other two regimes. The limiting distribution of the normalised group voting margins is the underlying probability measure
$\mu$.
The subcritical regime can be used to model real-world voting behaviour by assuming a convergence speed of order
$n^{-\alpha}$, with
$0.1\leq\alpha\leq0.2$, as in Example 1. By adjusting
$\alpha$ to the data, we can specify voting models in terms of some underlying probability distribution
$\mu$. This distribution can then be estimated to obtain a statistical model of the voting data.
Acknowledgements
The author of this article wishes to thank two anonymous referees, who through their extensive comments contributed to improving the article considerably.
Funding information
There are no funding bodies to thank in relation to the creation of this article.
Competing interests
There were no competing interests to declare which arose during the preparation or publication process of this article.
