Related papers: Random Flag Complexes and Asymptotic Syzygies
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…
In this expository article, we give a gentle introduction to the Erd\H{o}s-R\'enyi random graphs and threshold phenomena that they exhibit. We also mildly introduce the Kahn-Kalai Conjecture with several intuitive examples, mainly targeting…
This paper studies large sample properties of a Bayesian approach to inference about slope parameters $\gamma$ in linear regression models with a structural break. In contrast to the conventional approach to inference about $\gamma$ that…
Inspired by the Erd\H{o}s R\'enyi model, we propose a new model for freesquare random monomial ideals generated by edges and covers of a graph. This permit us to investigate the conditions of normality for which we obtain asymptotic…
In the present follow-up article of a previous one [1] we illustrate the use of the Unconventional Statistical Mechanics described and discussed in the latter. This is done via the analysis, resorting to Renyi approach, of experimental…
Maximum entropy models, motivated by applications in neuron science, are natural generalizations of the $\beta$-model to weighted graphs. Similar to the $\beta$-model, each vertex in maximum entropy models is assigned a potential parameter,…
We study statistical properties of the random variables $X_{\sigma}(\pi)$, the number of occurrences of the pattern $\sigma$ in the permutation $\pi$. We present two contrasting approaches to this problem: traditional probability theory and…
Frequentist-style large-sample properties of Bayesian posterior distributions, such as consistency and convergence rates, are important considerations in nonparametric problems. In this paper we give an analysis of Bayesian asymptotics…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
The martingale posterior framework is a generalization of Bayesian inference where one elicits a sequence of one-step ahead predictive densities instead of the likelihood and prior. Posterior sampling then involves the imputation of unseen…
This paper provides a selective review of the statistical network analysis literature focused on clustering and inference problems for stochastic blockmodels and their variants. We survey asymptotic normality results for stochastic…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
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 structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic pattern occurrence statistics and use them in conjunction with the…
A sum of observations derived by a simple random sampling design from a population of independent random variables is studied. A procedure finding a general term of Edgeworth asymptotic expansion is presented. The Lindeberg condition of…
We study averages of multiplicative eigenvalue statistics in ensembles of orthogonal Haar distributed matrices, which can alternatively be written as Toeplitz+Hankel determinants. We obtain new asymptotics for symbols with Fisher-Hartwig…
We recall the directed graph of _juggling states_, closed walks within which give juggling patterns, as studied by Ron Graham in [w/Chung, w/Butler]. Various random walks in this graph have been studied before by several authors, and their…