Related papers: Scaling limits of random planar maps with large fa…
We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
We show that an $n$-dimensional surface whose entropy is close to that of an $n$-dimensional plane is close in Hausdorff distance to some $n$-dimensional plane at every scale. Moreover we show that self-expanders of low entropy converge in…
We consider a system of parallel straight edge dislocations and we analyse its asymptotic behaviour in the limit of many dislocations. The dislocations are represented by points in a plane, and they are arranged in vertical walls; each wall…
Systems of a large number N of globally coupled maps have become popular as a relatively simple prototype of high-dimensional dynamics, showing many interesting and typical phenomena like synchronisation, cluster formation and…
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…
This paper establishes the global asymptotic equivalence, in the sense of the Le Cam $\Delta$-distance, between scalar diffusion models with unknown drift function and small variance on the one side, and nonparametric autoregressive models…
The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…
Scaling limits for continuous-time branching processes with discrete state space are provided as the initial state tends to infinity. Depending on the finiteness or non-finiteness of the mean and/or the variance of the offspring…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
Continuous determinantal point processes (DPPs) are a class of repulsive point processes on $\mathbb{R}^d$ with many statistical applications. Although an explicit expression of their density is known, it is too complicated to be used…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…
We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…
The nearest-neighbor level spacing distribution is numerically investigated by directly diagonalizing disordered Anderson Hamiltonians for systems of sizes up to 100 x 100 x 100 lattice sites. The scaling behavior of the level statistics is…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…