Related papers: Complex martingales and asymptotic enumeration

The quasi-likelihood estimator and the Bayesian type estimator of the volatility parameter are in general asymptotically mixed normal. In case the limit is normal, the asymptotic expansion was derived in Yoshida (1997) as an application of…

The article presents the results of experiments in computation of statistical values related to Young diagrams, including the estimates on maximum and average (by Plancherel distribution) dimension of irreducible representation of symmetric…

We obtain asymptotics of large Hankel determinants whose weight depends on a one-cut regular potential and any number of Fisher-Hartwig singularities. This generalises two results: 1) a result of Berestycki, Webb and Wong [5] for root-type…

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

We suggest an hierarchy of all the results known so far about the connection of the asymptotics of combinatorial or representation theoretic problems with ``beta=2 ensembles'' arising in the random matrix theory. We show that all such…

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irreducible. In both cases, we provide a combinatorial…

Our previous paper applied a lopsided version of the Lov\'asz Local Lemma that allows negative dependency graphs to the space of random injections from an $m$-element set to an $n$-element set. Equivalently, the same story can be told about…

We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…

We study the asymptotic behavior of the least squares estimators of the unknown parameters of bifurcating autoregressive processes. Under very weak assumptions on the driven noise of the process, namely conditional pair-wise independence…

In [8], asymptotic expansion of the martingale with mixed normal limit was provided. The expansion formula is expressed by the adjoint of a random symbol with coefficients described by the Malliavin calculus, differently from the standard…

In many epidemiological contexts, disease occurrences and their rates are naturally modelled by counting processes and their intensities, allowing an analysis based on martingale methods. These methods lend themselves to extensions of…

Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…

We compute the tail asymptotics of the product of a beta random variable and a generalized gamma random variable which are independent and have general parameters. A special case of these asymptotics were proved and used in a recent work of…

We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…