Related papers: Semi-Poisson nearest-neighbor distance statistics …
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
The stationary isotropic Poisson line process was used to derive upper bounds on mean excess network geodesic length in Aldous and Kendall [Adv. in Appl. Probab. 40 (2008) 1-21]. The current paper presents a study of the geometry and…
We study the shrinking Pearson random walk in two dimensions and greater, in which the direction of the Nth is random and its length equals lambda^{N-1}, with lambda<1. As lambda increases past a critical value lambda_c, the endpoint…
Modern datasets are characterized by a large number of features that may conceal complex dependency structures. To deal with this type of data, dimensionality reduction techniques are essential. Numerous dimensionality reduction methods…
A spanner graph on a set of points in $R^d$ contains a shortest path between any pair of points with length at most a constant factor of their Euclidean distance. In this paper we investigate new models and aim to interpret why good…
The paper deals with topical issues of modern mathematical theory of dynamical chaos and its applications. At present, it is customary to assume that dynamical chaos in finitedimensional smooth systems can exist in three different forms.…
We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…
We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a…
Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper, we prove that the conjecture holds for quasi-transitive…
In this paper, we consider the quantum-mechanical phase space patterns on ordered and disordered networks. For ordered networks in which each node is connected to its 2m nearest neighbors (m on either side), the phase space…
This paper is devoted to the stochastic approximation of entropically regularized Wasserstein distances between two probability measures, also known as Sinkhorn divergences. The semi-dual formulation of such regularized optimal…
Experimental studies of the diffusion of biomolecules in the environment of biological cells are routinely confronted with multiple sources of stochasticity, whose identification renders the detailed data analysis of single molecule…
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…
In both Tweedie and geometric Tweedie models, the common power parameter $p\notin(0,1)$ works as an automatic distribution selection. It mainly separates two subclasses of semicontinuous ($1<p<2$) and positive continuous ($p\geq 2$)…
We studied the statistical properties of a quantum system in the pseudo-integrable regime through the gap ratios between consecutive energy levels of the scattering spectra. A two-dimensional quantum billiard containing a point-like…
Strange nonchaotic attractors (SNAs) in noise driven systems are investigated. Before the transition to chaos, due to the effect of noise, a typical trajectory will wander between the periodic attractor and its nearby chaotic saddle in an…
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a…
We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are…
Pesin's identity provides a profound connection between entropy $h_{KS}$ (statistical mechanics) and the Lyapunov exponent $\lambda$ (chaos theory). It is well known that many systems exhibit sub-exponential separation of nearby…
Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a distance between graphs. Our idea is to derive…