Loop covering probabilities

Given a sequence of undirected connected graphs $G_n$ of $n$ vertices with bounded degrees and weights and an additional sequence of killing parameters $c_n$, one can define a sequence $\mu_n$ of natural non-normalized measures on non-trivial loops of $G_n$. Denote by $Q_n$ the transition matrix associated with $G_n$. Assuming that the empirical distributions $\nu_n$ of the eigenvalues of $Q_n$ converge, we determine the limit of the $\mu_n-$proportion of \{loops which cover every vertex\} as $n\rightarrow\infty$. Let $\mathcal{L}_n$ be the Poissonian "loop soup" with intensity $\frac{\mu_n}{n}$. A a corollary, we determine the limit law of the number of the loops covering the whole graph. As two concrete examples, we consider the closed balls in a regular graph and the discrete tori.