SearcharxivSearch

arXiv · 2503.01663

Simultaneous elections in a polarized society make single-party sweeps more likely

Abstract

In a country with many elections, it may prove economically expedient to hold multiple elections simultaneously on a common polling date. We show that in a polarized society, in which each voter has a preferred party, an increase in the simultaneity of polling will increase the likelihood of a single-party sweep, namely, it will become more likely that a single party wins all the elections. In fact we show that the sweep probability goes up for \emph{every} party. Thus the phenomenon we describe is independent of the ``coattail'' or ``down-ballot'' effect of a popular leader. It is a \emph{systemic} and \emph{persistent} macroscopic political change, effected by a combination of political polarization and simultaneity of polling. Our result holds under fairly general conditions and is applicable to many common real-world electoral systems, including \emph{first-past-the-post} (most voters) and \emph{party list proportional representation} (most countries). In the course of our proof, we obtain a generalization of the well-known Harris correlation inequality.

Explore related subjects

Keep this discovery

BibTeXRIS

Pradeep Dubey, Siddhartha Sahi. 2025-03-03. Simultaneous elections in a polarized society make single-party sweeps more likely. https://arxiv.org/abs/2503.01663

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR