One compelling use of citation networks is to characterize papers by their relationships to the surrounding literature. We propose a method to characterize papers by embedding them into two distinc...

Count data with complex features arise in many disciplines, including ecology, agriculture, criminology, medicine, and public health. Zero inflation, spatial dependence, and non-equidispersion are ...

Model degrees of freedom ( df ) is a fundamental concept in statistics because it quantifies the flexibility of a fitting procedure and is indispensable in model selection. To investigate the gap b...

Multistate Markov models are a canonical parametric approach for data modeling of observed or latent stochastic processes supported on a finite state space. Continuous-time Markov processes describ...

Obtaining probabilistic models is of high relevance in many recent applications. However, estimation of such distributional models with very large datasets remains a difficult task. In particular, ...

This paper proposes a new association statistic for determining whether random variables are statistically independent. The proposed association statistic can also be used to examine the strength o...

The multinomial probit (MNP) (Imai and van Dyk, 2005) framework is based on a multivariate Gaussian latent structure, allowing for natural extensions to multilevel modeling. Unlike multinomial logi...

Posterior computation in hierarchical Dirichlet process (HDP) mixture models is an active area of research in nonparametric Bayes inference of grouped data. Existing literature almost exclusively f...

Let and denote the permutation statistics -descent number and -excedance number, respectively. We prove that the pairs of permutation statistics and are equidistributed, where denotes the -major index defined by Don Rawlings and denotes the -Denert's statistic defined by Guo-Niu Han. When , this result reduces to the equidistribution of and , which was conjectured by Denert in 1990 and proved that

The -Onsager algebra, denoted , is defined by two generators and two relations called the -Dolan-Grady relations. Recently, Terwilliger introduced some elements of , said to be alternating. These elements are denoted

We construct an infinite family of hyperovals on the Klein quadric , even. The construction makes use of ovoids of the symplectic generalized quadrangle that is associated with an elliptic quadric which arises as solid intersection with . We also solve the isomorphism problem: we determine necessary and sufficient conditions for two hyperovals arising from the construction to be isomorphic.

Ferrers diagram rank-metric codes were introduced by Etzion and Silberstein in 2009. In their work, they proposed a conjecture on the largest dimension of a space of matrices over a finite field whose nonzero elements are supported on a given Ferrers diagram and all have rank lower bounded by a fixed positive integer . Since stated, the Etzion-Silberstein conjecture has been verified in a number of

This work introduces a novel and efficient Bayesian federated learning algorithm, namely, the Federated Averaging stochastic Hamiltonian Monte Carlo (FA-HMC), for parameter estimation and uncertain...

Approximate Bayesian computation (ABC) is a class of Bayesian inference algorithms that targets problems with intractable or unavailable likelihood functions. It uses synthetic data drawn from the ...

A is a set of positions in a word such that each distinct factor has an occurrence crossing a position from the set. This definition comes from the data compression field, where the size of a smallest string attractor represents a lower bound for the output size of a large family of string compressors exploiting repetitions in words, including BWT-based and LZ-based compressors. For finite words, the

Göring–Helmberg–Wappler introduced optimization problems regarding embeddings of a graph into a Euclidean space and the first nonzero eigenvalue of the Laplacian of a graph, which are dual to each other in the framework of semidefinite programming. In this paper, we introduce a new graph-embedding optimization problem, and discuss its relation to Göring–Helmberg–Wappler’s problems. We also identify

Posterior predictive p-values (ppps) have become popular tools for Bayesian model assessment, being general-purpose and easy to use. However, interpretation can be difficult because their distribut...

In this paper, we propose combining the stochastic blockmodel and the smooth graphon model, two of the most prominent modeling approaches in statistical network analysis. Stochastic blockmodels are...

Indexes are useful for summarizing multivariate information into single metrics for monitoring, communicating, and decision-making. While most work has focused on defining new indexes for specific ...

The starting point for much of multivariate analysis (MVA) is an n × p data matrix whose n rows represent observations and whose p columns represent variables. Some multivariate data sets, however,...

