English
Related papers

Related papers: On $k$-clusters of high-intensity random geometric…

200 papers

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

Combinatorics · Mathematics 2013-09-04 Nikolaos Fountoulakis , Ross J. Kang , Colin McDiarmid

Diffusion models, which convert noise into new data instances by learning to reverse a diffusion process, have become a cornerstone in contemporary generative modeling. In this work, we develop non-asymptotic convergence theory for a…

Machine Learning · Computer Science 2024-08-06 Gen Li , Yuting Wei , Yuejie Chi , Yuxin Chen

We prove that the local eigenvalue statistics for $d=1$ random band matrices with fixed bandwidth and, for example, Gaussian entries, is given by a Poisson point process and we identify the intensity of the process. The proof relies on an…

Mathematical Physics · Physics 2020-09-01 Benjamin Brodie , Peter D. Hislop

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

Probability · Mathematics 2024-05-31 Sergey G. Bobkov , Maria A. Danshina , Vladimir V. Ulyanov

We consider a conditionally Poissonian random graph model where the mean degrees, `capacities', follow a power-tailed distribution with finite mean and infinite variance. Such a graph of size $N$ has a giant component which is super-small…

Probability · Mathematics 2008-01-08 I. Norros , H. Reittu

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…

Probability · Mathematics 2019-02-01 Svante Janson

We propose a new class of models for variable clustering called Asymptotic Independent block (AI-block) models, which defines population-level clusters based on the independence of the maxima of a multivariate stationary mixing random…

Statistics Theory · Mathematics 2024-07-08 Alexis Boulin , Elena Di Bernardino , Thomas Laloë , Gwladys Toulemonde

We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…

Combinatorics · Mathematics 2017-09-07 Colin McDiarmid , Nikola Yolov

We study expectation values of matrix elements for boundary values of the resolvent as well as the density of states for a random Schr\"odinger operator with potential distributed according to a Poisson process. Asymptotic expansions for…

Mathematical Physics · Physics 2022-08-23 David Hasler , Jannis Koberstein

We present a fast method for generating random samples according to a variable density Poisson-disc distribution. A minimum threshold distance is used to create a background grid array for keeping track of those points that might affect any…

Image and Video Processing · Electrical Eng. & Systems 2021-06-17 Nicholas Dwork , Corey A. Baron , Ethan M. I. Johnson , Daniel O'Connor , John M. Pauly , Peder E. Z. Larson

The empirical measure of an interacting particle system is a purely atomic random probability measure. In the limit as the number of particles grows to infinity, we show for McKean-Vlasov systems with common noise that this measure becomes…

Probability · Mathematics 2025-09-01 Robert Alexander Crowell

We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…

Probability · Mathematics 2019-03-25 Ágnes Backhausz , Bence Rozner

We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…

Probability · Mathematics 2019-07-04 Sourav Chatterjee , Matan Harel

We study the statistics of level spacing of geometric resonances in the disordered binary networks. For a definite concentration $p$ within the interval $[0.2,0.7]$, numerical calculations indicate that the unfolded level spacing…

Soft Condensed Matter · Physics 2007-05-23 Y. Gu , K. W. Yu , Z. R. Yang

We prove that the Poisson-Boolean percolation on $\mathbb{R}^d$ undergoes a sharp phase transition in any dimension under the assumption that the radius distribution has a $5d-3$ finite moment (in particular we do not assume that the…

Probability · Mathematics 2018-11-06 Hugo Duminil-Copin , Aran Raoufi , Vincent Tassion

In condensed-matter, level statistics has long been used to characterize the phases of a disordered system. We provide evidence within the context of a simple model that in a disordered large-N gauge theory with a gravity dual, there exist…

High Energy Physics - Theory · Physics 2012-06-12 Omid Saremi

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

Consider a measure $\mu_\lambda = \sum_x \xi_x \delta_x$ where the sum is over points $x$ of a Poisson point process of intensity $\lambda$ on a bounded region in $d$-space, and $\xi_x$ is a functional determined by the Poisson points near…

Probability · Mathematics 2013-02-05 Mathew D. Penrose , Andrew R. Wade

Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…

Probability · Mathematics 2024-07-18 Mathew D. Penrose , Xiaochuan Yang

We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson…

Probability · Mathematics 2020-03-03 Lorenzo Federico