scholarly journals The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Shiying Huang ◽  
Bin Wang
Keyword(s):  
High Probability ◽  
Intersection Graph ◽  
Random Intersection Graph

In this paper, we study the largest component of the near-critical random intersection graph G n , m , p with n nodes and m elements, where m = Θ n which leads to the fact that the clustering is tunable. We prove that with high probability the size of the largest component in the weakly supercritical random intersection graph with tunable clustering on n vertices is of order n ϵ n , and it is of order ϵ − 2 n log n ϵ 3 n in the weakly subcritical one, where ϵ n ⟶ 0 and n 1 / 3 ϵ n ⟶ ∞ as n ⟶ ∞ .

scholarly journals On the Isolated Vertices and Connectivity in Random Intersection Graphs

2011 ◽  
Vol 2011 ◽  
pp. 1-9 ◽  
Author(s):  
Yilun Shang
Keyword(s):  
Random Graphs ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Random Intersection Graph ◽  
Probability Of Connectivity ◽  
Asymptotic Probability

We study isolated vertices and connectivity in the random intersection graph . A Poisson convergence for the number of isolated vertices is determined at the threshold for absence of isolated vertices, which is equivalent to the threshold for connectivity. When and , we give the asymptotic probability of connectivity at the threshold for connectivity. Analogous results are well known in Erdős-Rényi random graphs.

scholarly journals Degree Distribution of an Inhomogeneous Random Intersection Graph

10.37236/2786 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Mindaugas Bloznelis ◽  
Julius Damarackas
Keyword(s):  
Degree Distribution ◽  
Intersection Graph ◽  
Random Intersection Graph

We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.

scholarly journals Component Evolution in Random Intersection Graphs

10.37236/935 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Michael Behrisch
Keyword(s):  
Real World ◽  
Linear Order ◽  
Graph Model ◽  
Vertex Degree ◽  
Intersection Graph ◽  
Giant Component ◽  
Logarithmic Order ◽  
Intersection Graphs ◽  
Similarity Network ◽  
Random Intersection Graph

We study the evolution of the order of the largest component in the random intersection graph model which reflects some clustering properties of real–world networks. We show that for appropriate choice of the parameters random intersection graphs differ from $G_{n,p}$ in that neither the so-called giant component, appearing when the expected vertex degree gets larger than one, has linear order nor is the second largest of logarithmic order. We also describe a test of our result on a protein similarity network.

scholarly journals Epidemics on Random Graphs with Tunable Clustering

2008 ◽  
Vol 45 (03) ◽  
pp. 743-756 ◽  
Author(s):  
Tom Britton ◽  
Maria Deijfen ◽  
Andreas N. Lagerås ◽  
Mathias Lindholm
Keyword(s):  
Random Graphs ◽  
Branching Process ◽  
Intersection Graph ◽  
Epidemic Threshold ◽  
Random Intersection Graph ◽  
Large Outbreak ◽  
Process Approximation

In this paper a branching process approximation for the spread of a Reed-Frost epidemic on a network with tunable clustering is derived. The approximation gives rise to expressions for the epidemic threshold and the probability of a large outbreak in the epidemic. We investigate how these quantities vary with the clustering in the graph and find that, as the clustering increases, the epidemic threshold decreases. The network is modeled by a random intersection graph, in which individuals are independently members of a number of groups and two individuals are linked to each other if and only if there is at least one group that they are both members of.

scholarly journals Connectivity of the uniform random intersection graph

2009 ◽  
Vol 309 (16) ◽  
pp. 5130-5140 ◽  
Author(s):  
Simon R. Blackburn ◽  
Stefanie Gerke
Keyword(s):  
Intersection Graph ◽  
Random Intersection Graph
Sign in / Sign up

Export Citation Format

Share Document