𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Artificial upwelling in regular and random waves

✍ Scribed by Clark C.K. Liu; Qiao Jin

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
936 KB
Volume
22
Category
Article
ISSN
0029-8018

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Geodesics and almost geodesic cycles in
Geodesics and almost geodesic cycles in random regular graphs
✍ Itai Benjamini; Carlos Hoppen; Eran Ofek; PaweΕ‚ PraΕ‚at; Nick Wormald πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d G (u, v) is at least d C (u, v)-e(n). Let (n) be any function tending to infin

Generating and Counting Hamilton Cycles
Generating and Counting Hamilton Cycles in Random Regular Graphs
✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ε½ . with vertex set n . We describe polynomial time algorithms that whp i find a Ε½ . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.

2-factors in random regular graphs
2-factors in random regular graphs
✍ Robalewska, Hanna D. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 474 KB πŸ‘ 3 views

In this paper the expectation and variance of the number of 2-factors in random r-regular graphs for any fixed r 2 3 is analyzed and the asymptotic distribution of this variable is determined.