Computer models play a crucial role in numerous scientific and engineering domains. To ensure the accuracy of simulations, it is essential to properly calibrate the input parameters of these models...

Cluster exchange groupoids are introduced by King-Qiu as an enhancement of cluster exchange graphs to study stability conditions and quadratic differentials. In this paper, we introduce the cluster exchange groupoid for any finite Coxeter-Dynkin diagram Δ and show that its fundamental group is isomorphic to the corresponding braid group associated with Δ.

In many phenomena, data are collected on a large scale and at different frequencies. In this context, functional data analysis (FDA) has become an important statistical methodology for analyzing an...

In this paper, we present a study on , which are polygons created by connecting unit squares along their edges. Specifically, we focus on a related concept called a , which is a path on a lattice in traced along the boundaries of a column convex polyomino where the lower edge is on the -axis. To explore new variations of bargraphs, we introduce the notion of , which incorporate an additional restriction

In this paper, we refine a result of Andrews and Merca on truncated pentagonal number series. Subsequently, we establish some positivity results involving Andrews–Gordon–Bressoud identities and -regular partitions. In particular, we prove several conjectures of Merca and Krattenthaler–Merca–Radu on truncated pentagonal number series.

A nonparametric approach for analyzing eigensystems of image data over a complex domain is novelly developed. The proposed estimators, which are based on bivariate splines, have both oracle efficie...

Nonparametric two-sample testing is a classical problem in inferential statistics. While modern two-sample tests, such as the edge count test and its variants, can handle multivariate and non-Eucli...

Dynamic prediction of survival data in the presence of time-varying covariates is an area of active research. Two common analytic approaches for this type of data are joint modeling of the longitud...

The primary choice to summarize a finite collection of random objects is by using measures of central tendency, such as mean and median. In the field of optimal transport, the Wasserstein barycente...

It is well known that Bridge regression Knight et al. (2000) enjoys superior theoretical properties when compared to traditional LASSO. However, the current latent variable representation of its Ba...

Let G be a k-uniform hypergraph with vertex set [n] and edge set E(G), where \(k\ge 2\). For \(i\in [n]\), \(d_i\) denotes the degree of vertex i in G. The ABC spectral radius of G is $$\begin{aligned} \max \left\{ k\sum _{e\in E(G)}\root k \of {\dfrac{\sum _{i\in e}d_{i} -k}{\prod _{i\in e}d_{i}}}\prod _{i\in e}x_i: \textbf{x}\in {\mathbb {R}}_+^n, \sum _{i=1}^nx_i^k=1\right\} . \end{aligned}$$ We

We present a novel procedure to diagnose model misspecification in situations where inference is performed using approximate Bayesian computation (ABC). Unlike previous procedures, our proposal is ...

The difference graph of a finite group is the difference of the enhanced power graph of and the power graph of , where all isolated vertices are removed. In this paper we study the connectedness and perfectness of with respect to various properties of the underlying group . We also find several connections between the difference graph of and the Gruenberg-Kegel graph of . We also examine the operation

In this note we show that a flag-transitive automorphism group of a non-trivial 2- design with is not of product action type. In conclusion, is a primitive group of affine or almost simple type.

We propose a distribution-free distance-based method for high dimensional change points that can address challenging situations when the sample size is very small compared to the dimension as in th...

Principal variables analysis (PVA) is a technique for selecting a subset of variables that capture as much of the information in a dataset as possible. Existing approaches for PVA are based on the ...

Censored quantile regression has emerged as a prominent alternative to classical Cox’s proportional hazards model or accelerated failure time model in both theoretical and applied statistics. While...

Markov chain Monte Carlo (MCMC) allows one to generate dependent replicates from a posterior distribution for effectively any Bayesian hierarchical model. However, MCMC can produce a significant co...

Functional mixed models are widely useful for regression analysis with dependent functional data, including longitudinal functional data with scalar predictors. However, existing algorithms for Bay...