SearcharxivSearch

arXiv · 2107.08889

The GHS and other correlation inequalities for the two-star model

Abstract

We consider the two-star model, a family of exponential random graphs indexed by two real parameters, $h$ and $\alpha$, that rule respectively the total number of edges and the mutual dependence between them. Borrowing tools from statistical mechanics, we study different classes of correlation inequalities for edges, that naturally emerge while taking the partial derivatives of the (finite size) free energy. In particular, if $\alpha, h\ge 0$, we derive first and second order correlation inequalities and then prove the so-called GHS inequality. As a consequence, under the above conditions on the parameters, the average edge density turns out to be an increasing and concave function of the parameter $h$, at any fixed size of the graph. Some of our results can be extended to more general classes of exponential random graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandra Bianchi, Francesca Collet, Elena Magnanini. 2021-07-19. The GHS and other correlation inequalities for the two-star model. https://doi.org/10.30757/alea.v19-64

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