2,344 research outputs found
The sleekest link algorithm
How does Google decide which web sites are important? It uses an ingenious algorithm that exploits the structure of the web and is resistant to hacking. Here, we describe this PageRank algorithm, illustrate it by example, and show how it can be interpreted as a Jacobi iteration and a teleporting random walk. We also ask the algorithm to rank the undergraduate mathematics classes offered at the University of Strathclyde. PageRank draws upon ideas from linear algebra, graph theory and stochastic processes, and it throws up research-level challenges in scientific computing. It thus forms an exciting and modern application area that could brighten up many a mathematics class syllabus
Synchronization of globally coupled two-state stochastic oscillators with a state dependent refractory period
We present a model of identical coupled two-state stochastic units each of
which in isolation is governed by a fixed refractory period. The nonlinear
coupling between units directly affects the refractory period, which now
depends on the global state of the system and can therefore itself become time
dependent. At weak coupling the array settles into a quiescent stationary
state. Increasing coupling strength leads to a saddle node bifurcation, beyond
which the quiescent state coexists with a stable limit cycle of nonlinear
coherent oscillations. We explicitly determine the critical coupling constant
for this transition
Model Reduction of Linear Switched Systems by Restricting Discrete Dynamics
We present a procedure for reducing the number of continuous states of
discrete-time linear switched systems, such that the reduced system has the
same behavior as the original system for a subset of switching sequences. The
proposed method is expected to be useful for abstraction based control
synthesis methods for hybrid systems
- …