Related papers: Complex martingales and asymptotic enumeration
We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…
In this paper we study the asymptotic of multiplicities of irreducible representations in large tensor products of finite dimensional representations of simple Lie algebras and their statistics with respect to Plancherel and character…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov processes, established under simple conditions on the Laplace…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…
We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
We study expectations of powers and correlation functions for characteristic polynomials of $N \times N$ non-Hermitian random matrices. For the $1$-point and $2$-point correlation function, we obtain several characterizations in terms of…
We establish the asymptotic normality of the regression estimator in a fixed-design setting when the errors are given by a field of dependent random variables. The result applies to martingale-difference or strongly mixing random fields. On…