𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectance and equipartition thresholds in hamiltonian systems

✍ Scribed by A. Giansanti; M. Pettini; A. Vulpiani

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
264 KB
Volume
109
Category
Article
ISSN
0375-9601

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian paths and hamiltonian connec
Hamiltonian paths and hamiltonian connectivity in graphs
✍ Bing Wei πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 388 KB

## Let G be a 2-connected graph with n vertices such that d(u)+d(u)+d(w)-IN(u)nN(u)nN(w)I an+ 1 holds for any triple of independent vertices u, v and w. Then for any distinct vertices u and u such that {u, 0) is not a cut vertex set of G, there is a hamiltonian path between u and o. In particular,

On the connection between Hamiltonian ma
On the connection between Hamiltonian many-particle systems and the hydrodynamical equations
✍ Karl OelschlΓ€ger πŸ“‚ Article πŸ“… 1991 πŸ› Springer 🌐 English βš– 564 KB

We consider certain Hamiltonian systems with many particles interacting through a potential whose range is large in comparison with the typical distance between neighbouring particles. It is shown that the empirical processes of the positions and the velocities respectively converge to solutions of