18,203 research outputs found
Computing the Ball Size of Frequency Permutations under Chebyshev Distance
Let be the set of all permutations over the multiset
where
. A frequency permutation array (FPA) of minimum distance is a
subset of in which every two elements have distance at least .
FPAs have many applications related to error correcting codes. In coding
theory, the Gilbert-Varshamov bound and the sphere-packing bound are derived
from the size of balls of certain radii. We propose two efficient algorithms
that compute the ball size of frequency permutations under Chebyshev distance.
Both methods extend previous known results. The first one runs in time and space. The second one runs in time and
space. For small constants and ,
both are efficient in time and use constant storage space.Comment: Submitted to ISIT 201
Dynamics of Moving Average Rules in a Continuous-time Financial Market Model
Within a continuous-time framework, this paper proposes a stochastic heterogeneous agent model (HAM) of financial markets with time delays to unify various moving average rules used indiscrete-time HAMs. The time delay represents a memory length of a moving average rule indiscrete-time HAMs.Intuitive conditions for the stability of the fundamental price of the deterministic model in terms of agents' behavior parameters and memory length are obtained. It is found that an increase in memory length not only can destabilize the market price, resulting in oscillatory market price characterized by a Hopf bifurcation, but also can stabilize another wise unstable market price, leading to stability switching as the memory length increases. Numerical simulations show that the stochastic model is able to characterize long deviations of the market price from its fundamental price and excess volatility and generate most of the stylized factso bserved in financial markets.asset price; financial market behavior; heterogeneous beliefs; stochastic delay differential equations; stability; bifurcations; stylized facts
The number of ramified covering of a Riemann surface by Riemann surface
Interpreting the number of ramified covering of a Riemann surface by Riemann
surfaces as the relative Gromov-Witten invariants and applying a gluing
formula, we derive a recursive formula for the number of ramified covering of a
Riemann surface by Riemann surface with elementary branch points and prescribed
ramification type over a special point.Comment: LaTex, 14 page
- …