Related papers: Asymptotic quantization of exponential random grap…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
We study the asymptotic behaviour of a real-valued diffusion whose non-regular drift is given as a sum of a dissipative term and a bounded measurable one. We prove that two trajectories of that diffusion converge a.s. to one another at an…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
Upper exponential inequalities for the tail probabilities of the centered and normalized number of triangles in the Erd\"{o}s-R\'{e}nyi graph are obtained, where the probability of every edge is fixed. The result is formulated in terms of…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…
We consider a system of parallel straight edge dislocations and we analyse its asymptotic behaviour in the limit of many dislocations. The dislocations are represented by points in a plane, and they are arranged in vertical walls; each wall…
We completely determine the asymptotic depth, equivalently, the asymptotic projective dimension of a chain of edge ideals that is invariant under the action of the monoid Inc of increasing functions on the positive integers. Our results and…
Duplication graphs are graphs that grow by duplication of existing vertices, and are important models of biological networks, including protein-protein interaction networks and gene regulatory networks. Three models of graph growth are…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We investigate the structure of branching asymptotics appearing in solutions to elliptic edge problems. The exponents in powers of the half-axis variable, logarithmic terms, and coefficients depend on the variables on the edge and may be…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graph ${\bf G}(N,p)$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that the non-trivial edge eigenvectors are asymptotically jointly normal.…
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…
We show that the expected gonality of a random graph is asymptotic to the number of vertices.
Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
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 introduce templates for exponential asymptotic expansions that, in contrast to matched asymptotic approaches, enable the simultaneous satisfaction of both boundary values in classes of linear and nonlinear equations that are singularly…