Related papers: Asymptotic quantization of exponential random grap…
We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…
We consider Ising model on edge-dual of uncorrelated random networks with arbitrary degree distribution. These networks have a finite clustering in the thermodynamic limit. High and low temperature expansions of Ising model on the edge-dual…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
We consider the random deposition of objects of variable width and height over a line. The successive additions of these structures create a random interface. We focus on the regime of heavy tailed distributions of the structure width. When…
Due to the unitary evolution, quantum walks display different dynamical features from that of classical random walks. In contrast to this expectation, in this work, we show that extreme events can arise in unitary dynamics and its…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
The output distribution, when rate is above capacity, is investigated. It is shown that there is an asymptotic equipartition property (AEP) of the typical output sequences, independently of the specific codebook used, as long as the…
In this paper, we investigate the asymptotic behaviors of the extreme eigenvectors in a general spiked covariance matrix, where the dimension and sample size increase proportionally. We eliminate the restrictive assumption of the block…
We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…
In this paper non-asymptotic exact exponential estimates are derived (under minimal conditions) for the tail of deviation of the MLE distribution in the so-called natural terms: natural function, natural distance, metric entropy, Banach…
We explore the asymptotic behavior of the centroids of random polygons constructed from regular polygons with vertices on the unit circle by extending the rays so that their lengths form a random permutation of the first (n) integers.…
We study the asymptotic behaviour of sequences of multivariate random variables representing the number of occurrences of a given set of symbols in a word of length $n$ generated at random according to a rational stochastic model. Assuming…
We show, through local estimates and simulation, that if one constrains simple graphs by their densities $\varepsilon$ of edges and $\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\%$ of the possible range…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The…
In this paper, we introduce the notion of infinity branches as well as approaching curves. We present some properties which allow us to obtain an algorithm that compares the behavior of two implicitly defined algebraic plane curves at the…
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…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…