English
Related papers

Related papers: Concentration in the Generalized Chinese Restauran…

200 papers

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…

Probability · Mathematics 2024-01-30 Vishwaraj Doshi , Jie Hu , Do Young Eun

We show that the domination number of the binomial random graph G_{n,p} with edge-probability p is concentrated on two values for p \ge n^{-2/3+\eps}, and not concentrated on two values for general p \le n^{-2/3}. This refutes a conjecture…

Probability · Mathematics 2024-02-20 Tom Bohman , Lutz Warnke , Emily Zhu

We study generalized circular chord graphs $\mathcal C^{(k)}_n$, formed from a cycle $C_n$ by adding fixed-offset chords of length $k$ and, for even $n$, diameters. Using transfer matrix methods, we derive exact formulas for 3-colorings…

Combinatorics · Mathematics 2025-09-09 Rogelio N. Lopez-Bonilla , Julian Allagan , Shawn M. Langley , Angel J. Clinton

We introduce a random partition model for Bayesian nonparametric regression. The model is based on infinitely-many disjoint regions of the range of a latent covariate-dependent Gaussian process. Given a realization of the process, the…

Methodology · Statistics 2013-01-04 George Karabatsos , Stephen G. Walker

This paper studies the asymptotic behavior of several central objects in Dunkl theory as the dimension of the underlying space grows large. Our starting point is the observation that a recent result from the random matrix theory literature…

Probability · Mathematics 2023-05-24 Jiaoyang Huang , Colin McSwiggen

We study the asymptotic distribution of the two following combinatorial parameters: the number of arc crossings in the linear representation, ${\mathrm cr^{(\ell)}$, and the number of chord crossings in the circular representation,…

Combinatorics · Mathematics 2013-01-29 Anisse Kasraoui

The purpose of this work is to describe a unified, and indeed simple, mechanism for non-parametric Bayesian analysis, construction and generative sampling of a large class of latent feature models which one can describe as generalized…

Statistics Theory · Mathematics 2014-12-23 Lancelot F. James

We introduce a new generalization of relative entropy to non-negative vectors with sums $\gt 1$. We show in a purely combinatorial setting, with no probabilistic considerations, that in the presence of linear constraints defining a convex…

Information Theory · Computer Science 2024-05-08 Kostas N. Oikonomou

Let $G_n= \prod_{k=0}^n \binom{n}{k},$ the product of the elements of the $n$-th row of Pascal's triangle. This paper studies the partial factorizations of $G_n$ given by the product $G(n,x)$ of all prime factors $p$ of $G_n$ having $p \le…

Number Theory · Mathematics 2022-12-26 Lara Du , Jeffrey C. Lagarias

We study the kinetics of competitive random sequential adsorption (RSA) of particles of binary mixture of points and fixed-sized particles within the mean-field approach. The present work is a generalization of the random car parking…

Statistical Mechanics · Physics 2016-08-31 M. K. Hassan , J. Kurths

Response-adaptive randomization has recently attracted a lot of attention in the literature. In this paper, we propose a new and simple family of response-adaptive randomization procedures that attain the Cramer--Rao lower bounds on the…

Statistics Theory · Mathematics 2009-08-25 Feifang Hu , Li-Xin Zhang , Xuming He

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

Probability · Mathematics 2008-02-03 Svante Janson , Donald E. Knuth , Tomasz Łuczak , Boris Pittel

We consider the problem of clustering grouped data with possibly non-exchangeable groups whose dependencies can be characterized by a known directed acyclic graph. To allow the sharing of clusters among the non-exchangeable groups, we…

Gaussian process (GP) regression is a flexible, nonparametric approach to regression that naturally quantifies uncertainty. In many applications, the number of responses and covariates are both large, and a goal is to select covariates that…

Methodology · Statistics 2022-10-12 Jian Cao , Joseph Guinness , Marc G. Genton , Matthias Katzfuss

In this article I proposed a new model to achieve Chinese word segmentation(CWS),which may have the potentiality to apply in other domains in the future.It is a new thinking in CWS compared to previous works,to consider it as a clustering…

Computation and Language · Computer Science 2020-02-19 Yuze Zhao

The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…

Data Structures and Algorithms · Computer Science 2021-11-16 William Kuszmaul , Shyam Narayanan

Kernel ridge regression (KRR) is a popular class of machine learning models that has become an important tool for understanding deep learning. Much of the focus thus far has been on studying the proportional asymptotic regime, $n \asymp d$,…

Machine Learning · Statistics 2025-10-07 Parthe Pandit , Zhichao Wang , Yizhe Zhu

This article concerns the non-asymptotic analysis of the singular values (and Lyapunov exponents) of Gaussian matrix products in the regime where $N,$ the number of term in the product, is large and $n,$ the size of the matrices, may be…

Probability · Mathematics 2021-03-24 Boris Hanin , Grigoris Paouris

We consider the estimation of an i.i.d.\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message…

Information Theory · Computer Science 2012-08-15 Sundeep Rangan

We consider the Generalized Makespan Problem (GMP) on unrelated machines, where we are given $n$ jobs and $m$ machines and each job $j$ has arbitrary processing time $p_{ij}$ on machine $i$. Additionally, there is a general symmetric…

Data Structures and Algorithms · Computer Science 2023-07-27 Nikhil Ayyadevara , Nikhil Bansal , Milind Prabhu
‹ Prev 1 8 9 10 Next ›