Search arXivSearch

arXiv · 2109.12716

Disordered Monomer-Dimer model on Cylinder graphs

Abstract

We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the vertices also carry i.i.d. random weights, not necessarily from the same distribution. Given the random weights, we define a Gibbs measure on the space of monomer-dimer configurations on $\mathcal{G}_n$. We show that the associated free energy converges to a limit, and with suitable scaling and centering, satisfies a central limit theorem. We also show that the number of monomers in a typical configuration satisfies a law of large numbers and a central limit theorem with appropriate centering and scaling. Finally, for an appropriate height function associated with a matching, we show convergence to a limiting function and prove the Brownian motion limit about the limiting height function in the sense of finite-dimensional distributions.

Explore related subjects

Keep this discovery

BibTeXRIS

Partha S. Dey, Kesav Krishnan. 2021-09-26. Disordered Monomer-Dimer model on Cylinder graphs. https://doi.org/10.1007/s10955-023-03159-7

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