SearcharxivSearch

arXiv subjects

Nurzhan Sapargali

Publications and source records attributed to Nurzhan Sapargali.

3 recordsLinked to original sources

Maximum Likelihood Estimation for Network Models with Latent Geometry under Snowball Sampling

Snowball sampling is a widely used design for collecting network data from large or hard-to-reach populations, yet naive inference that ignores the sampling mechanism produces systematically biased parameter estimates. We derive the exact likelihood of a multi-wave snowball sample for the class of continuous latent space (CLS) models, in which edges form independently conditional on latent vertex-level quantities, and show that conditional edge independence reduces the marginalization over unobserved network configurations to a closed-form expression portable across the entire CLS class. We develop a stochastic Expectation-Maximization algorithm for the Euclidean latent distance model as a concrete implementation, and apply the framework to the large-scale co-inventor network of German semiconductor patent applicants by drawing multiple snowball samples. We find that the naive procedure severely underestimates latent space variance, produces networks with nearly twice the observed edge count, and achieves a spectral goodness-of-fit nine times worse than the corrected model, which directly affects the quantitative interpretation of covariate effects.

stat.ME

Exact Likelihood Inference for Snowball-Sampled Erdős-Rényi Networks

Network data obtained through link-tracing designs, such as snowball sampling, are collected through a mechanism that depends on the very structure the analysis seeks to estimate. Ignoring this dependence and treating the observed sample as though it were itself a complete network can lead to substantially biased inference. While the resulting selection problem is intractable in general, we show that it admits an exact solution for $r$-wave snowball samples, with full-neighbourhood recruitment, drawn from an Erdős--Rényi population. We derive the exact likelihood of such a sample and show that it defines a curved exponential family in the edge probability $π$, with a low-dimensional sufficient statistic. Building on this result, we obtain the maximum likelihood estimator of $π$ that correctly accounts for the sampling design and, as a function of the minimal sufficient statistic, makes full use of the information in the sample. Simulation studies show that this correction substantially reduces bias relative to the naive estimator, remaining effectively unbiased even when the sample covers as little as 0.1\% of the network. We further construct valid confidence intervals for $π$ by inverting a test built on the exact sampling distribution, approximated via Monte Carlo simulation. Simulation studies confirm that these confidence intervals attain the nominal coverage level within Monte Carlo error across a range of edge probabilities and numbers of waves.

stat.ME

The Truncation Blind Spot: How Decoding Strategies Systematically Exclude Human-Like Token Choices

Why does machine-generated text remain detectable? We trace the answer to the decoding stage: standard strategies such as top-$k$ and nucleus sampling restrict generation to high-probability tokens, while human writers routinely choose words that are contextually apt yet rank low under a model's next-token distribution. Truncation therefore renders a measurable share of human word choices unreachable; we call this set the truncation blind spot. Across five open models and three domains, 8--18\% of human-selected tokens fall outside common truncation boundaries, with content words excluded at 2.9 times the rate of function words. As a consequence, simple classifiers using two features separate 1.8 million machine generations from human text at mean AUC-ROC near 0.97, and detectability tracks truncation intensity rather than model scale, architecture, or alignment. Probability-floor samplers substantially narrow the blind spot, and generation experiments confirm the exclusion--detectability link out of sample. Code, data, and the measurement harness are released at https://github.com/EstebanGarces/human_vs_machine.

cs.CL