3,201 research outputs found
From Random Matrices to Stochastic Operators
We propose that classical random matrix models are properly viewed as finite
difference schemes for stochastic differential operators. Three particular
stochastic operators commonly arise, each associated with a familiar class of
local eigenvalue behavior. The stochastic Airy operator displays soft edge
behavior, associated with the Airy kernel. The stochastic Bessel operator
displays hard edge behavior, associated with the Bessel kernel. The article
concludes with suggestions for a stochastic sine operator, which would display
bulk behavior, associated with the sine kernel.Comment: 41 pages, 5 figures. Submitted to Journal of Statistical Physics.
Changes in this revision: recomputed Monte Carlo simulations, added reference
[19], fit into margins, performed minor editin
Statistics of real eigenvalues in Ginibre's Ensemble of random real matrices
The integrable structure of Ginibre's orthogonal ensemble of random matrices is looked at through the prism of the probability pn,k to find exactly k real eigenvalues in the spectrum of an n×n real asymmetric Gaussian random matrix. The exact solution for the probability function pn,k is presented, and its remarkable connection to the theory of symmetric functions is revealed. An extension of the Dyson integration theorem is a key ingredient of the theory presented
Universality in Systems with Power-Law Memory and Fractional Dynamics
There are a few different ways to extend regular nonlinear dynamical systems
by introducing power-law memory or considering fractional
differential/difference equations instead of integer ones. This extension
allows the introduction of families of nonlinear dynamical systems converging
to regular systems in the case of an integer power-law memory or an integer
order of derivatives/differences. The examples considered in this review
include the logistic family of maps (converging in the case of the first order
difference to the regular logistic map), the universal family of maps, and the
standard family of maps (the latter two converging, in the case of the second
difference, to the regular universal and standard maps). Correspondingly, the
phenomenon of transition to chaos through a period doubling cascade of
bifurcations in regular nonlinear systems, known as "universality", can be
extended to fractional maps, which are maps with power-/asymptotically
power-law memory. The new features of universality, including cascades of
bifurcations on single trajectories, which appear in fractional (with memory)
nonlinear dynamical systems are the main subject of this review.Comment: 23 pages 7 Figures, to appear Oct 28 201
Chaotic and pseudochaotic attractors of perturbed fractional oscillator
We consider a nonlinear oscillator with fractional derivative of the order
alpha. Perturbed by a periodic force, the system exhibits chaotic motion called
fractional chaotic attractor (FCA). The FCA is compared to the ``regular''
chaotic attractor. The properties of the FCA are discussed and the
``pseudochaotic'' case is demonstrated.Comment: 20 pages, 7 figure
Efficiency limits for linear optical processing of single photons and single-rail qubits
We analyze the problem of increasing the efficiency of single-photon sources
or single-rail photonic qubits via linear optical processing and destructive
conditional measurements. In contrast to previous work we allow for the use of
coherent states and do not limit to photon-counting measurements. We conjecture
that it is not possible to increase the efficiency, prove this conjecture for
several important special cases, and provide extensive numerical results for
the general case.Comment: 10 pages, 4 figure
Convex Independence in Permutation Graphs
A set C of vertices of a graph is P_3-convex if every vertex outside C has at
most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest
P_3-convex set that contains A. A set M is convexly independent if for every
vertex x \in M, x \notin \sigma(M-x). We show that the maximal number of
vertices that a convexly independent set in a permutation graph can have, can
be computed in polynomial time
- …