Related papers: The Brownian continuum random tree as the unique s…
The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
The main goal of this article is to prove the existence of a random attractor for a stochastic evolution equation driven by a fractional Brownian motion with $H\in (1/2,1)$. We would like to emphasize that we do not use the usual cohomology…
In this work we connect the theory of Dirichlet forms and direct stochastic calculus to obtain strong existence and pathwise uniqueness for Brownian motion that is perturbed by a series of constant multiples of local times at a sequence of…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…
We consider a d-dimensional stochastic differential equation with additive noise and a drift coefficient which is assumed only to be a bounded Borel function. We show that, for almost all choices of the driving Brownian path, the equation…
This paper addresses the question of how Brownian-like motion can arise from the solution of a deterministic differential delay equation. To study this we analytically study the bifurcation properties of an apparently simple differential…
Given a recursive distributional equation (RDE) and a solution $\mu$ of it, we consider the tree indexed invariant process called the recursive tree process (RTP) with marginal $\mu$. We introduce a new type of bivariate uniqueness property…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
The paper is devoted to the study of the dynamical behavior of the solutions of stochastic FitzHugh-Nagumo lattice equations, driven by fractional Brownian motions, with Hurst parameter greater than $1/2$. Under some usual dissipativity…
We consider a semi-linear advection equation driven by a highly-oscillatory space-time Gaussian random field, with the randomness affecting both the drift and the nonlinearity. In the linear setting, classical results show that the…
Aldous and Bandyopadhyay have shown that each solution to a recursive distributional equation (RDE) gives rise to recursive tree process (RTP), which is a sort of Markov chain in which time has a tree-like structure and in which the state…
The classical Brouwer fixed point theorem states that in R^d every continuous function from a convex, compact set on itself has a fixed point. For an arbitrary probability space, let L^0 = L^0 (\Omega, A,P) be the set of random variables.…
We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchronization. Specifically, we are given directed distances on a…
Our investigation is specially motivated by the stochastic version of a common model of potential spread in a dendritic tree. We do not assume the noise in the junction points to be Markovian. In fact, we allow for long-range dependence in…
Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…
Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…
In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$…
We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the…