Related papers: Hamiltonian Cycles on a Random Three-coordinate La…
We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares. We examine several statistics of these point sets, such as the electrostatic potential,…
Coexistence of various ordered chaotic states in a Hamiltonian system is studied with the use of a symplectic coupled map lattice. Besides the clustered states for the attractive interaction, a novel chaotic ordered state is found for a…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…
We consider the lattice dynamics in the harmonic approximation for We consider the lattice dynamics in the harmonic approximation for a simple hypercubic lattice with arbitrary unit cell. The initial data are random according to a…
We consider Hamilton cycles in the random digraph $D_{n,m}$ where the orientation of edges follows a pattern other than the trivial orientation in which the edges are oriented in the same direction as we traverse the cycle. We show that if…
We study the path behavior of the symmetric walk on some special comb-type subsets of ${\mathbb Z}^2$ which are obtained from ${\mathbb Z}^2$ by generalizing the comb having finitely many horizontal lines instead of one.
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
The phase space for Hamiltonians of two degrees of freedom is usually divided into stochastic and integrable components. Even when well into the stochastic regime, integrable orbits may surround small stable regions or islands. The effect…
Structures such as waves, jets, and vortices have a dramatic impact on the transport properties of a flow. Passive tracer transport in incompressible two-dimensional flows is described by Hamiltonian dynamics, and, for idealized structures,…
We consider a system consisting of a planar random walk on a square lattice, submitted to stochastic elementary local deformations. Depending on the deformation transition rates, and specifically on a parameter $\eta$ which breaks the…
We consider an infinite system of particles in one dimension, each particle performs independant Sinai's random walk in random environment. Considering an instant $t$, large enough, we prove a result in probability showing that the…
We present a Hamiltonian approach for the wellknown Eigen model of the Darwin selection dynamics. Hamiltonization is carried out by means of the embedding of the population variable space, describing behavior of the system, into the space…
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\mathcal G}(n,p)$ in order to typically find a subgraph…
The Hamiltonian dynamics of chains of nonlinearly coupled particles is numerically investigated in two and three dimensions. Simple, off-lattice homopolymer models are used to represent the interparticle potentials. Time averages of…
Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…
The energy level spacing distribution of a tight-binding hamiltonian is monitored across the mobility edge for a fixed disorder strength. Any mixing of extended and localized levels is avoided in the configurational averages, thus…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…
Using a connection between the $q$-oscillator algebra and the coefficients of the high temperature expansion of the frustrated Gaussian spin model, we derive an exact formula for the number of closed random walks of given length and area,…
The Hamiltonian Monte Carlo (HMC) algorithm is a powerful Markov Chain Monte Carlo (MCMC) method that uses Hamiltonian dynamics to generate samples from a target distribution. To fully exploit its potential, we must understand how…