相关论文: Percolating paths through random points :
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consider the problem of minimizing…
In this paper, we establish moderate deviations for the chemical distance in Bernoulli percolation. The chemical distance between two points is the length of the shortest open path between these two points. Thus, we study the size of random…
Let $\Delta\subsetneq\V$ be a proper subset of the vertices $\V$ of the defining graph of an irreducible and aperiodic shift of finite type $(\Sigma_{A}^{+},\S)$. Let $\Sigma_{\Delta}$ be the subshift of allowable paths in the graph of…
Heuristics indicate that point processes exhibiting clustering of points have larger critical radius $r_c$ for the percolation of their continuum percolation models than spatially homogeneous point processes. It has already been shown, and…
We use a functional analogue of the quantile function for probability measures on $\mathbb{R}^d$ to characterize a novel limit Poisson point process for radially recentred and rescaled random vectors under a radial-directional…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
We consider a mean curvature flow in a cone, that is, a hypersurface in a cone which moves toward the opening with normal velocity equaling to the mean curvature, and the contact angle between the hypersurface and the cone boundary being…
The two parameter Poisson-Dirichlet distribution $PD(\alpha,\theta)$ is the distribution of an infinite dimensional random discrete probability. It is a generalization of Kingman's Poisson-Dirichlet distribution. The two parameter Dirichlet…
The Hammersley problem asks for the maximal number of points in a monotonous path through a Poisson point process. It is exactly solvable and notoriously known to belong to the KPZ universality class, with a cube-root scaling for the…
We study the a.s. sample path regularity of Gaussian processes. To this end we relate the path regularity directly to the theory of small deviations. In particular, we show that if the process is $n$-times differentiable then the…
We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each…
In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network…
In this paper, we consider an extension of the Poisson random measure for the formulation of continuous-time reinforcement learning, such that both the frequency and the width of the jumps depend on the path. Starting from a general point…
We define a graph process $\mathcal{G}(p,q)$ based on a discrete branching process with deletions and mergers, which is inspired by the 4-cycle structure of both the hypercube $Q_d$ and the lattice $\mathbb{Z}^d$ for large $d$. Individuals…
In this paper, we study some properties of optimal paths in the first passage percolation on $\Z^d$ and show the followings: (1) the number of optimal paths has an exponential growth if the distribution has an atom; (2) the means of…