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

A finite point process is characterized by the distribution of the number of points (the size) of the process. In some applications, for example, in the context of packet flows in modern communication networks, it is of interest to infer…

We consider the point process \begin{align*} \frac{1}{Z_{n}}\prod_{1 \leq j < k \leq n} |e^{i\theta_{j}}-e^{-i\theta_{k}}|^{\beta}\prod_{j=1}^{n} d\theta_{j}, \qquad \theta_{1},\ldots,\theta_{n} \in (-\pi,\pi], \quad \beta > 0, \end{align*}…

We study space-time fluctuations around a characteristic line for a one-dimensional interacting system known as the random average process. The state of this system is a real-valued function on the integers. New values of the function are…

The local eigenvalue statistics of large random matrices near a hard edge transitioning into a soft edge are described by the Bessel process associated with a large parameter $\alpha$. For this point process, we obtain 1) exponential moment…

We study the probability distribution $P$ of the sum of a large number of non-identically distributed random variables $n_m$. Condensation of fluctuations, the phenomenon whereby one of such variables provides a macroscopic contribution to…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

In this paper we show that the random degree constrained process (a time-evolving random graph model with degree constraints) has a local weak limit, provided that the underlying host graphs are high degree almost regular. We, moreover,…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…

We investigate the behavior of large connected components in the Poisson Random Connection model in non-critical regimes with any bounded connection function. We show that the asymptotic size of the largest component restricted to a window…

We consider the problem of detecting abrupt changes (i.e., large jump discontinuities) in the rate function of a point process. The rate function is assumed to be fully unknown, non-stationary, and may itself be a random process that…

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

This work is a continuation of [7]. We consider a continuous-time birth-and-death process in which the transition rates have an asymptotical power-law dependence upon the position of the process. We establish rough exponential asymptotic…

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…

We determine the asymptotic law for the fluctuations of the total number of critical points of random Gaussian spherical harmonics in the high degree limit. Our results have implications on the sophistication degree of an appropriate…

A point process on a space is a random bag of elements of that space. In this paper we explore programming with point processes in a monadic style. To this end we identify point processes on a space X with probability measures of bags of…

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…

We identify the asymptotic probability of a configuration model $\mathrm{CM}_n(\boldsymbol{d})$ to produce a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well…

In this paper we introduce a network model which evolves in time, and study its largest connected component. We consider a process of graphs $(G_t:t\in [0,1])$, where initially we start with a critical Erd\H{o}s-R\'enyi graph ER(n, 1/n),…