Related papers: Components and Cycles of Random Mappings
Let $L_{c,n}$ denote the size of the longest cycle in $G(n,{c}/{n})$, $c>1$ constant. We show that there exists a continuous function $f(c)$ such that $ L_{c,n}/n \to f(c)$ a.s. for $c\geq 20$, thus extending a result of the author and…
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…
We consider the component structure of the random digraph $D(n,p)$ inside the critical window $p = n^{-1} + \lambda n^{-4/3}$.We show that the largest component $\mathcal{C}_1$ has size of order $n^{1/3}$ in this range. In particular we…
We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…
We introduce a cycle-expansion (fully deterministic) technique to compute the asymptotic behavior of arbitrary order transport moments. The theory is applied to different kinds of one-dimensional intermittent maps, and Lorentz gas with…
The discrete unitary (reversible) analogues of the continuous (irreversible) tent maps are numerically investigated, in particular, the lengths probability distribution of their periodic orbits. It is found that its density can be well…
A two lane road approaches a stoplight. The left lane merges into the right just past the intersection. Vehicles approach the intersection one at a time, with some drivers always choosing the right lane, while others always choose the…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
A uniformly random graph on $n$ vertices with a fixed degree sequence, obeying a $\gamma$ subpower law, is studied. It is shown that, for $\gamma>3$, in a subcritical phase with high probability the largest component size does not exceed…
This paper studies the properties of convergence of distances between points and the existence and uniqueness of best proximity and fixed points of the so-called semi-cyclic impulsive self-mappings on the union of a number of nonempty…
For a family of random intermittent dynamical systems with a superattracting fixed point we prove that a phase transition occurs between the existence of an absolutely continuous invariant probability measure and infinite measure depending…
The most general N=1 Lagrangian for the spinning particle with local supersymmetry is found and the constraints of the system are analysed. The Dirac quantisation of the model is also investigated.
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining…
The period of a strongly connected digraph is the greatest common divisor of the lengths of all its cycles. The period of a digraph is the least common multiple of the periods of its strongly connected components. These notions play an…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…