M2 Report in Mathematics proposed by ´ & K. Raschel M. Peigne

Random walks in cones of the Euclidean space We consider here a random walk (Sn )n≥1 on IRd , whose increments have law µ, and assume that µ is adapted and aperiodic. We fix a cone C ∈ IRd and study the asymptotic behavior of (Sn )n≥1 inside C. For instance, if d = 1, the cone C will be the half line [0, +∞[; in dimension 2, we can consider the quarter plane [0, +∞[×[0, +∞. We will assume that the origin o belongs to C an that the probability starting from o to stay inside the cone is > 0, (otherwise we will change the starting point of the walk). Under suitable moment conditions on µ, we will study the asymptotic behaviour of the random walk inside C: 1. if τ is the stopping time defined by τ := inf{n ≥ 1 : Sn ∈ / C}, we will precise the tail asymptotics of τ that is the behaviour at infinity of the sequence (P[τ > n])n≥1 2. we will also study a local limit theorem for this walk, i-e find an asymptotic equivalent of the sequence (P[Sn ∈ K ∩ C, τ > n])n where K is a compact of IRd . These question have been studied for a long time in dimension 1; one may cite for instance Kozlov [4], Iglehard citeI, .... their approach uses fine Fourier analysis and is based on the famous Wiener Hopf factorization, which allows to control the fluctuation of a 1-dimensionnal random walk between IR− and IR∗+ (see [2] and [5] for more details and references about fluctuations of random walks). A spectacular progress has been made recently by D. Denisov and V. Watchel ([1]) who consider the general situation of a cone in any dimension; their approach is quite different from the previous ones and is based on a construction of an harmonic function for the random walk staying in the cone and an approximation of random walks by the Brownian motion (with a control of the quality of this normal approximation). In this report, we will (try) read the paper by D. Denisov and V. Watchel and to detail the different steps of their proof. Contacts. [email protected], [email protected]

References [1] Denisov D & Watchel V. Random walks in cone, arxiv.org/pdf/1110.1254. [2] Feller W. An introduction to Probability Theory and Its Applications, Vol. II, J. Wiley, (1970). [3] Iglehart D.L. Random walks with negative drift conditionned to stay positive J. Ap.. Prob. 1974, vol. 11, pp 742-751 [4] Kozlov,M.V. On the asymptotic behavior of the probability of non-extinction for critical branching processes in a random environment J. Th. Prob. 1976, vol. 21, n. 4, pp 791-804 [5] Spitzer F. Principles of random walks , Springer, (1964)

M2 Report in Mathematics Random walks in cones of ...

We will assume that the origin o belongs to C an that the probability starting from o to stay inside the cone is > 0, (otherwise we will change the starting point of the walk). Under suitable moment conditions on µ, we will study the asymptotic behaviour of the random walk inside C: 1. if τ is the stopping time defined by τ := inf{n ...

331KB Sizes 1 Downloads 184 Views

Recommend Documents

Distributed Random Walks
Random walks play a central role in computer science, spanning a wide range of areas in ..... u uniformly at random and forwards C to u after incrementing the counter on the coupon to i. ...... IEEE Computer Society, Washington, DC, 218–223.

PDF Random Walks in Biology Online
... subcellular particles, or cells, or of processes that depend on such motion or are markedly affected by it. Readers do not need to understand thermodynamics in order to acquire a knowledge of the physics involved in diffusion, sedimentation, elec

Random Walks and Half-Lives in Chilean and ...
Random Walks and Half-Lives in Chilean and Mexican Peso. Real Exchange Rates: 1980 – 2003. André Varella Mollick. ∗. Abstract: Several papers have shown that high-inflation contributes to mean reversion in real exchange rates. This paper studies

Random Walks and Search in Time-Varying Networks
Dec 4, 2012 - Random walks on networks lie at the core of many real- ... systems and social networking platforms, the spread of .... nodes, m ј 6, and w ј 10. 2.

Distributed Random Walks
... are not made or distributed for profit or commercial advantage and that ..... distributed algorithm for constructing an RST in a wireless ad hoc network and.

random walks, disconnection and random interlacements
Doctor of Sciences .... covered disk roughly behaves like n1/4 in two dimensions. This be- havior differs radically from that of the largest covered disk centered.

Fast Distributed Random Walks - Semantic Scholar
and efficient solutions to distributed control of dynamic net- works [10]. The paper of ..... [14]. They con- sider the problem of finding random walks in data streams.

Fast Distributed Random Walks
gathering [8, 22], network topology construction [17, 24, 25], checking expander [14], .... Hastings [19, 27] algorithm, a more general type of random walk with ...

Fast Distributed Random Walks - Semantic Scholar
goal is to minimize the number of rounds required to obtain ... network and δ is the minimum degree. ... Random walks play a central role in computer science,.

Fast Distributed Random Walks - Semantic Scholar
Random walks play a central role in computer science, spanning a wide range of .... ameter, δ be the minimum node degree and n be the number of nodes in the ...

Random walks on temporal networks
May 18, 2012 - in settings such as conferences, with high temporal resolution: For each contact .... contexts: the European Semantic Web Conference (“eswc”),.

Random walks on temporal networks
May 18, 2012 - relationships in social networks [2] are a static representation of a succession of ... its nearest neighbors, the most naive strategy is the random walk search, in .... of vertex i, Pr (i; t), as the probability that vertex i is visit

If Exchange Rates Are Random Walks, Then Almost ...
mately random walks implies that fluctuations in interest rates are associated with ... of the Federal Reserve Bank of Minneapolis or the Federal Reserve System. ... Most of these models assume a representative consumer who participates in all .....

Manifold Integration with Markov Random Walks
bedded in data space. ... low-dimensional manifold from a set of data points drawn .... HD∗2H. (11). As in kernel Isomap, we make the kernel matrix positive.

Efficient Distributed Random Walks with Applications
Jul 28, 2010 - undirected network, where D is the diameter of the network. This improves over ... rithm for computing a random spanning tree (RST) in an ar-.

large scale anomaly detection and clustering using random walks
Sep 12, 2012 - years. And I would like to express my hearty gratitude to my wife, Le Tran, for her love, patience, and ... 1. Robust Outlier Detection Using Commute Time and Eigenspace Embedding. Nguyen Lu ..... used metric in computer science. Howev

using graphs and random walks for discovering latent ...
ROUGE-1 scores for different MEAD policies on DUC 2003 and 2004 data. . . . . 43. 3.4. Summary of official ROUGE scores for DUC 2003 Task 2. ...... against using force against Iraq, which will destroy, according to him, seven years of difficult diplo

Random walks on discrete cylinders with large bases ...
vm for some vm ∈ R, which is in fact assumption (A4), see below. Then the graphs Gm ×Z are transient and as N tends to infinity, the. ∏M m=1{0,1}. Gm × RM. +.

Efficient Distributed Random Walks with Applications - Semantic Scholar
Jul 28, 2010 - cations that use random walks as a subroutine. We present two main applications. First, we give a fast distributed algo- rithm for computing a random spanning tree (RST) in an ar- ... tractive to self-organizing dynamic networks such a

A Coalescing-Branching Random Walks on Graphs
construction of peer-to-peer (P2P), overlay, ad hoc, and sensor networks. For example, expanders have been used for modeling and construction of P2P and overlay networks, grids and related graphs have been used as ..... This can be useful, especially