Related papers: Components and Cycles of Random Mappings
A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algorithms may…
We explore the cycle types of a class of biased random derangements, described as a random game played by some children labeled $1,\cdots,n$. Children join the game one by one, in a random order, and randomly form some circles of size at…
In this paper, we shall try to deduce asymptotic behaviour of component spectrum of random $n \times n$ magical squares with line sum $r \in \mathbb{N}$, which can also be identified as $r$-regular bipartite graphs on $2n$ vertices, chosen…
A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…
We examine cyclic phantom models for the universe, in which the universe is dominated sequentially by radiation, matter, and a phantom dark energy field, followed by a standard inflationary phase. Since this cycle repeats endlessly, the…
The binomial random bipartite graph $G(n,n,p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probability $p$. It is known that this model exhibits a similar…
We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…
We continue the study of the assignment problem for a random cost matrix. We analyse the number of $k$-cycles for the solution and their dependence on the symmetry of the random matrix. We observe that for a symmetric matrix one and…
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of $n$ vertices and perturbed only at approximately $n^{1/\rho}$ random locations with an appropriate, possibly sparse, interconnection structure.…
Inside living cells are complex mixtures of thousands of components. It is hopeless to try to characterise all the individual interactions in these mixtures. Thus, we develop a statistical approach to approximating them, and examine the…
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…
Cumulant mapping employs a statistical reconstruction of the whole by sampling its parts. The theory developed in this work formalises and extends ad hoc methods of `multi-fold' or `multi-dimensional' covariance mapping. Explicit formulae…
We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…