Related papers: Two recursive decompositions of Brownian bridge
In this paper, we study the asymptotic behavior of the number of crossings by a one-dimensional diffusion of a threshold where the process exhibits stickiness. We distinguish three types of crossings and show that to each type corresponds a…
We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…
Tied-down renewal processes are generalisations of the Brownian bridge, where an event (or a zero crossing) occurs both at the origin of time and at the final observation time $t$. We give an analytical derivation of the two-time…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
Motivated by Kesten's bridge decomposition for two-dimensional self-avoiding walks in the upper half plane, we show that the conjectured scaling limit of the half-plane SAW, the SLE(8/3) process, also has an appropriately defined bridge…
Consider a sequence of Poisson point processes of non-trivial loops with certain intensity measures $(\mu^{(n)})_n$, where each $\mu^{(n)}$ is explicitly determined by transition probabilities $p^{(n)}$ of a random walk on a finite state…
Diffusion through semipermeable structures arises in a wide range of processes in the physical and life sciences. Examples at the microscopic level range from artificial membranes for reverse osmosis to lipid bilayers regulating molecular…
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…
We study a space-time Brownian motion with drift B(t)=(t_0+t,y_0+W(t)+t) killed at the moving boundary of the cone {(t,x):0<x<t}. This article determines the parabolic Martin boundary and all harmonic functions associated with this process.…
We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…
The Brownian triangulation is a random compact subset of the unit disk introduced by Aldous. For $\epsilon>0$, let $N(\epsilon)$ be the number of triangles whose sizes (measured in different ways) are greater than $\epsilon$ in the Brownian…
We calculate crossing probabilities and one-sided last exit time densities for a class of moving barriers on an interval $[0,T]$ via Schwartz distributions. We derive crossing probabilities and first hitting time densities for another class…
We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
Random Bridges have gained significant attention in recent years due to their potential applications in various areas, particularly in information-based asset pricing models. This paper aims to explore the potential influence of the pinning…
The problems of the construction of the asymptotically distribution free goodness-of-fit tests for three models of stochastic processes are considered. The null hypothesis for all models is composite parametric. All tests are based on the…
We study periodic Brownian paths, wrapped around the surface of a cylinder. One characteristic of such a path is its width square, $w^2$, defined as its variance. Though the average of $w^2$ over all possible paths is well known, its full…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
In this paper we prove an analogue of the Koml\'os-Major-Tusn\'ady (KMT) embedding theorem for random walk bridges. The random bridges we consider are constructed through random walks with i.i.d jumps that are conditioned on the locations…