相关论文: Asymptotics of the partition function of Ising mod…
We prove a large deviations principle for the total spin and the number of edges under the annealed Ising measure on generalized random graphs. We also give detailed results on how the annealing over the Ising model changes the degrees of…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
In this article for a finite typed random geometric graph we define the empirical locality distribution, which records the number of nodes of a given type linked to a given number of nodes of each type. We find large deviation principle…
This paper develops asymptotic theory of integrals of empirical quantile functions with respect to random weight functions, which is an extension of classical $L$-statistics. They appear when sample trimming or Winsorization is applied to…
We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
For a $d-$regular random model, we assign to vertices $q-$state spins. From this model, we define the \emph{empirical co-operate measure}, which enumerates the number of co-operation between a given couple of spins, and \emph{ empirical…
We study the dynamics of bond-disordered Ising spin systems on random graphs with finite connectivity, using generating functional analysis. Rather than disorder-averaged correlation and response functions (as for fully connected systems),…
We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain exact estimates for the mean and variance of the limiting probability distribution and the…
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…
We investigate size Ramsey numbers involving bipartite graphs. It is proved that, if each forbidden graph is fixed or grows with n (in a certain uniform manner), then the extremal function has a linear asymptotics. The corresponding slope…
For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
In this paper, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
In this article we prove a Generalized Asypmtotic Equipartition Property for Networked Data Structures modelled as coloured random graphs. The main techniques in this article remains large deviation principles for suitably defined empirical…
We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…
Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated , in particular when X 1 is not…