Related papers: A Generalized Cross Ratio
We present a definition of and discuss basic properties of cross-ratios over noncommutative skew-fields. A new theorem was added.
This paper introduces advances in the geometry of the transforms for cross ratio of four points in a line in the Desargues affine plane. The results given here have a clean, based Desargues affine plan axiomatic and definitions of addition…
We discuss the cross-ratio map of planar quadrilateral linkages, also in the case when one of the links is telescopic. Most of our results are valid for a planar quadrilateral linkage with generic lengths of the sides. In particular, we…
Generalization of the cross ratio to polarizations of linear finite and infinite-dimensional spaces (in particular to Sato Grassmannian) is given and explored. This cross ratio appears to be a cocycle of the canonical (tautalogical) bundle…
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…
We consider metric graph Gaussian free field (GFF) defined on polygons of $\delta\mathbb{Z}^2$ with alternating boundary data. The crossing probabilities for level-set percolation of metric graph GFF have scaling limits. When the boundary…
Classical path search assumes complete graphs and scalar optimization metrics, yet real infrastructure networks are incomplete and require multi-dimensional evaluation. We introduce the concept of traversal: a generalization of paths that…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
The crossing probability in the time direction is defined for an off-equilibrium reaction-diffusion system as the probability that the system of size L is still active at time t, in the finite-size scaling limit. Exact results are obtained…
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…
We prove that the number of crossings in a random labelled tree with vertices in convex position is asymptotically Gaussian with mean $ n^2/6$ and variance $ n^3/45$. A similar result is proved for points in general position under mild…
Two key tasks in high-dimensional regularized regression are tuning the regularization strength for accurate predictions and estimating the out-of-sample risk. It is known that the standard approach -- $k$-fold cross-validation -- is…
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…
This paper reviews generalized Pareto copulas (GPC), which turn out to be a key to multivariate extreme value theory. Any GPC can be represented in an easy analytic way using a particular type of norm on $\mathbb{R}^d$, called $D$-norm. The…
A graph is said to be {\em half-arc-transitive} if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called…
Scale-invariant universal crossing probabilities are studied for critical anisotropic systems in two dimensions. For weakly anisotropic standard percolation in a rectangular-shaped system, Cardy's exact formula is generalized using a…