Related papers: A point process describing the component sizes in …
We consider a variant of the classical Erd\H{o}s-R\'enyi random graph, where components with surplus are slowed down to prevent the apparition of complex components. The sizes of the components of this process undergo a similar phase…
The statistical properties of a stochastic process may be described (1)by the expectation values of the observables, (2)by the probability distribution functions or (3)by probability measures on path space. Here an analysis of level (3) is…
We analyse the asymptotic behaviour of the probability of observing the expected number of successes at each stage of a sequence of nested Bernoulli trials. Our motivation is the attempt to give a genuinely frequentist interpretation to the…
We study random subgraphs of the $n$-cube $\{0,1\}^n$, where nearest-neighbor edges are occupied with probability $p$. Let $p_c(n)$ be the value of $p$ for which the expected cluster size of a fixed vertex attains the value $\lambda…
We study the asymptotic behavior of the fluctuations of smooth and rough linear statistics for determinantal point processes on the sphere and on the Euclidean space. The main tool is the generalization of some norm representation results…
We study the problem of the existence of a giant component in a random multipartite graph. We consider a random multipartite graph with $p$ parts generated according to a given degree sequence $n_i^{\mathbf{d}}(n)$ which denotes the number…
We study the stabilization time of a wide class of processes on graphs, in which each node can only switch its state if it is motivated to do so by at least a $\frac{1+\lambda}{2}$ fraction of its neighbors, for some $0 < \lambda < 1$. Two…
In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…
This is a status report on a companion subject to extremal combinatorics, obtained by replacing extremality properties with emergent structure, `phases'. We discuss phases, and phase transitions, in large graphs and large permutations,…
In this paper we consider the persistence properties of random processes in Brownian scenery, which are examples of non-Markovian and non-Gaussian processes. More precisely we study the asymptotic behaviour for large $T$, of the probability…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
In this paper, we analyze the asymptotic behavior of the point process of exceedances in a spatio-temporal setting whose points are given by the rescaled occurrence times, the sites and the rescaled values of exceedances. Here, the…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
We determine the asymptotics of the independence number of the random $d$-regular graph for all $d \ge d_0$. It is highly concentrated, with constant-order fluctuations around $n\alpha_* - c_*\log n$ for explicit constants $\alpha_*(d)$ and…
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
Computing the maximum size of an independent set in a graph is a famously hard combinatorial problem that has been well-studied for various classes of graphs. When it comes to random graphs, only the classical Erd\H{o}s-R\'enyi-Gilbert…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
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…