Related papers: A point process describing the component sizes in …

We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…

The tacnode process is a universal determinantal point process arising from non-intersecting particle systems and tiling problems. It is the aim of this work to explore the integrable structure and large gap asymptotics for the gap…

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…

A dynamical system that undergoes a supercritical Hopf's bifurcation is perturbed by a multiplicative Brownian motion that scales with a small parameter $\epsilon$. The random fluctuations of the system at the critical point are studied…

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

We use a theorem by Ding, Lubetzky and Peres describing the structure of the giant component of random graphs in the strictly supercritical regime, in order to determine the typical size of MAXCUT of $G\sim G\left(n,\frac…

Gaussian random processes which variances reach theirs maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximums of theirs trajectories have been evaluated using Double Sum Method…

In recent papers it has been demonstrated that sampling a Gibbs distribution from an appropriate time-irreversible Langevin process is, from several points of view, advantageous when compared to sampling from a time-reversible one. Adding…

We study the phase transition of the random degree constrained process (RDCP), a time-evolving random graph model introduced by Ruci\'nski and Wormald that generalizes the random $d$-process to the non-regular setting: each vertex of the…

We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=\mu n/2$…

Let d \geq d_0 be a sufficiently large constant. A (n,d,c \sqrt{d}) graph G is a d-regular graph over n vertices whose second largest (in absolute value) eigenvalue is at most c \sqrt{d}. For any 0 < p < 1, G_p is the graph induced by…

In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

As we add rigid bars between points in the plane, at what point is there a giant (linear-sized) rigid component, which can be rotated and translated, but which has no internal flexibility? If the points are generic, this depends only on the…

We study the probability that the random graph $G(n,p)$ is triangle-free. When $p =o(n^{-1/2})$ or $p = \omega(n^{-1/2})$ the asymptotics of the logarithm of this probability are known via Janson's inequality in the former case and via…

The Generalized Chinese Restaurant Process (GCRP) describes a sequence of exchangeable random partitions of the numbers $\{1,\dots,n\}$. This process is related to the Ewens sampling model in Genetics and to Bayesian nonparametric methods…

Consider a supercritical Crump--Mode--Jagers process $(\mathcal Z_t^{\varphi})_{t \geq 0}$ counted with a random characteristic $\varphi$. Nerman's celebrated law of large numbers [Z. Wahrsch. Verw. Gebiete 57, 365--395, 1981] states that,…

We consider a branching stable process with positive jumps, i.e. a continuous-time branching process in which the particles evolve independently as stable L{\'e}vy processes with positive jumps. Assuming the branching mechanism is critical…

We study the asymptotic distribution of the number of matchings of size $\ell=\ell(n)$ in $G(n,p)$ for a wide range of $p=p(n)\in (0,1)$ and for every $1\le \ell\le \lfloor n/2\rfloor$. We prove that this distribution changes from normal to…

A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…