A guided tour in random intersection graphs

Authors:
Paul G. Spirakis;Sotiris Nikoletseas;Christoforos Raptopoulos
Affiliations:
Computer Technology Institute and Press "Diophantus' and University of Patras, Greece and Computer Science Department, University of Liverpool, United Kingdom;Computer Technology Institute and Press "Diophantus' and University of Patras, Greece;Computer Technology Institute and Press "Diophantus' and University of Patras, Greece
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 14
Cited 0

On the independence number of random graphs

Discrete Mathematics
Random intersection graphs when m= w(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n,P/italic) models

Random Structures & Algorithms
On Random Intersection Graphs: The Subgraph Problem

Combinatorics, Probability and Computing
The vertex degree distribution of random intersection graphs

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
The cover time of sparse random graphs

Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Large independent sets in general random intersection graphs

Theoretical Computer Science
Colouring Non-sparse Random Intersection Graphs

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Expander properties and the cover time of random intersection graphs

Theoretical Computer Science
Coloring Random Intersection Graphs and Complex Networks

SIAM Journal on Discrete Mathematics
Sharp thresholds for Hamiltonicity in random intersection graphs

Theoretical Computer Science
Equivalence of a random intersection graph and G(n,p)

Random Structures & Algorithms
On the independence number and Hamiltonicity of uniform random intersection graphs

Theoretical Computer Science
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Maximum cliques in graphs with small intersection number and random intersection graphs

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random graphs, introduced by P. Erdős and A. Rényi in 1959, still attract a huge amount of research in the communities of Theoretical Computer Science, Algorithms, Graph Theory, Discrete Mathematics and Statistical Physics. This continuing interest is due to the fact that, besides their mathematical beauty, such graphs are very important, since they can model interactions and faults in networks and also serve as typical inputs for an average case analysis of algorithms. The modeling effort concerning random graphs has to show a plethora of random graph models; some of them have quite elaborate definitions and are quite general, in the sense that they can simulate many other known distributions on graphs by carefully tuning their parameters.