Related papers: Short cycles in high genus unicellular maps

This is an expository paper. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is contained in an even number of edges from $C$. E.g., a cycle in the sense of graph theory is a $1$-cycle, but not vice versa. It is easy to…

We show that the graphs of nonseparating curves for oriented finite type surfaces are uniformly hyperbolic. Our proof follows the proof of uniform hyperbolicity of the graphs of curves for closed surfaces due to Przytycki-Sisto, while…

We give sufficient conditions for the uniform hyperbolicity of certain nonuniformly hyperbolic dynamical systems. In particular, we show that local diffeomorphisms that are nonuniformly expanding on sets of total probability are necessarily…

We consider an independently identically distributed random dynamical system generated by finitely many, non-uniformly expanding Markov interval maps with a finite number of branches. Assuming a topologically mixing condition and the…

The $2$-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that ($2$-cell) embedding a given graph $G$ on a closed orientable surface is equivalent to cyclically ordering the edges incident to each…

We study spatial permutations with cycle weights that are bounded or slowly diverging. We show that a phase transition occurs at an explicit critical density. The long cycles are macroscopic and their cycle lengths satisfy a…

Cell size control and homeostasis is a major topic in cell biology yet to be fully understood. Several growth laws like the timer, adder, and sizer were proposed, and mathematical approaches that model cell growth and division were…

The union of the particles of a stationary Poisson process of compact (convex) sets in Euclidean space is called Boolean model and is a classical topic of stochastic geometry. In this paper, Boolean models in hyperbolic space are…

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

This article first answers to questions about connectedness of a new family of graphs on unicellular maps. Answering these questions goes through a description of the mapping class group as surgeries on unicellular maps. We also show how…

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

It is a well-known fact that genetic sequences may contain sections with repeated units, called repeats, that differ in length over a population, with a length distribution of geometric type. A simple class of recombination models with…

We consider a robust variant of Dirac-type problems in $k$-uniform hypergraphs. For instance, we prove that if $H$ is a $k$-uniform hypergraph with minimum codegree at least $(1/2 + \gamma )n$, $\gamma >0$, and $n$ is sufficiently large,…

We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

Studies of disordered heterogeneous media and galaxy cosmology share a common goal: analyzing the distribution of particles at `microscales' to predict physical properties at `macroscales', whether for a liquid, composite material, or…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

Using the existence of certain symplectic submanifolds in symplectic 4-manifolds, we prove an estimate from above for the number of singular fibers with separating vanishing cycles in minimal Lefschetz fibrations over surfaces of positive…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…