English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Uniform random intersection graphs have received much interest and been usedin diverse applications. A uniform random intersection graph with $n$ nodes isconstructed as follows: each node selects a set of $K_n$ different itemsuniformly at random from the same pool of $P_n$ distinct items, and two nodesestablish an undirected edge in between if and only if they share at least oneitem. For such graph denoted by $G(n, K_n, P_n)$, we present the followingresults in this paper. First, we provide an exact analysis on the probabilitiesof $G(n, K_n, P_n)$ having a perfect matching and having a Hamilton cyclerespectively, under $P_n = \omega\big(n (\ln n)^5\big)$ (all asymptoticnotation are understood with $n \to \infty$). The analysis reveals that justlike ($k$-)connectivity shown in prior work, for both properties of perfectmatching containment and Hamilton cycle containment, $G(n, K_n, P_n)$ alsoexhibits phase transitions: for each property above, as $K_n$ increases, thelimit of the probability that $G(n, K_n, P_n)$ has the property increases from$0$ to $1$. Second, we compute the phase transition widths of $G(n, K_n, P_n)$for $k$-connectivity (KC), perfect matching containment (PMC), and Hamiltoncycle containment (HCC), respectively. For a graph property $R$ and a positiveconstant $a < \frac{1}{2}$, with the phase transition width $d_n(R, a)$ definedas the difference between the minimal $K_n$ ensuring $G(n, K_n, P_n)$ havingproperty $R$ with probability at least $1-a$ or $a$, we show for any positiveconstants $a<\frac{1}{2}$ and $k$: (i) If $P_n=\Omega(n)$ and $P_n=o(n\ln n)$,then $d_n(KC, a)$ is either $0$ or $1$ for each $n$ sufficiently large. (ii) If$P_n=\Theta(n\ln n)$, then $d_n(KC, a)=\Theta(1)$. (iii) If $P_n=\omega(n\lnn)$, then $d_n(KC, a)=\omega(1)$. (iv) If $P_n=\omega\big(n (\ln n)^5\big)$,$d_n(PMC, a)$ and $d_n(HCC, a)$ are both $\omega(1)$.

Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs