相关论文: Maximum number of symmetric extensions in the rand…

Let $\Delta_{k;n}$ be the maximum number of common neighbors of a set of $k$ vertices in $G(n,p)$. In this paper, we find $a_n$ and $\sigma_n$ such that $\frac{\Delta_{k;n}-a_n}{\sigma_n}$ converges in distribution to a random variable…

We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph.The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic…

Extreme value theory is part and parcel of any study of order statistics in one dimension. Our aim here is to consider such large sample theory for the maximum distance to the origin, and the related maximum "interpoint distance," in…

For a skew normal random sequence, convergence rates of the distribution of its partial maximum to the Gumbel extreme value distribution are derived. The asymptotic expansion of the distribution of the normalized maximum is given under an…

In this note, we establish the convergence in distribution of the maxima of i.i.d. random variables to the Gumbel distribution with the associated normalizing sequences for several examples that are related to the normal distribution.…

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbours. We show that in this case the graphical expansion can be arranged in such a way…

We show that generalised extreme value statistics -the statistics of the k-th largest value among a large set of random variables- can be mapped onto a problem of random sums. This allows us to identify classes of non-identical and…

We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…

We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We…

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…

A complete subgraph of any simple graph $G$ on $k$ vertices is called a $k$-\emph{clique} of $G$. In this paper, we first introduce the concept of the value of a $k$-clique ($k>1$) as an extension of the idea of the degree of a given…

Maximal clique enumeration appears in various real-world networks, such as social networks and protein-protein interaction networks for different applications. For general graph inputs, the number of maximal cliques can be up to…

Let $G=G(n,m)$ be a random graph whose average degree $d=2m/n$ is below the $k$-colorability threshold. If we sample a $k$-coloring $\sigma$ of $G$ uniformly at random, what can we say about the correlations between the colors assigned to…

In algebraic statistics, the maximum likelihood degree of a statistical model refers to the number of solutions (counted with multiplicity) of the score equations over the complex field. In this paper, the maximum likelihood degree of the…

Extremal problems concerning the number of complete subgraphs have a long story in extremal graph theory. Let $k_s(G)$ be the number of $s$-cliques in a graph $G$ and $m={{r_m}\choose s}+t_m$, where $0\le t_m\leq r_m$. Edr\H{o}s showed that…

The skew-normal and related families are flexible and asymmetric parametric models suitable for modelling a diverse range of systems. We show that the multivariate maximum of a high-dimensional extended skew-normal random sample has…