801 research outputs found
Memory Function versus Binary Correlator in Additive Markov Chains
We study properties of the additive binary Markov chain with short and
long-range correlations. A new approach is suggested that allows one to express
global statistical properties of a binary chain in terms of the so-called
memory function. The latter is directly connected with the pair correlator of a
chain via the integral equation that is analyzed in great detail. To elucidate
the relation between the memory function and pair correlator, some specific
cases were considered that may have important applications in different fields.Comment: 31 pages, 1 figur
The complexity of the list homomorphism problem for graphs
We completely classify the computational complexity of the list H-colouring
problem for graphs (with possible loops) in combinatorial and algebraic terms:
for every graph H the problem is either NP-complete, NL-complete, L-complete or
is first-order definable; descriptive complexity equivalents are given as well
via Datalog and its fragments. Our algebraic characterisations match important
conjectures in the study of constraint satisfaction problems.Comment: 12 pages, STACS 201
Experimental observation of the mobility edge in a waveguide with correlated disorder
The tight-binding model with correlated disorder introduced by Izrailev and
Krokhin [PRL 82, 4062 (1999)] has been extended to the Kronig-Penney model. The
results of the calculations have been compared with microwave transmission
spectra through a single-mode waveguide with inserted correlated scatterers.
All predicted bands and mobility edges have been found in the experiment, thus
demonstrating that any wanted combination of transparent and non-transparent
frequency intervals can be realized experimentally by introducing appropriate
correlations between scatterers.Comment: RevTex, 4 pages including 4 Postscript figure
- …