Related papers: Asymptotic probability for connectedness

The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

We derive an asymptotic expansion for the distribution of a compound sum of independent random variables, all having the same light-tailed subexponential distribution. The examples of a Poisson and geometric number of summands serve as an…

In this paper we investigate the asymptotic growth of the number of irreducible and connected components of the moduli space of surfaces of general type corresponding to certain families of surfaces isogenous to a higher product with group…

We give a general procedure for gluing together possibly noncompact manifolds of constant scalar curvature which satisfy an extra nondegeneracy hypothesis. Our aim is to provide a simple paradigm for making `analytic' connected sums. In…

In this paper, we use geometric tools to study the structure of asymptotic expanders and show that a sequence of asymptotic expanders always admits a "uniform exhaustion by expanders". It follows that asymptotic expanders cannot be coarsely…

In this paper we investigate the asymptotic growth of the number of irreducible and connected components of the moduli space of surfaces of general type corresponding to certain families of surfaces isogenous to a higher product. We obtain…

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…

This is an extended version of the thesis presented to the Programa de P\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica, PUC-Rio, in September 2013, incorporating some suggestions from the examining commission.…

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

Asymptotic expansions are derived for the tail distribution of the product of two correlated normal random variables with non-zero means and arbitrary variances, and more generally the sum of independent copies of such random variables.…

We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…

In this paper, we study properties of asymptotic resemblance relations induced by compatible coarse structures on groups. We generalize the notion of asymptotic dimensiongrad for groups with compatible coarse structures and show this notion…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

Diagonalizability plays an important role in the analysis and design of multivariable systems. A structured matrix is called structurally diagonalizable if almost all of its numerical realizations, obtained by assigning real values to its…