Related papers: Generalized rescaling limits of a sequence of rati…
We discuss rescaling limits for sequences of complex rational maps in one variable which approach infinity in parameter space.It is shown that any given sequence of maps of degree $d \ge 2$ has at most $2d-2$ dynamically distinct rescaling…
We introduce the notion of dynamically marked rational maps. We study sequences of analytic conjugacy classes of rational maps which diverge in moduli space. In particular, we are interested in the notion of rescaling limits introduced by…
We study sequences of analytic conjugacy classes of rational maps which diverge in moduli space. In particular, we are interested in the notion of rescaling limits introduced by Jan Kiwi. In the continuity of [A1] we recall the notion of…
Suppose $\{f_t\}$ is an analytic one-parameter family of rational maps defined over a non-Archimedean field $K$. We prove a finiteness theorem for the set of rescalings for $\{f_t\}$. This complements results of J. Kiwi.
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
We construct a family of rational map sequences providing an arbitrary large number of dynamically independent rescaling limits of non monomial type. From this, we deduce the existence of a family of rational maps providing a non trivial…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
Reduced models are matrix integrals believed to be related to the large N limit of gauge theories. These integrals are known to simplify further when the number of matrices D (corresponding to the number of space-time dimensions in the…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…
In this paper, we show that one can naturally associate a limiting dynamical system $F: T\longrightarrow T$ on an $\R$-tree to any degenerating sequence of rational maps $f_n: \hat\C \longrightarrow \hat\C$ of fixed degree. The construction…
In our previous work, we introduced the random $k$-cut number for rooted graphs. In this paper, we show that the distribution of the $k$-cut number in complete binary trees of size $n$, after rescaling, is asymptotically a periodic function…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…
Let $\varphi:\mathbb{P}^1(\mathbb F_q)\to\mathbb{P}^1(\mathbb F_q)$ be a rational map of degree $d>1$ on a fixed finite field. We give asymptotic formulas for the size of image sets $\varphi^n(\mathbb{P}^1(\mathbb F_q))$ as a function of…
One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…