相关论文: Component behaviour and excess of random bipartite…

We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$ every vertex has one of two types, the…

We study the joint components in a random `double graph' that is obtained by superposing red and blue binomial random graphs on $n$~vertices. A joint component is a maximal set of vertices, which contains both a red and a blue spanning…

In the binomial random graph $\mathcal{G}(n,p)$, when $p$ changes from $(1-\varepsilon)/n$ (subcritical case) to $1/n$ and then to $(1+\varepsilon)/n$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest…

Archdeacon and Grable (1995) proved that the genus of the random graph $G\in\mathcal{G}_{n,p}$ is almost surely close to $pn^2/12$ if $p=p(n)\geq3(\ln n)^2n^{-1/2}$. In this paper we prove an analogous result for random bipartite graphs in…

A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…

We study the problem of the existence of a giant component in a random multipartite graph. We consider a random multipartite graph with $p$ parts generated according to a given degree sequence $n_i^{\mathbf{d}}(n)$ which denotes the number…

The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…

We give a short proof that the largest component of the random graph $G(n, 1/n)$ is of size approximately $n^{2/3}$. The proof gives explicit bounds for the probability that the ratio is very large or very small.

Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…

The genus of the binomial random graph $G(n,p)$ is well understood for a wide range of $p=p(n)$. Recently, the study of the genus of the random bipartite graph $G(n_1,n_2,p)$, with partition classes of size $n_1$ and $n_2$, was initiated by…

We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=\mu n/2$…

Recently, van der Hofstad, Komj\'{a}thy, and Vadon (2022) identified the critical point for the emergence of a giant connected component for the bipartite configuration model (BCM) and used this to analyze its associated random intersection…

The largest components of the critical Erd\H{o}s-R\'enyi graph, $G(n,p)$ with $p=1/n$, have size of order $n^{2/3}$ with high probability. We give detailed asymptotics for the probability that there is an unusually large component, i.e. of…

We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…

We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In particular, we show that this point process has a surprising…

In a recent work of the authors and Kim, we derived a complete description of the largest component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ as it emerges from the critical window, i.e. for $p = (1+\epsilon)/n$ where $\epsilon^3 n…

Let $G=G(d)$ be a random graph with a given degree sequence $d$, such as a random $r$-regular graph where $r\ge 3$ is fixed and $n=|G|\to\infty$. We study the percolation phase transition on such graphs $G$, i.e., the emergence as $p$…

The 2-dimensional Hamming graph H(2,n) consists of the $n^2$ vertices $(i,j)$, $1\leq i,j\leq n$, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability…

We provide a complete description of the giant component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\epsilon)/n$ where $\epsilon^3 n \to \infty$ and $\epsilon=o(1)$. Our…