Related papers: Component structure of the configuration model: ba…
In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\lambda^{\# \mbox{edges}} n^{\# \mbox{loops}},}$$ where $\lambda, n \in…
It is expected that conformal symmetry is an emergent property of many systems at their critical point. This imposes strong constraints on the critical behavior of a given system. Taking them into account in theoretical approaches can lead…
A random graph process, $\Gorg[1](n)$, is a sequence of graphs on $n$ vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known…
Critical slowing down of the relaxation of the order parameter is relevant both in early the universe and in ultrarelativistic heavy ion collisions. We study the relaxation rate of the order parameter in an O(N) scalar theory near the…
We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…
Combining the Bethe Ansatz with a functional deviation expansion and using an asymptotic expansion of the Bethe Ansatz equations, we compute the curvature of levels D_n at any filling for the one-dimensional lattice spinless fermion model.…
We investigate the dynamics of $N$ point vortices in the plane, in the limit of large $N$. We consider {\em relative equilibria}, which are rigidly rotating lattice-like configurations of vortices. These configurations were observed in…
We study noise sensitivity of properties of the largest components $({\cal C}_j)_{j\geq 1}$ of the random graph ${\cal G}(n,p)$ in its critical window $p=(1+\lambda n^{-1/3})/n$. For instance, is the property "$|{\cal C}_1|$ exceeds its…
The random coloured graph $G_c(n,p)$ is obtained from the Erd\H{o}s-R\'{e}nyi binomial random graph $G(n,p)$ by assigning to each edge a colour from a set of $c$ colours independently and uniformly at random. It is not hard to see that,…
Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,\ldots,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect…
We study the generalized $n$ component model of a driven diffusive system with annealed random drive in the large $n$ limit. This non-equilibrium model also describes conserved order parameter dynamics of an equilibrium model of…
Let $(Z_{n})$ be a supercritical branching process in a random environment $\xi $, and $W$ be the limit of the normalized population size $Z_{n}/\mathbb{E}[Z_{n}|\xi ]$. We show large and moderate deviation principles for the sequence $\log…
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…
Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…
We study the number of chords and the number of crossings in the largest component of a random chord diagram when the chords are sparsely crossing. This is equivalent to studying the number of vertices and the number of edges in the largest…
We study the asymptotic behaviour of the survival probability of a multi-type branching processes in random environment. The class of processes we consider corresponds, in the one-dimensional situation, to the intermediately subcritical…
For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant…
Motivated by applications to COVID dynamics, we describe a branching process in random environments model $\{Z_n\}$ whose characteristics change when crossing upper and lower thresholds. This introduces a cyclical path behavior involving…
The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…
We review some exact results for the motion of a tagged particle in simple models. Then, we study the density dependence of the self diffusion coefficient, $D_N(\rho)$, in lattice systems with simple symmetric exclusion in which the…