Displaying similar documents to “Random sampling and social networks. A survey of various approaches”

Random threshold graphs.

Reilly, Elizabeth Perez, Scheinerman, Edward R. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Encores on cores.

Cain, Julie, Wormald, Nicholas (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bounded expansion in web graphs

Silvia Gago, Dirk Schlatter (2009)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.

Ramsey Properties of Random Graphs and Folkman Numbers

Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht (2017)

Discussiones Mathematicae Graph Theory

Similarity:

For two graphs, G and F, and an integer r ≥ 2 we write G → (F)r if every r-coloring of the edges of G results in a monochromatic copy of F. In 1995, the first two authors established a threshold edge probability for the Ramsey property G(n, p) → (F)r, where G(n, p) is a random graph obtained by including each edge of the complete graph on n vertices, independently, with probability p. The original proof was based on the regularity lemma of Szemerédi and this led to tower-type dependencies...

The sizes of components in random circle graphs

Ramin Imany-Nabiyyi (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...

Composition and structure of social networks

Ove Frank (1997)

Mathématiques et Sciences Humaines

Similarity:

Social networks representing one or more relationships between individuals and one or more categorical characteristics of the individuals exhibit both structure and composition. Probabilistic models of such networks can be used for analyzing the interrelations between structural and compositional variables, for instance in order to find how structure can be explained by composition or how structure explains composition. Different models are discussed and different statistical methods...