Related papers: Arithmetic area for m planar Brownian paths
We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both…
Linear arithmetics are extensions of Presburger arithmetic (Pr) by one or more unary functions, each intended as multiplication by a fixed element (scalar), and containing the full induction schemes for their respective languages. In this…
We estimate the mean first time, called the mean rotation time (MRT), for a planar random polymer to wind around a point. This polymer is modeled as a collection of n rods, each of them being parameterized by a Brownian angle. We are led to…
We give tightness criteria for random variables taking values in the space of all compact sets of cadlag real-valued paths, in terms of both the Skorohod J1 and M1 topologies. This extends earlier work motivated by the study of the Brownian…
This survey is a collection of various results and formulas by different authors on the areas (integrals) of five related processes, viz.\spacefactor =1000 Brownian motion, bridge, excursion, meander and double meander; for the Brownian…
A meandric system of size $n$ is the set of loops formed from two arc diagrams (non-crossing perfect matchings) on $\{1,\dots,2n\}$, one drawn above the real line and the other below the real line. A uniform random meandric system can be…
The spaces of Riemannian metrics on a closed manifold $M$ are studied. On the space ${\mathcal M}$ of all Riemannian metrics on $M$ the various weak Riemannian structures are defined and the corresponding connections are studied. The space…
The aim of this work is to extend to a general $S_m\times S_n$-module context the Grossman-Bizley paradigm that allows the enumeration of Dyck paths in a $m\times n$-rectangle. We obtain an explicit formula for the the "bi-Frobenius"…
Location estimation is a central problem in functional data analysis. In this paper, we investigate penalized spline estimators of location for discretely sampled functional data under a broad class of convex loss functions. Our framework…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…
We use minimal area metrics to generate all nonorientable string diagrams. The surfaces in unoriented string theory have nontrivial open curves and nontrivial closed curves whose neighborhoods are either annuli or Mobius strips. We define a…
We show an $\widetilde{O}(m^{1.5} \epsilon^{-1})$ time algorithm that on a graph with $m$ edges and $n$ vertices outputs its spanning tree count up to a multiplicative $(1+\epsilon)$ factor with high probability, improving on the previous…
We study two variants of the notion of holes formed by planar simple random walk of time duration $2n$ and the areas associated with them. We prove in both cases that the number of holes of area greater than $A(n)$, where $\{A(n)\}$ is an…
We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…
In graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph. For some small classes of graphs, the problem can be solved in polynomial time [2, 4], but it remains NP-hard on general…
We discuss the asymptotic behaviour of random critical Boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index $\alpha \in (1,2]$. We prove that when conditioning such maps…
We propose discrete random-field models that are based on random partitions of $\mathbb{N}^2$. The covariance structure of each random field is determined by the underlying random partition. Functional central limit theorems are established…
In this note, we study the viability of a bounded open domain in $\mathbb{R}% ^{n}$ for a process driven by a path-dependent stochastic differential equation with Lipschitz data. We extend an invariant result of Cannarsa, Da. Prato and…
Rough path analysis can be developed using the concept of controlled paths, and with respect to a topology in which L\'evy's area plays a role. For vectors of irregular paths we investigate the relationship between the property of being…
Lattice numerical simulations for planar closed random walks and their winding sectors are presented. The frontiers of the random walks and of their winding sectors have a Hausdorff dimension $d_H=4/3$. However, when properly defined by…