1,076 research outputs found
Micromagnetic understanding of stochastic resonance driven by spin-transfertorque
In this paper, we employ micromagnetic simulations to study non-adiabatic
stochastic resonance (NASR) excited by spin-transfer torque in a
super-paramagnetic free layer nanomagnet of a nanoscale spin valve. We find
that NASR dynamics involves thermally activated transitions among two static
states and a single dynamic state of the nanomagnet and can be well understood
in the framework of Markov chain rate theory. Our simulations show that a
direct voltage generated by the spin valve at the NASR frequency is at least
one order of magnitude greater than the dc voltage generated off the NASR
frequency. Our computations also reproduce the main experimentally observed
features of NASR such as the resonance frequency, the temperature dependence
and the current bias dependence of the resonance amplitude. We propose a simple
design of a microwave signal detector based on NASR driven by spin transfer
torque.Comment: 25 pages 8 figures, accepted for pubblication on Phys. Rev.
PCN13 COST-EFFECTIVENESS OF HEPATIC ARTERY INFUSION FOR METASTATIC COLORECTAL CANCER (CALGB 9481)
Long-Range Navigation on Complex Networks using L\'evy Random Walks
We introduce a strategy of navigation in undirected networks, including
regular, random, and complex networks, that is inspired by L\'evy random walks,
generalizing previous navigation rules. We obtained exact expressions for the
stationary probability distribution, the occupation probability, the mean first
passage time, and the average time to reach a node on the network. We found
that the long-range navigation using the L\'evy random walk strategy, compared
with the normal random walk strategy, is more efficient at reducing the time to
cover the network. The dynamical effect of using the L\'evy walk strategy is to
transform a large-world network into a small world. Our exact results provide a
general framework that connects two important fields: L\'evy navigation
strategies and dynamics on complex networks.Comment: 6 pages, 3 figure
Probabilistic Timed Automata with Clock-Dependent Probabilities
Probabilistic timed automata are classical timed automata extended with
discrete probability distributions over edges. We introduce clock-dependent
probabilistic timed automata, a variant of probabilistic timed automata in
which transition probabilities can depend linearly on clock values.
Clock-dependent probabilistic timed automata allow the modelling of a
continuous relationship between time passage and the likelihood of system
events. We show that the problem of deciding whether the maximum probability of
reaching a certain location is above a threshold is undecidable for
clock-dependent probabilistic timed automata. On the other hand, we show that
the maximum and minimum probability of reaching a certain location in
clock-dependent probabilistic timed automata can be approximated using a
region-graph-based approach.Comment: Full version of a paper published at RP 201
Random walks on the Apollonian network with a single trap
Explicit determination of the mean first-passage time (MFPT) for trapping
problem on complex media is a theoretical challenge. In this paper, we study
random walks on the Apollonian network with a trap fixed at a given hub node
(i.e. node with the highest degree), which are simultaneously scale-free and
small-world. We obtain the precise analytic expression for the MFPT that is
confirmed by direct numerical calculations. In the large system size limit, the
MFPT approximately grows as a power-law function of the number of nodes, with
the exponent much less than 1, which is significantly different from the
scaling for some regular networks or fractals, such as regular lattices,
Sierpinski fractals, T-graph, and complete graphs. The Apollonian network is
the most efficient configuration for transport by diffusion among all
previously studied structure.Comment: Definitive version accepted for publication in EPL (Europhysics
Letters
Complexity of Manipulative Actions When Voting with Ties
Most of the computational study of election problems has assumed that each
voter's preferences are, or should be extended to, a total order. However in
practice voters may have preferences with ties. We study the complexity of
manipulative actions on elections where voters can have ties, extending the
definitions of the election systems (when necessary) to handle voters with
ties. We show that for natural election systems allowing ties can both increase
and decrease the complexity of manipulation and bribery, and we state a general
result on the effect of voters with ties on the complexity of control.Comment: A version of this paper will appear in ADT-201
Stochastic B\"acklund transformations
How does one introduce randomness into a classical dynamical system in order
to produce something which is related to the `corresponding' quantum system? We
consider this question from a probabilistic point of view, in the context of
some integrable Hamiltonian systems
Projected single-spin flip dynamics in the Ising Model
We study transition matrices for projected dynamics in the
energy-magnetization space, magnetization space and energy space. Several
single spin flip dynamics are considered such as the Glauber and Metropolis
canonical ensemble dynamics and the Metropolis dynamics for three
multicanonical ensembles: the flat energy-magnetization histogram, the flat
energy histogram and the flat magnetization histogram. From the numerical
diagonalization of the matrices for the projected dynamics we obtain the
sub-dominant eigenvalue and the largest relaxation times for systems of varying
size. Although, the projected dynamics is an approximation to the full state
space dynamics comparison with some available results, obtained by other
authors, shows that projection in the magnetization space is a reasonably
accurate method to study the scaling of relaxation times with system size. The
transition matrices for arbitrary single-spin flip dynamics are obtained from a
single Monte-Carlo estimate of the infinite temperature transition-matrix, for
each system size, which makes the method an efficient tool to evaluate the
relative performance of any arbitrary local spin-flip dynamics. We also present
new results for appropriately defined average tunnelling times of magnetization
and compute their finite-size scaling exponents that we compare with results of
energy tunnelling exponents available for the flat energy histogram
multicanonical ensemble.Comment: 23 pages and 6 figure
Rate-Based Transition Systems for Stochastic Process Calculi
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition relation used in our variant associates to each process, for each action, the set of possible futures paired with a measure indicating their rates. We show how RTS can be used for providing the operational semantics of stochastic extensions of classical formalisms, namely CSP and CCS. We also show that our semantics for stochastic CCS guarantees associativity of parallel composition. Similarly, in contrast with the original definition by Priami, we argue that a semantics for stochastic π-calculus can be provided that guarantees associativity of parallel composition
- …