相关论文: Directed, cylindric and radial Brownian webs

We propose a method to exactly generate Brownian paths $x_c(t)$ that are constrained to return to the origin at some future time $t_f$, with a given fixed area $A_f = \int_0^{t_f}dt\, x_c(t)$ under their trajectory. We derive an exact…

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…

The stationary radial distribution, $P(\rho)$, of the random walk with the diffusion coefficient $D$, which winds with the tangential velocity $V$ around the impenetrable disc of radius $R$ for $R\gg 1$ converges to the distribution…

The asymptotic wave speed for FKPP type reaction-diffusion equations on a class of infinite random metric trees are considered. We show that a travelling wavefront emerges, provided that the reaction rate is large enough. The wavefront…

We study a correlated Brownian motion in two dimensions, which is reflected, stopped or killed in a wedge represented as the intersection of two half spaces. First, we provide explicit density formulas, hinted by the method of images. These…

We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…

The problem of detecting a few anomalous processes among a large number of data streams is considered. At each time, aggregated observations can be taken from a chosen subset of the processes, where the chosen subset conforms to a given…

Discrete-time quantum walks (QWs) represent robust and versatile platforms for the controlled engineering of single particle quantum dynamics, and have attracted special attention due to their algorithmic applications in quantum information…

We introduce a new model called the Brownian Conga Line. It is a random curve evolving in time, generated when a particle performing a two dimensional Gaussian random walk leads a long chain of particles connected to each other by cohesive…

We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…

We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…

We consider navigation schemes on planar diluted lattices and semi lattices with one discrete and one continuous component. More precisely, nodes that survive inhomogeneous Bernoulli site percolation, or are placed as inhomogeneous Poisson…

It is known that the Brownian bridge or L\'evy-Ciesielski construction of Brownian paths almost surely converges uniformly to the true Brownian path. In the present article the focus is on the uniform error. In particular, we show…

We numerically investigate the transport of a suspended overdamped Brownian particle which is driven through a two-dimensional rectangular array of circular obstacles with finite radius. Two limiting cases are considered in detail, namely,…

There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…

We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…

In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic…

In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint…

The problems considered in the present paper have their roots in two different cultures. The 'true' (or myopic) self-avoiding walk model (TSAW) was introduced in the physics literature by Amit, Parisi and Peliti. This is a nearest neighbor…

We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…