Related papers: Cycles in random meander systems
We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…
We study the distribution of cycles of length h in large networks (of size N>>1) and find it to be an excellent ergodic estimator, even in the extreme inhomogeneous case of scale-free networks. The distribution is sharply peaked around a…
This paper investigates the exact number of limit cycles given by the averaging theory of first order for the piecewise smooth integrable non-Hamiltonian system \begin{eqnarray*} (\dot{x},\ \dot{y})=\begin{cases} (-y(x+a)^2+\varepsilon…
Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let $\beta(G)$ denote the size of the smallest subset X in E(G) such that $G\X$ has no directed cycles, and let $\gamma(G)$ be the number…
Let $M$ be a closed Riemannian surface of genus $g$. We construct a family of 1-cycles on $M$ that represents a non-trivial element of the k'th homology group of the space of cycles and such that the mass of each cycle is bounded above by…
We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…
A Universal Cycle for t-multisets of [n]={1,...,n} is a cyclic sequence of $\binom{n+t-1}{t}$ integers from [n] with the property that each t-multiset of [n] appears exactly once consecutively in the sequence. For such a sequence to exist…
A classic result of Erd\H{o}s, Gy\'arf\'as and Pyber states that for every coloring of the edges of $K_n$ with $r$ colors, there is a cover of its vertex set by at most $f(r) = O(r^2 \log r)$ vertex-disjoint monochromatic cycles. In…
Periodic orbits in chaotic systems form clusters, whose elements traverse approximately the same points of the phase space. The distribution of cluster sizes depends on the length n of orbits and the parameter p which controls closeness of…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Source-sink systems are metapopulations of patches that can be of variable habitat quality. They can be seen as graphs, where vertices represent the patches, and the weighted oriented edges give the probability of dispersal from one patch…
We study large uniform random maps with one face whose genus grows linearly with the number of edges, which are a model of discrete hyperbolic geometry. In previous works, several hyperbolic geometric features have been investigated. In the…
The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
We present here a study of the clustering and cycles present in the graph of Internet at the Autonomous Systems level. Even if the whole structure is changing with time, we present some evidence that the statistical distributions of cycles…
We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…
In the present study we consider planar piecewise linear vector fields with two zones separated by the straight line $x=0$. Our goal is to study the existence of simultaneous crossing and sliding limit cycles for such a class of vector…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…
We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…
A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…