On Negative Correlation of Arboreal Gas on Some Graphs

Xiangyu Huang

Home/Archive/arXiv

arXiv · 2311.00965

On Negative Correlation of Arboreal Gas on Some Graphs

Xiangyu Huang

View original source ↗Read source document ↗Export metadata ↓

Abstract

Arboreal Gas is a type of (unrooted) random forest on a graph, where the probability is determined by a parameter $\beta>0$ per edge. This model is essentially equivalent to acyclic Bernoulli bond percolation with a parameter $p=\beta/(1+\beta)$. Additionally, Arboreal Gas can be considered as the limit of the $q$-states random cluster model with $p=\beta q$ as $q\to 0$. A natural question arises regarding the existence and performance of the weak limit of Arboreal Gas as the graph size goes to infinity. The answer to this question relies on the negative correlation of Arboreal Gas, which is still an open problem. This paper primarily focuses on the negative correlation of Arboreal Gas and provides some results for specific graphs.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Xiangyu Huang. 2023-11-02. On Negative Correlation of Arboreal Gas on Some Graphs. https://arxiv.org/abs/2311.00965

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