Related papers: Arithmetic area for m planar Brownian paths

The leading and next to leading terms of the average arithmetic area $< S(m)>$ enclosed by $m\to\infty$ independent closed Brownian planar paths, with a given length $t$ and starting from and ending at the same point, is calculated. The…

A Brownian loop is a random walk circuit of infinitely many, suitably infinitesimal, steps. In a plane such a loop may or may not enclose a marked point, the origin, say. If it does so it may wind arbitrarily many times, positive or…

The standard kinetic path integral for all spatially closed Brownian paths (loops) of duration t weighted by the product mn is evaluated, where m and n are the linking numbers of the Brownian loop with two arbitrary curves in 3D space. The…

We study the set of points $\mathcal{D}_{n,m}$ around which two independent Brownian motions wind at least $n$ (resp. $m$) times. We prove that its area is asymptotically equivalent, in $L^p$ and almost surely, to…

We give asymptotic estimations on the area of the sets of points with large Brownian winding, and study the average winding between a planar Brownian motion and a Poisson point process of large intensity on the plane. This allows us to give…

Let $M^m$ be an oriented manifold, let $N^{m-1}$ be an oriented closed manifold, and let $p$ be a point in $M^m$. For a smooth map $f:N^{m-1} \to M^m, p \not\in Im f,$ we introduce an invariant $awin_p(f)$ that can be regarded as a…

Nonintersecting Brownian bridges on the unit circle form a determinantal stochastic process exhibiting random matrix statistics for large numbers of walkers. We investigate the effect of adding a drift term to walkers on the circle…

We study the convergence in rough path topology of a certain class of discrete processes, the hidden Markov walks, to a Brownian motion with an area anomaly. This area anomaly, which is a new object, keeps track of the time-correlation of…

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

Using a general Green function formulation, we re-derive, both, (i) Spitzer and his followers results for the winding angle distribution of the planar Brownian motion, and (ii) Edwards-Prager-Frisch results on the statistical mechanics of a…

We obtain a formula for the density of the winding number of planar Brownian motion around the origin, and deduce from it asymptotic expansions in inverse powers of the logarithm of the squared time, explicit in the angular variable. In…

We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…

We provide a geometric representation of the Poisson and Martin boundaries of a transient, bounded degree triangulation of the plane in terms of its circle packing in the unit disc. (This packing is unique up to M\"obius transformations.)…

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…

We construct an application, which takes as input a simple path and a possibly infinite collection of loops, and outputs a continuous path by adding the loops chronologically to the simple path as the simple path encounters them. By…

There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…

The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…

Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is…

Let B_t be a planar Brownian loop of time duration 1 (a Brownian motion conditioned so that B_0 = B_1). We consider the compact hull obtained by filling in all the holes, i.e. the complement of the unique unbounded component of R^2\B[0,1].…