相关论文: Asymptotic equivalence and contiguity of some rand…
We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…
We establish the asymptotic degree distribution of the typical vertex of inhomogeneous and passive random intersection graphs under the minimal moment conditions.
We show that the expected gonality of a random graph is asymptotic to the number of vertices.
We show that graph-theoretic thickness and geometric thickness are not asymptotically equivalent: for every t, there exists a graph with thickness three and geometric thickness >= t.
Benjamini, Shinkar, and Tsur stated the following conjecture on the acquaintance time: asymptotically almost surely $AC(G) \le p^{-1} \log^{O(1)} n$ for a random graph $G \in G(n,p)$, provided that $G$ is connected. Recently, Kinnersley,…
In this paper, we investigate the exact asymptotic behavior of the connectivity probability in the Erdos-Renyi graph G(n,p), under different asymptotic assumptions on the edge probability p=p(n). We propose a novel approach based on the…
The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
Several methods are available in the literature to stochastically compare random variables and random vectors. We introduce the notion of asymptotic stochastic order for random processes and define four such orders. Various properties and…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
Coarse graph theory concerns finding 'coarse' analogues of graph theory theorems, replacing disjointness with being far apart. One of the most interesting open questions is to find a coarse analogue of Menger's theorem, which characterizes…
It is proved that nonparametric autoregression is asymptotically equivalent in the sense of Le Cam's deficiency distance to nonparametric regression with random design as well as with regular nonrandom design.
There seems to be a common prejudice that asymptotic safety is either incompatible with, or at best unrelated to, the other topics in the title. This is not the case. In fact, we show that 1) the existence of a fixed point with suitable…
Random intersection graphs have received much attention recently and been used in a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. For these graphs, each node is equipped…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
We consider the asymptotic properties of Approximate Bayesian Computation (ABC) for the realistic case of summary statistics with heterogeneous rates of convergence. We allow some statistics to converge faster than the ABC tolerance, other…