相关论文: Navigation on a Poisson point process
Analyzing point patterns with linear structures has recently been of interest in e.g. neuroscience and geography. To detect anisotropy in such cases, we introduce a functional summary statistic, called the cylindrical $K$-function, since it…
A procedure to characterize chaotic dynamical systems with concepts of complex networks is pursued, in which a dynamical system is mapped onto a network. The nodes represent the regions of space visited by the system, while edges represent…
A Poisson outdegree-one graph is an oriented graph based on a Poisson point process such that each vertex has only one outgoing edge. The paper focuses on the absence of percolation for such graphs. Our main result is based on two…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…
A set of points with finite density is constructed in $\mathbb{R}^d$, with $d\geq2$, by adding points to a Poisson process such that any line segment of length $O\left(\varepsilon^{-(d-1)}\ln\varepsilon^{-1}\right)$ in $\mathbb{R}^d$ will…
Objects moving in fluids experience patterns of stress on their surfaces determined by their motion and the geometry of nearby boundaries. Fish and underwater robots can use these patterns for navigation. This paper extends this…
Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply.…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
This paper is devoted to the study of couplings of the Lebesgue measure and the Poisson point process. We prove existence and uniqueness of an optimal coupling whenever the asymptotic mean transportation cost is finite. Moreover, we give…
Consider the following random spatial network: in a large disk, construct a network using a stationary and isotropic Poisson line process of unit intensity. Connect pairs of points using the network, with initial / final segments of the…
Let $M$ be a smooth closed orientable manifold and $\mathcal{P}(M)$ the space of Poisson structures on $M$. We construct a Poisson bracket on $\mathcal{P}(M)$ depending on a choice of volume form. The Hamiltonian flow of the bracket acts on…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
We consider symplectic singularities in the sense of A. Beauville as examples of Poisson schemes. Using Poisson methods, we prove that a symplectic singularity admits a finite stratification with smooth symplectic strata. We also prove that…
With the World Wide Web's ubiquity increase and the rapid development of various online businesses, the complexity of web sites grow. The analysis of web user's navigational pattern within a web site can provide useful information for…
Consider a d-dimensional Brownian motion in a random potential defined by attaching a nonnegative and polynomially decaying potential around Poisson points. We introduce a repulsive interaction between the Brownian path and the Poisson…
This article presents a biological neural network model driven by inhomogeneous Poisson processes accounting for the intrinsic randomness of synapses. The main novelty is the introduction of local interactions: each firing neuron triggers…
In this paper, we explore a taxonomy of connectivity for space-like structures. It is inspired by isolating posets of connected pieces of a space and examining its embedding in the ambient space. The taxonomy includes in its scope all…
Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to…
It is challenging for the mobile robot to achieve autonomous and mapless navigation in the unknown environment with uneven terrain. In this study, we present a layered and systematic pipeline. At the local level, we maintain a tree…