Result 1 to 20 of 1208 total
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. (English)
Random Struct. Algorithms 41, No. 4, 506-520 (2012).
1
A randomized version of Ramsey’s theorem. (English)
Random Struct. Algorithms 41, No. 4, 488-505 (2012).
2
Tight upper tail bounds for cliques. (English)
Random Struct. Algorithms 41, No. 4, 469-487 (2012).
3
Sharp threshold for the appearance of certain spanning trees in random graphs. (English)
Random Struct. Algorithms 41, No. 4, 391-412 (2012).
4
Novel scaling limits for critical inhomogeneous random graphs. (English)
Ann. Probab. 40, No. 6, 2299-2361 (2012).
5
Nonuniform random geometric graphs with location-dependent radii. (English)
Ann. Appl. Probab. 22, No. 5, 2048-2066 (2012).
6
Sparse regular random graphs: spectral density and eigenvectors. (English)
Ann. Probab. 40, No. 5, 2197-2235 (2012).
7
Replica theory for learning curves for Gaussian processes on random graphs. (English)
J. Phys. A, Math. Theor. 45, No. 42, Article ID 425005, 28 p. (2012).
8
On the limiting distribution of a graph scan statistic. (English)
Commun. Stat., Theory Methods 41, No. 7-9, 1151-1170 (2012).
9
Bond percolation on a class of correlated and clustered random graphs. (English)
J. Phys. A, Math. Theor. 45, No. 40, Article ID 405005, 15 p. (2012).
10
Longest path distance in random circuits. (English)
Comb. Probab. Comput. 21, No. 6, 856-881 (2012).
11
Cops and robbers on geometric graphs. (English)
Comb. Probab. Comput. 21, No. 6, 816-834 (2012).
12
Counting with combined splitting and capture‒recapture methods. (English)
Stoch. Models 28, No. 3, 478-502 (2012).
13
Extremal subgraphs of random graphs. (English)
Random Struct. Algorithms 41, No. 2, 147-178 (2012).
14
The Liouville and the intersection properties are equivalent for planar graphs. (English)
Electron. Commun. Probab. 17, Paper No. 42, 5 p., electronic only (2012).
15
Distance edge-colourings and matchings. (English)
Discrete Appl. Math. 160, No. 16-17, 2435-2439 (2012).
16
Cover time of a random graph with given degree sequence. (English)
Discrete Math. 312, No. 21, 3146-3163 (2012).
17
Achlioptas process phase transitions are continuous. (English)
Ann. Appl. Probab. 22, No. 4, 1450-1464 (2012).
18
Effect of scale on long-range random graphs and chromosomal inversions. (English)
Ann. Appl. Probab. 22, No. 4, 1328-1361 (2012).
19
Quasi-randomness of graph balanced cut properties. (English)
Random Struct. Algorithms 41, No. 1, 124-145 (2012).
20
Result 1 to 20 of 1208 total
Start
Contact
Print
General Help
