SearcharxivSearch

arXiv · 1309.7986

Asymptotic statistics of cycles in surrogate-spatial permutations

Abstract

We propose an extension of the Ewens measure on permutations by choosing the cycle weights to be asymptotically proportional to the degree of the symmetric group. This model is primarily motivated by a natural approximation to the so-called spatial random permutations recently studied by V. Betz and D. Ueltschi (hence the name "surrogate-spatial"), but it is of substantial interest in its own right. We show that under the suitable (thermodynamic) limit both measures have the similar critical behaviour of the cycle statistics characterized by the emergence of infinitely long cycles. Moreover, using a greater analytic tractability of the surrogate-spatial model, we obtain a number of new results about the asymptotic distribution of the cycle lengths (both small and large) in the full range of subcritical, critical and supercritical domains. In particular, in the supercritical regime there is a parametric "phase transition" from the Poisson-Dirichlet limiting distribution of ordered cycles to the occurrence of a single giant cycle. Our techniques are based on the asymptotic analysis of the corresponding generating functions using Polya's Enumeration Theorem and complex variable methods.

Explore related subjects

Keep this discovery

BibTeXRIS

Leonid V. Bogachev, Dirk Zeindler. 2014-07-18. Asymptotic statistics of cycles in surrogate-spatial permutations. https://doi.org/10.1007/s00220-014-2110-1

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