Sciweavers

1542 search results - page 4 / 309
» The metamathematics of random graphs
Sort
View
RSA
2011
77views more  RSA 2011»
13 years 3 months ago
Regular induced subgraphs of a random Graph
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
Michael Krivelevich, Benny Sudakov, Nicholas C. Wo...
RSA
2008
78views more  RSA 2008»
13 years 8 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
CPC
2011
189views Education» more  CPC 2011»
13 years 3 months ago
A Counter-Intuitive Correlation in a Random Tournament
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Sven Erick Alm, Svante Linusson
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 11 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun