Related papers: From Random Lines to Metric Spaces
We propose a simple connection between matrix quantum mechanics and tensor networks. This allows us to imbue tensor networks with some interesting additional structure. The geometry of the graph describing the tensor network state is…
Let $(G_n)_{n=1}^{\infty}$ be a sequence of finite graphs, and let Y_t be the length of a loop-erased random walk on G_n after t steps. We show that for a large family of sequences of finite graphs, which includes the case in which G_n is…
In a series of papers Tsirelson constructed from measure types of random sets and generalised random processes a new range of examples for continuous tensor product systems of Hilbert spaces introduced by Arveson for classifying…
Auxetic materials are characterized by a negative Poisson's ratio, $\mathrm{\nu}$. As the Poisson's ratio becomes negative and approaches the lower isotropic mechanical limit of $\mathrm{\nu = -1}$, materials show enhanced resistance to…
Less than 10 meters deep, shallow landslides are rapidly moving and strongly dangerous slides. In the present work, the probabilistic distribution of the landslide detachment points within a valley is modelled as a spatial Poisson point…
A technique is presented to characterize the Signal-to-Interference-plus-Noise Ratio (SINR) of a representative link with a multiantenna linear Minimum-Mean-Square-Error receiver in a wireless network with transmitting nodes distributed…
We consider an ensemble of $N$ discrete nonintersecting paths starting from equidistant points and ending at consecutive integers. Our first result is an explicit formula for the correlation kernel that allows us to analyze the process as…
We develop, analyze, implement, and compare new algorithms for creating $\varepsilon$-samples of range spaces defined by halfspaces which have size sub-quadratic in $1/\varepsilon$, and have runtime linear in the input size and…
We consider stochastic processes on complete, locally compact tree-like metric spaces $(T,r)$ on their "natural scale" with boundedly finite speed measure $\nu$. Given a triple $(T,r,\nu)$ such a speed-$\nu$ motion on $(T,r)$ can be…
The meta distribution of the signal-to-interference-ratio (SIR) is an important performance indicator for wireless networks because, for ergodic point processes, it describes the fraction of scheduled links that achieve certain reliability,…
We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…
Positive semi-definite kernels are used to induce pseudo-metrics, or ``distances'', between measures. We write these as an expected quadratic variation of, or expected inner product between, a random field and the difference of measures.…
The minimal number of nodes required to multilaterate a network endowed with geodesic distance (i.e., to uniquely identify all nodes based on shortest path distances to the selected nodes) is called its metric dimension. This quantity is…
Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…
The structure of a network has a major effect on dynamical processes on that network. Many studies of the interplay between network structure and dynamics have focused on models of phenomena such as disease spread, opinion formation and…
We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…