The search session has expired. Please query the service again.

Displaying similar documents to “Limit theorems for the weights and the degrees in anN-interactions random graph model”

Random threshold graphs.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Random procedures for dominating sets in bipartite graphs

Sarah Artmann, Jochen Harant (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Using multilinear functions and random procedures, new upper bounds on the domination number of a bipartite graph in terms of the cardinalities and the minimum degrees of the two colour classes are established.

Comparison of algorithms in graph partitioning

Alain Guénoche (2009)

RAIRO - Operations Research

Similarity:

We first describe four recent methods to cluster vertices of an undirected non weighted connected graph. They are all based on very different principles. The fifth is a combination of classical ideas in optimization applied to graph partitioning. We compare these methods according to their ability to recover classes initially introduced in random graphs with more edges within the classes than between them.

Encores on cores.

Cain, Julie, Wormald, Nicholas (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Asymptotic spectral analysis of generalized Erdős-Rényi random graphs

Song Liang, Nobuaki Obata, Shuji Takahashi (2007)

Banach Center Publications

Similarity:

Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.

A stationary random graph of no growth rate

Ádám Timár (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We present a random automorphism-invariant subgraph of a Cayley graph such that with probability 1 its exponential growth rate does not exist.