Related papers: Representations of stack triangulations in the pla…
Three-dimensional random tessellations that are stable under iteration (STIT tessellations) are considered. They arise as a result of subsequent cell division, which implies that their cells are not face-to-face. The edges of the…
Random packings of stiff rods are self-supporting mechanical structures stabilized by long range interactions induced by contacts. To understand the geometrical and topological complexity of the packings, we first deploy X-ray computerized…
We examine theoretically the effects of random topographical substrates on the motion of two-dimensional droplets via appropriate statistical approaches. Different random substrate families are represented as stationary random functions.…
We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…
This article is devoted to the properties of the planar triangulations. The conjugated planar triangulation will be introduced and on the base of the properties, which were achieved by the other authors there will be proved some theorems,…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
We study the structure of representations, defined as approximations of minimal sufficient statistics that are maximal invariants to nuisance factors, for visual data subject to scaling and occlusion of line-of-sight. We derive analytical…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number of children in some finite set. By calculating the mixed…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
Tiny fluctuations of the Cosmic Microwave Background as well as various observable quantities obtained by spin raising and spin lowering of the effective gravitational lensing potential of distant galaxies and galaxy clusters, are described…
Random flights in $\mathbb{R}^d,d\geq 2,$ with Dirichlet-distributed displacements and uniformly distributed orientation are analyzed. The explicit characteristic functions of the position $\underline{\bf X}_d(t),\,t>0,$ when the number of…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…
This paper deals with the typical cell in a Poisson line tessellation in the plane whose directional distribution is concentrated on three equally spread values with possibly different weights. Such a random polygon can only be a triangle,…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
We elaborate on an alternative representation of conditional probability to the usual tree diagram. We term the representation `turtleback diagram' for its resemblance to the pattern on turtle shells. Adopting the set theoretic view of…
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…