Related papers: Stable and Fr\'echet limit theorem for subgraph fu…

We study Hamiltonicity in random subgraphs of the hypercube $\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\mathcal{Q}^n$ according to a uniformly chosen…

We prove several limit theorems for a simple class of partially hyperbolic fast-slow systems. We start with some well know results on averaging, then we give a substantial refinement of known large (and moderate) deviation results and…

We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal H$ be such a class, and for $H\in\mathcal H$ write $\Delta(H)$ and $d(H)$ for the maximum degree and average degree of $H$, respectively. We…

Let $H$ be a fixed graph and $\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\mathcal{G}$ follows a normal limiting…

In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results…

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

Given a family ${\cal F}$ of graphs, and a positive integer $n$, the Tur\'an number $ex(n,{\cal F})$ of ${\cal F}$ is the maximum number of edges in an $n$-vertex graph that does not contain any member of ${\cal F}$ as a subgraph. The order…

Enriquez, Faraud, and Lemaire (2023) have established process-level fluctuations for the giant of the dynamic Erd\H{o}s-R\'{e}nyi random graph above criticality and show that the limit is a centered Gaussian process with continuous sample…

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates,…

We study asymptotic behaviors of solutions $f$ to the Dirichlet problem for minimal graphs in the hyperbolic space with singular asymptotic boundaries under the assumption that the boundaries are piecewise regular with positive curvatures.…

Chaotic mixing in a closed vessel is studied experimentally and numerically in different 2-D flow configurations. For a purely hyperbolic phase space, it is well-known that concentration fluctuations converge to an eigenmode of the…

We show that a finitely generated subgroup of the genus two handlebody group is stable if and only if the orbit map to the disk graph is a quasi-isometric embedding. To this end, we prove that the genus two handlebody group is a…

We prove a theorem describing the limiting fine-scale statistics of orbits of a point in hyperbolic space under the action of a discrete subgroup. Similar results have been proved only in the lattice case, with two recent infinite-volume…

The robust statistical description of dynamical systems under perturbations is a central problem in ergodic theory. In this paper, we investigate the statistical properties of skew-product maps driven by a subshift of finite type with…

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…

In this paper we present some new limit theorems for power variation of $k$th order increments of stationary increments L\'evy driven moving averages. In the infill asymptotic setting, where the sampling frequency converges to zero while…

Independent sets in graphs, i.e., subsets of vertices where no two are adjacent, have long been studied, for instance as a model of hard-core gas. The $d$-dimensional hypercube, $\{0,1\}^d$, with the nearest neighbor structure, has been a…