oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Recurrence rates for observations of flows  [PDF]
Jér?me Rousseau
Mathematics , 2011,
Abstract: We study Poincar\'e recurrence for flows and observations of flows. For Anosov flow, we prove that the recurrence rates are linked to the local dimension of the invariant measure. More generally, we give for the recurrence rates for the observation an upper bound depending on the push-forward measure. When the flow is metrically isomorphic to a suspension flow for which the dynamic on the base is rapidly mixing, we prove the existence of a lower bound for the recurrence rates for the observation. We apply these results to the geodesic flow and we compute the recurrence rates for a particular observation of the geodesic flow, i.e. the projection on the manifold.
Recurrence and transience for the frog model on trees  [PDF]
Christopher Hoffman,Tobias Johnson,Matthew Junge
Mathematics , 2014,
Abstract: The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase transition, finding it recurrent for $d=2$ and transient for $d\geq 5$. Simulations suggest strong recurrence for $d=2$, weak recurrence for $d=3$, and transience for $d\geq 4$. Additionally, we prove a 0-1 law for all $d$-ary trees, and we exhibit a graph on which a 0-1 law does not hold.
The dichotomy of recurrence and transience of semi-Levy processes  [PDF]
Makoto Maejima,Taisuke Takamune,Yohei Ueda
Mathematics , 2012,
Abstract: Semi-Levy process is an additive process with periodically stationary increments. In particular, it is a generalization of Levy process. The dichotomy of recurrence and transience of Levy processes is well known, but this is not necessarily true for general additive processes. In this paper, we prove the recurrence and transience dichotomy of semi-Levy processes. For the proof, we introduce a concept of semi-random walk and discuss its recurrence and transience properties. An example of semi-Levy process constructed from two independent Levy processes is investigated. Finally, we prove the laws of large numbers for semi-Levy processes.
Walking within growing domains: recurrence versus transience  [PDF]
Amir Dembo,Ruojun Huang,Vladas Sidoravicius
Mathematics , 2013,
Abstract: For normally reflected Brownian motion and for simple random walk on independently growing in time d-dimensional domains, d>=3, we establish a sharp criterion for recurrence versus transience in terms of the growth rate.
Monotone interaction of walk and graph: recurrence versus transience  [PDF]
Amir Dembo,Ruojun Huang,Vladas Sidoravicius
Mathematics , 2014,
Abstract: We consider recurrence versus transience for models of random walks on domains of $\mathbb{Z}^d$, in which monotone interaction enforces domain growth as a result of visits by the walk (or probes it sent), to the neighborhood of domain boundary.
An Overshoot Approach to Recurrence and Transience of Markov Processes  [PDF]
Bj?rn B?ttcher
Mathematics , 2010,
Abstract: We develop criteria for recurrence and transience of one-dimensional Markov processes which have jumps and oscillate between $+\infty$ and $-\infty$. The conditions are based on a Markov chain which only consists of jumps (overshoots) of the process into complementary parts of the state space. In particular we show that a stable-like process with generator $-(-\Delta)^{\alpha(x)/2}$ such that $\alpha(x)=\alpha$ for $x<-R$ and $\alpha(x)=\beta$ for $x>R$ for some $R>0$ and $\alpha,\beta\in(0,2)$ is transient if and only if $\alpha+\beta<2$, otherwise it is recurrent. As a special case this yields a new proof for the recurrence, point recurrence and transience of symmetric $\alpha$-stable processes.
Degrees of transience and recurrence and hierarchical random walks  [PDF]
D. A. Dawson,L. G. Gorostiza,A. Wakolbinger
Mathematics , 2004,
Abstract: The notion of degree and related notions concerning recurrence and transience for a class of L'evy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the ultrametric structure of the group and on analogies and differences with Euclidean random walks. Applications to separation of time scales and occupation times of multilevel branching systems are discussed.
From transience to recurrence with Poisson tree frogs  [PDF]
Christopher Hoffman,Tobias Johnson,Matthew Junge
Mathematics , 2015,
Abstract: Consider the following interacting particle system on the d-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake perform simple random walks, awakening any sleeping particles they encounter. We prove that there is a phase transition between transience and recurrence as the initial density of particles increases, and we give the order of the transition up to a logarithmic factor.
Recurrence and transience property for a class of Markov chains  [PDF]
Nikola Sandri?
Statistics , 2012, DOI: 10.3150/12-BEJ448
Abstract: We consider the recurrence and transience problem for a time-homogeneous Markov chain on the real line with transition kernel $p(x,\mathrm{d}y)=f_x(y-x)\,\mathrm{d}y$, where the density functions $f_x(y)$, for large $|y|$, have a power-law decay with exponent $\alpha(x)+1$, where $\alpha(x)\in(0,2)$. In this paper, under a uniformity condition on the density functions $f_x(y)$ and an additional mild drift condition, we prove that when $\lim\inf_{|x|\longrightarrow\infty}\alpha(x)>1$, the chain is recurrent. Similarly, under the same uniformity condition on the density functions $f_x(y)$ and some mild technical conditions, we prove that when $\lim\sup_{|x|\longrightarrow\infty}\alpha(x)<1$, the chain is transient. As a special case of these results, we give a new proof for the recurrence and transience property of a symmetric $\alpha$-stable random walk on $\mathbb {R}$ with the index of stability $\alpha\in(0,1)\cup(1,2).$
Dynamical sensitivity of recurrence and transience of branching random walks  [PDF]
Sebastian Müller
Mathematics , 2009,
Abstract: Consider a sequence of i.i.d. random variables $X_n$ where each random variable is refreshed independently according to a Poisson clock. At any fixed time $t$ the law of the sequence is the same as for the sequence at time 0 but at random times almost sure properties of the sequence may be violated. If there are such \emph{exceptional times} we say that the property is \emph{dynamically sensitive}, otherwise we call it \emph{dynamically stable}. In this note we consider branching random walks on Cayley graphs and prove that recurrence and transience are dynamically stable in the sub-and supercritical regime. While the critical case is left open in general we prove dynamical stability for a specific class of Cayley graphs. Our proof combines techniques from the theory of ranching random walks with those of dynamical percolation.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.