@unpublished{KellerRoellyValleriani2013,
  author    = {Keller, Peter and Roelly, Sylvie and Valleriani, Angelo},
  title     = {A quasi-random-walk to model a biological transport process},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-63582},
  year      = {2013},
  abstract  = {Transport Molecules play a crucial role for cell viability. Amongst others, linear motors transport cargos along rope-like structures from one location of the cell to another in a stochastic fashion. Thereby each step of the motor, either forwards or backwards, bridges a fixed distance. While moving along the rope the motor can also detach and is lost. We give here a mathematical formalization of such dynamics as a random process which is an extension of Random Walks, to which we add an absorbing state to model the detachment of the motor from the rope. We derive particular properties of such processes that have not been available before. Our results include description of the maximal distance reached from the starting point and the position from which detachment takes place. Finally, we apply our theoretical results to a concrete established model of the transport molecule Kinesin V.},
  language  = {en}
}
@unpublished{KellerRoellyValleriani2012,
  author    = {Keller, Peter and Roelly, Sylvie and Valleriani, Angelo},
  title     = {On time duality for quasi-birth-and-death processes},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-56973},
  year      = {2012},
  abstract  = {We say that (weak/strong) time duality holds for continuous time quasi-birth-and-death-processes if, starting from a fixed level, the first hitting time of the next upper level and the first hitting time of the next lower level have the same distribution. We present here a criterion for time duality in the case where transitions from one level to another have to pass through a given single state, the so-called bottleneck property. We also prove that a weaker form of reversibility called balanced under permutation is sufficient for the time duality to hold. We then discuss the general case.},
  language  = {en}
}
@unpublished{Keller2013,
  author    = {Keller, Peter},
  title     = {Mathematical modeling of molecular motors},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-63045},
  year      = {2013},
  abstract  = {Amongst the many complex processes taking place in living cells, transport of cargoes across the cytosceleton is fundamental to cell viability and activity. To move cargoes between the different cell parts, cells employ Molecular Motors. The motors operate by transporting cargoes along the so-called cellular micro-tubules, namely rope-like structures that connect, for instance, the cell-nucleus and outer membrane. We introduce a new Markov Chain, the killed Quasi-Random-Walk, for such transport molecules and derive properties like the maximal run length and time. Furthermore we introduce permuted balance, which is a more flexible extension of the ordinary reversibility and introduce the notion of Time Duality, which compares certain passage times pathwise. We give a number of sufficient conditions for Time Duality based on the geometry of the transition graph. Both notions are closely related to properties of the killed Quasi-Random-Walk.},
  language  = {en}
}
@unpublished{Conforti2015,
  author    = {Conforti, Giovanni},
  title     = {Reciprocal classes of continuous time Markov Chains},
  volume    = {4},
  number    = {8},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {2193-6943},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-78234},
  pages     = {198},
  year      = {2015},
  abstract  = {In this work we study reciprocal classes of Markov walks on graphs. Given a continuous time reference Markov chain on a graph, its reciprocal class is the set of all probability measures which can be represented as a mixture of the bridges of the reference walks. We characterize reciprocal classes with two different approaches. With the first approach we found it as the set of solutions to duality formulae on path space, where the differential operators have the interpretation of the addition of infinitesimal random loops to the paths of the canonical process. With the second approach we look at short time asymptotics of bridges. Both approaches allow an explicit computation of reciprocal characteristics, which are divided into two families, the loop characteristics and the arc characteristics. They are those specific functionals of the generator of the reference chain which determine its reciprocal class. We look at the specific examples such as Cayley graphs, the hypercube and planar graphs. Finally we establish the first concentration of measure results for the bridges of a continuous time Markov chain based on the reciprocal characteristics.},
  language  = {en}
}