arXiv subjects

Pierpaolo De Blasi

Publications and source records attributed to Pierpaolo De Blasi.

15 recordsLinked to original sources

arXiv2026

Ordering Stochastic Block Models via prior transitivity

In directed networks, nodes may form groups with similar interaction patterns, while these groups may themselves follow an ordered structure. Existing methods typically treat these features separately, either clustering nodes without enforcing a coherent block order, or ranking individual nodes without allowing for structurally equivalent groups. We introduce the Transitive Stochastic Block Model (TSBM), a Bayesian model for directed weighted networks that uses transitivity-inducing priors to infer ordered blocks. The model separates the total volume of interaction between two nodes from the direction of interaction conditional on interaction occurring, so that hierarchy is imposed on directional imbalance rather than interaction frequency. We consider two order-restricted specifications: a flexible weak-stochastic-transitivity version, which excludes cyclic dominance patterns while allowing heterogeneous block-pair strengths, and a Toeplitz strong-stochastic-transitivity version, in which directional advantage increases with rank separation. Posterior inference is performed through a Gibbs sampler using Pólya-Gamma data augmentation. Since ordered block labels are not exchangeable, we introduce an age-ordered partition prior to infer the number of blocks jointly with node allocation. Simulation studies show that order-constrained priors improve prediction and partition recovery, especially in sparse networks. Across six empirical directed networks, the TSBM improves predictive performance in four cases and yields partitions with clearer ordered structure. The results also identify cases, such as nearly deterministic dominance networks or non-transitive citation networks, where imposing ordered blocks can harm prediction. The TSBM therefore provides a probabilistic framework for estimating ordered groups and assessing when a transitive block structure is supported by the data.

stat.ME↗

arXiv2026

Speeding up the ordered allocation sampler

The ordered allocation sampler is a Gibbs sampler designed to explore the posterior distribution in nonparametric mixture models. It encompasses both infinite mixtures and finite mixtures with random number of components, and it has be shown to possess mixing properties that pair well with collapsed, or marginal, samplers that integrate out the mixing distribution. The main advantage is that it adapts to mixing priors that do not enjoy tractable predictive structures needed for the implementation of marginal sampling methods. Thus it is as widely applicable as other conditional samplers while enjoying better algorithmic performances. In this paper we provide a modification of the ordered allocation sampler that enhances its performances in a substantial way while easing its implementation. In addition, exploiting the similarity with marginal samplers, we are able to adapt to the new version of the sampler the split-merge moves of Jain and Neal. Simulation studies confirm these findings.

stat.ME↗

arXiv2025

Bayesian nonparametric community detection in assortative stochastic block models

Structured data in the form of networks are increasingly common in a number of fields, including the social sciences, biology, physics, computer science, and many others. A key task in network analysis is community detection, which typically consists of dividing the nodes into groups such that nodes within a group are strongly connected, while connections between groups are relatively scarce. A generative model well suited for the formation of such communities is the assortative stochastic block model (SBM), which prescribes a higher probability of a connection between nodes belonging to the same block rather than to different blocks. A recent line of work has utilized Bayesian nonparametric methods to recover communities in the SBM by placing a prior distribution on the number of blocks and estimating block assignments via collapsed Gibbs samplers. However, efficiently incorporating the assortativity constraint through the prior remains an open problem. In this work, we address this gap by studying the effect of enforcing assortativity on Bayesian community detection and identifying the scenarios in which it pays dividends in comparison with standard SBM. We illustrate our findings through an extensive simulation study.

stat.ME↗

arXiv2023

Gibbs sampling for mixtures in order of appearance: the ordered allocation sampler

Gibbs sampling methods are standard tools to perform posterior inference for mixture models. These have been broadly classified into two categories: marginal and conditional methods. While conditional samplers are more widely applicable than marginal ones, they may suffer from slow mixing in infinite mixtures, where some form of truncation, either deterministic or random, is required. In mixtures with random number of components, the exploration of parameter spaces of different dimensions can also be challenging. We tackle these issues by expressing the mixture components in the random order of appearance in an exchangeable sequence directed by the mixing distribution. We derive a sampler that is straightforward to implement for mixing distributions with tractable size-biased ordered weights, and that can be readily adapted to mixture models for which marginal samplers are not available. In infinite mixtures, no form of truncation is necessary. As for finite mixtures with random dimension, a simple updating of the number of components is obtained by a blocking argument, thus, easing challenges found in trans-dimensional moves via Metropolis-Hastings steps. Additionally, sampling occurs in the space of ordered partitions with blocks labelled in the least element order, which endows the sampler with good mixing properties. The performance of the proposed algorithm is evaluated in a simulation study.

stat.ME↗

arXiv2021

Posterior asymptotics in Wasserstein metrics on the real line

In this paper, we use the class of Wasserstein metrics to study asymptotic properties of posterior distributions. Our first goal is to provide sufficient conditions for posterior consistency. In addition to the well-known Schwartz's Kullback--Leibler condition on the prior, the true distribution and most probability measures in the support of the prior are required to possess moments up to an order which is determined by the order of the Wasserstein metric. We further investigate convergence rates of the posterior distributions for which we need stronger moment conditions. The required tail conditions are sharp in the sense that the posterior distribution may be inconsistent or contract slowly to the true distribution without these conditions. Our study involves techniques that build on recent advances on Wasserstein convergence of empirical measures. We apply the results to density estimation with a Dirichlet process mixture prior and conduct a simulation study for further illustration.

math.ST↗

arXiv2021

Asymptotic behavior of the number of distinct values in a sample from the geometric stick-breaking process

Discrete random probability measures are a key ingredient of Bayesian nonparametric inferential procedures. A sample generates ties with positive probability and a fundamental object of both theoretical and applied interest is the corresponding random number of distinct values. The growth rate can be determined from the rate of decay of the small frequencies implying that, when the decreasingly ordered frequencies admit a tractable form, the asymptotics of the number of distinct values can be conveniently assessed. We focus on the geometric stick-breaking process and we investigate the effect of the choice of the distribution for the success probability on the asymptotic behavior of the number of distinct values. We show that a whole range of logarithmic behaviors are obtained by appropriately tuning the prior. We also derive a two-term expansion and illustrate its use in a comparison with a larger family of discrete random probability measures having an additional parameter given by the scale of the negative binomial distribution.

math.ST↗

arXiv2020

A reversible allelic partition process and Pitman sampling formula

We introduce a continuous-time Markov chain describing dynamic allelic partitions which extends the branching process construction of the Pitman sampling formula in Pitman (2006) and the birth-and-death process with immigration studied in Karlin and McGregor (1967), in turn related to the celebrated Ewens sampling formula. A biological basis for the scheme is provided in terms of a population of individuals grouped into families, that evolves according to a sequence of births, deaths and immigrations. We investigate the asymptotic behaviour of the chain and show that, as opposed to the birth-and-death process with immigration, this construction maintains in the temporal limit the mutual dependence among the multiplicities. When the death rate exceeds the birth rate, the system is shown to have reversible distribution identified as a mixture of Pitman sampling formulae, with negative binomial mixing distribution on the population size. The population therefore converges to a stationary random configuration, characterised by a finite number of families and individuals.

math.PR↗

arXiv2019

Stochastic approximations to the Pitman-Yor process

In this paper we consider approximations to the popular Pitman-Yor process obtained by truncating the stick-breaking representation. The truncation is determined by a random stopping rule that achieves an almost sure control on the approximation error in total variation distance. We derive the asymptotic distribution of the random truncation point as the approximation error epsilon goes to zero in terms of a polynomially tilted positive stable distribution. The practical usefulness and effectiveness of this theoretical result is demonstrated by devising a sampling algorithm to approximate functionals of the epsilon-version of the Pitman-Yor process.

math.ST↗

arXiv2016

Wright-Fisher construction of the two-parameter Poisson-Dirichlet diffusion

The two-parameter Poisson--Dirichlet diffusion, introduced in 2009 by Petrov, extends the infinitely-many-neutral-alleles diffusion model, related to Kingman's one-parameter Poisson--Dirichlet distribution and to certain Fleming--Viot processes. The additional parameter has been shown to regulate the clustering structure of the population, but is yet to be fully understood in the way it governs the reproductive process. Here we shed some light on these dynamics by formulating a $K$-allele Wright--Fisher model for a population of size $N$, involving a uniform mutation pattern and a specific state-dependent migration mechanism. Suitably scaled, this process converges in distribution to a $K$-dimensional diffusion process as $N\to\infty$. Moreover, the descending order statistics of the $K$-dimensional diffusion converge in distribution to the two-parameter Poisson--Dirichlet diffusion as $K\to\infty$. The choice of the migration mechanism depends on a delicate balance between reinforcement and redistributive effects. The proof of convergence to the infinite-dimensional diffusion is nontrivial because the generators do not converge on a core. Our strategy for overcoming this complication is to prove \textit{a priori} that in the limit there is no "loss of mass", i.e., that, for each limit point of the sequence of finite-dimensional diffusions (after a reordering of components by size), allele frequencies sum to one.

math.PR↗

arXiv2016

Birth-and-death Polya urns and stationary random partitions

We introduce a class of birth-and-death Polya urns, which allow for both sampling and removal of observations governed by an auxiliary inhomogeneous Bernoulli process, and investigate the asymptotic behaviour of the induced allelic partitions. By exploiting some embedded models, we show that the asymptotic regimes exhibit a phase transition from partitions with almost surely infinitely many blocks and independent counts, to stationary partitions with a random number of blocks. The first regime corresponds to limits of Ewens-type partitions and includes a result of Arratia, Barbour and Tavaré (1992) as a special case. We identify the invariant and reversible measure in the second regime, which preserves asymptotically the dependence between counts, and is shown to be a mixture of Ewens sampling formulas, with a tilted Negative Binomial mixing distribution on the sample size.

math.PR↗

arXiv2016

Confidence distributions from likelihoods by median bias correction

By the modified directed likelihood, higher order accurate confidence limits for a scalar parameter are obtained from the likelihood. They are conveniently described in terms of a confidence distribution, that is a sample dependent distribution function on the parameter space. In this paper we explore a different route to accurate confidence limits via tail-symmetric confidence curves, that is curves that describe equal tailed intervals at any level. Instead of modifying the directed likelihood, we consider inversion of the log-likelihood ratio when evaluated at the median of the maximum likelihood estimator. This is shown to provide equal tailed intervals, and thus an exact confidence distribution, to the third-order of approximation in regular one-dimensional models. Median bias correction also provides an alternative approximation to the modified directed likelihood which holds up to the second order in exponential families.

math.ST↗

arXiv2016

Inhomogeneous Wright-Fisher construction of two-parameter Poisson-Dirichlet diffusions

The recently introduced two-parameter Poisson-Dirichlet diffusion extends the infinitely-many-neutral-alleles model, related to Kingman's distribution and to Fleming-Viot processes. The role of the additional parameter has been shown to regulate the clustering structure of the population, but is yet to be fully understood in the way it governs the reproductive process. Here we shed some light on these dynamics by providing a finite-population construction, with finitely-many species, of the two-parameter infinite-dimensional diffusion. The costruction is obtained in terms of Wright-Fisher chains that feature a classical symmetric mutation mechanism and a frequency-dependent immigration, whose inhomogeneity is investigated in detail. The local immigration dynamics are built upon an underlying array of Bernoulli trials and can be described by means of a dartboard experiment and a rank-dependent type distribution. These involve a delicate balance between reinforcement and redistributive effects, among the current species abundances, for the convergence to hold.

math.PR↗

arXiv2015

Posterior asymptotics of nonparametric location-scale mixtures for multivariate density estimation

Density estimation represents one of the most successful applications of Bayesian nonparametrics. In particular, Dirichlet process mixtures of normals are the gold standard for density estimation and their asymptotic properties have been studied extensively, especially in the univariate case. However a gap between practitioners and the current theoretical literature is present. So far, posterior asymptotic results in the multivariate case are available only for location mixtures of Gaussian kernels with independent prior on the common covariance matrix, while in practice as well as from a conceptual point of view a location-scale mixture is often preferable. In this paper we address posterior consistency for such general mixture models by adapting a convergence rate result which combines the usual low-entropy, high-mass sieve approach with a suitable summability condition. Specifically, we establish consistency for Dirichlet process mixtures of Gaussian kernels with various prior specifications on the covariance matrix. Posterior convergence rates are also discussed.

math.ST↗

arXiv2011

Bayesian nonparametric estimation and consistency of mixed multinomial logit choice models

This paper develops nonparametric estimation for discrete choice models based on the mixed multinomial logit (MMNL) model. It has been shown that MMNL models encompass all discrete choice models derived under the assumption of random utility maximization, subject to the identification of an unknown distribution $G$. Noting the mixture model description of the MMNL, we employ a Bayesian nonparametric approach, using nonparametric priors on the unknown mixing distribution $G$, to estimate choice probabilities. We provide an important theoretical support for the use of the proposed methodology by investigating consistency of the posterior distribution for a general nonparametric prior on the mixing distribution. Consistency is defined according to an $L_1$-type distance on the space of choice probabilities and is achieved by extending to a regression model framework a recent approach to strong consistency based on the summability of square roots of prior probabilities. Moving to estimation, slightly different techniques for non-panel and panel data models are discussed. For practical implementation, we describe efficient and relatively easy-to-use blocked Gibbs sampling procedures. These procedures are based on approximations of the random probability measure by classes of finite stick-breaking processes. A simulation study is also performed to investigate the performance of the proposed methods.

math.ST↗

arXiv2009

Asymptotics for posterior hazards

An important issue in survival analysis is the investigation and the modeling of hazard rates. Within a Bayesian nonparametric framework, a natural and popular approach is to model hazard rates as kernel mixtures with respect to a completely random measure. In this paper we provide a comprehensive analysis of the asymptotic behavior of such models. We investigate consistency of the posterior distribution and derive fixed sample size central limit theorems for both linear and quadratic functionals of the posterior hazard rate. The general results are then specialized to various specific kernels and mixing measures yielding consistency under minimal conditions and neat central limit theorems for the distribution of functionals.

math.ST↗