Related papers: Novel scaling limits for critical inhomogeneous ra…

We present large deviations estimates in the supremum norm for a system of independent random walks superposed with a birth-and-death dynamics evolving on the discrete torus with $N$ sites. The scaling limit considered is the so-called…

This paper investigates L\'evy walks with random velocities, extending classical models beyond constant speed assumptions. We derive scaling limits, demonstrating that diffusion depends on interplay between heavy-tailed duration and…

The authors studied in [Ann. Inst. Henri Poincar\'e D 9, 367-433, (2022)], a complex multi-matrix model with $\mathrm{U}(N)^2 \times \mathrm{O}(D)$ symmetry, and whose double scaling limit where simultaneously the large-$N$ and large-$D$…

Central limit theorems (CLTs) for high-dimensional random vectors with dimension possibly growing with the sample size have received a lot of attention in the recent times. Chernozhukov et al. (2017) proved a Berry--Esseen type result for…

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this…

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…

We study concentration properties of vertex degrees of $n$-dimensional Erdos-R\'enyi random graphs with the edge probability $\rho/n$ by means of high moments of these random variables in the limit when $n$ and $\rho$ tend to infinity.…

Monte Carlo results for the moments <M^k> of the magnetization distribution of the nearest-neighbor Ising ferromagnet in a L^d geometry, where L (4 \leq L \leq 22) is the linear dimension of a hypercubic lattice with periodic boundary…

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…

We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…

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…

The dynamical scaling for statistics of critical multifractal eigenstates proposed by Chalker is analytically verified for the critical random matrix ensemble in the limit of strong multifractality controlled by the small parameter $b\ll…

Consider random Schr\"odinger operators $H_n$ defined on $[0,n]\cap\mathbb{Z}$ with zero boundary conditions: $$ (H_n\psi)_\ell=\psi_{\ell-1}+\psi_{\ell+1}+\sigma\frac{\mathfrak{a}(\ell)}{n^{\alpha}}\psi_{\ell},\quad \ell=1,\cdots,n,\quad…

A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erd\H{o}s-R\'enyi random graph model. The proposed model is obtained by…

We present a study of the intermittent properties of a shell model of turbulence with unprecedented statistics, about $\sim 10^7$ eddy turn over time, achieved thanks to an implementation on a large-scale parallel GPU factory. This allows…

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…

Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree $\Delta$. We investigate the relative size of the giant component $S$…

We establish that if a sequence of spaces equipped with resistance metrics and measures converge with respect to the Gromov-Hausdorff-vague topology, and a certain non-explosion condition is satisfied, then the associated stochastic…