Related papers: Order distances and split systems
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
This article discusses the properties of extremes of degree sequences calculated from network data. We introduce the notion of a normalized degree, in order to permit a comparison of degree sequences between networks with differing numbers…
In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…
We study the properties of metrics aimed at the characterization of grid-like ordering in complex networks. These metrics are based on the global and local behavior of cycles of order four, which are the minimal structures able to identify…
In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different…
There exists a bijection between one stack sortable permutations --permutations which avoid the pattern 231-- and planar trees. We define an edit distance between permutations which is coherent with the standard edit distance between trees.…
Labeling schemes seek to assign a short label to each node in a network, so that a function on two nodes can be computed by examining their labels alone. For the particular case of trees, optimal bounds (up to low order terms) were recently…
Low-dimensional organic conductors could establish themselves as model systems for the investigation of the physics in reduced dimensions. In the metallic state of a one-dimensional solid, Fermi-liquid theory breaks down and spin and charge…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \leq k \leq \binom{n}{2}$, the…
Despite the growing interest in characterizing the local geometry leading to the global topology of networks, our understanding of the local structure of complex networks, especially real-world networks, is still incomplete. Here, we…
In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…
In a previous paper we showed that, for any $n \ge m+2$, most sets of $n$ points in $\RR^m$ are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there…
We develop a network in which the natural numbers are the vertices. We use the decomposition of natural numbers by prime numbers to establish the connections. We perform data collapse and show that the degree distribution of these networks…
For non-empty sets X we define notions of distance and pseudo metric with values in a partially ordered set that has a smallest element $\theta $. If $h_X$ is a distance in $X$ (respectively, a pseudo metric in $X$), then the pair $(X,h_X)$…
Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…