相关论文: Evolution of locally dependent random graphs

We study the k-wise independent relaxation of the usual model G(N,p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probability p, however, it is only required that the distribution of any…

In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…

We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the…

Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a…

We propose two classes of dynamic versions of the classical Erd\H{o}s-R\'enyi graph: one in which the transition rates are governed by an external regime process, and one in which the transition rates are periodically resampled. For both…

In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…

We consider the statistics of extreme eigenvalues of random $d$-regular graphs, with $N^{\mathfrak c}\leq d\leq N^{1/3-{\mathfrak c}}$ for arbitrarily small ${\mathfrak c}>0$. We prove that in this regime, the fluctuations of extreme…

Why do many modern neural-network-based graph generative models fail to reproduce typical real-world network characteristics, such as high triangle density? In this work we study the limitations of edge independent random graph models, in…

For an increasing monotone graph property $\mP$ the \emph{local resilience} of a graph $G$ with respect to $\mP$ is the minimal $r$ for which there exists of a subgraph $H\subseteq G$ with all degrees at most $r$ such that the removal of…

We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…

We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…

We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erd\H{o}s-R\'enyi random graphs and their generalization, inhomogeneous random graphs. We further prove…

We study high-dimensional random geometric graphs (RGGs) of edge-density $p$ with vertices uniformly distributed on the $d$-dimensional torus and edges inserted between sufficiently close vertices with respect to an $L_q$-norm. We focus on…

We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…

In this paper we consider the Erd\H{o}s-R\'enyi random graph in the sparse regime in the limit as the number of vertices $n$ tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two…

In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic…