-
High-Dimensional Multivariate Linear Regression with Weighted Nuclear Norm Regularization J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-03-13 Namjoon Suh, Li-Hsiang Lin, Xiaoming Huo
We consider a low-rank matrix estimation problem when the data is assumed to be generated from the multivariate linear regression model. To induce the low-rank coefficient matrix, we employ the wei...
-
An exact game-theoretic variable importance index for generalized additive models J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-03-13 Amir Khorrami Chokami, Giovanni Rabitti
Generalized Additive Models (GAMs) are widely used in statistics. In this work, we aim to tackle the challenge of identifying the most influential variables in GAMs. To accomplish this, we introduc...
-
Variational Bayesian Neural Networks via Resolution of Singularities J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-03-14 Susan Wei, Edmund Lau
In this work, we advocate for the importance of singular learning theory (SLT) as it pertains to the theory and practice of variational inference in Bayesian neural networks (BNNs). To begin, we la...
-
Semiparametric Probit Regression Model with General Interval-Censored Failure Time Data J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-03-12 Yi Deng, Shuwei Li, Liuquan Sun, Xinyuan Song
Interval-censored data frequently arise in various biomedical areas involving periodical follow-ups where the failure or event time of interest cannot be observed exactly but is only known to fall ...
-
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs J. Comb. Optim. (IF 1.0) Pub Date : 2024-03-13 Lin Sun, Guanglong Yu, Jianliang Wu
-
Generative Quantile Regression with Variability Penalty J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-03-08 Shijie Wang, Minsuk Shin, Ray Bai
Quantile regression and conditional density estimation can reveal structure that is missed by mean regression, such as multimodality and skewness. In this paper, we introduce a deep learning genera...
-
Birational geometry of generalized Hessenberg varieties and the generalized Shareshian-Wachs conjecture J. Comb. Theory A (IF 1.1) Pub Date : 2024-03-04 Young-Hoon Kiem, Donggun Lee
We introduce generalized Hessenberg varieties and establish basic facts. We show that the Tymoczko action of the symmetric group on the cohomology of Hessenberg varieties extends to generalized Hessenberg varieties and that natural morphisms among them preserve the action. By analyzing natural morphisms and birational maps among generalized Hessenberg varieties, we give an elementary proof of the Shareshian-Wachs
-
Independence-Encouraging Subsampling for Nonparametric Additive Models J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-03-01 Yi Zhang, Lin Wang, Xiaoke Zhang, HaiYing Wang
The additive model is a popular nonparametric regression method due to its ability to retain modeling flexibility while avoiding the curse of dimensionality. The backfitting algorithm is an intuiti...
-
A penalized criterion for selecting the number of clusters for K-medians J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-29 Antoine Godichon-Baggioni, Sobihan Surendran
Clustering is a usual unsupervised machine learning technique for grouping the data points into groups based upon similar features. We focus here on unsupervised clustering for contaminated data, i...
-
A multi-attribute evaluation of genotype-environment experiments using biplots and joint plots graphics J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-29 Jhessica Leticia Kirch, Acácia Mecejana Diniz Souza Spitti, Alisson Fernando Chiorato, Carlos Tadeu dos Santos Dias, César Gonçalves de Lima
In plant breeding studies, some of objectives are to study the interaction between genotype and environment (GEI), evaluating genotypic stability and adaptability. The additive model with multiplic...
-
Turán theorems for even cycles in random hypergraph J. Comb. Theory B (IF 1.4) Pub Date : 2024-03-01 Jiaxi Nie
Let be a family of -uniform hypergraphs. The random Turán number is the maximum number of edges in an -free subgraph of , where is the Erdős-Rényi random -graph with parameter . Let denote the -uniform linear cycle of length . For , Mubayi and Yepremyan showed that . This upper bound is not tight when . In this paper, we close the gap for . More precisely, we show that when . Similar results have recently
-
The second largest eigenvalue of normal Cayley graphs on symmetric groups generated by cycles J. Comb. Theory A (IF 1.1) Pub Date : 2024-03-01 Yuxuan Li, Binzhou Xia, Sanming Zhou
We study the normal Cayley graphs on the symmetric group , where and is the set of all cycles in with length in . We prove that the strictly second largest eigenvalue of can only be achieved by at most four irreducible representations of , and we determine further the multiplicity of this eigenvalue in several special cases. As a corollary, in the case when contains neither nor we know exactly when
-
A short combinatorial proof of dimension identities of Erickson and Hunziker J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-29 Nishu Kumari
In a recent paper (), Erickson and Hunziker consider partitions in which the arm–leg difference is an arbitrary constant . In previous works, these partitions are called -asymmetric partitions. Regarding these partitions and their conjugates as highest weights, they prove an identity yielding an infinite family of dimension equalities between and modules. Their proof proceeds by the manipulations of
-
A Deep Dynamic Latent Block Model for Co-clustering of Zero-Inflated Data Matrices J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-23 Giulia Marchello, Marco Corneli, Charles Bouveyron
The simultaneous clustering of observations and features of data sets (known as co-clustering) has recently emerged as a central machine learning application to summarize massive data sets. However...
-
The Journal of Computational and Graphical Statistics 2023 Associate Editors J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-26
Published in Journal of Computational and Graphical Statistics (Vol. 33, No. 1, 2024)
-
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-26 Yingying Guo, Qiaoliang Li
This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that \(t_{j}\) distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements
-
A linear ordering problem with weighted rank J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-26 Manuel V. C. Vieira
-
Forecasting high-dimensional functional time series: Application to sub-national age-specific mortality J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-20 Cristian F. Jiménez-Varón, Ying Sun, Han Lin Shang
We study the modeling and forecasting of high-dimensional functional time series (HDFTS), which can be cross-sectionally correlated and temporally dependent. We introduce a decomposition of the HDF...
-
On sufficient conditions for Hamiltonicity of graphs, and beyond J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-23 Hechao Liu, Lihua You, Yufei Huang, Zenan Du
Identifying certain conditions that ensure the Hamiltonicity of graphs is highly important and valuable due to the fact that determining whether a graph is Hamiltonian is an NP-complete problem.For a graph G with vertex set V(G) and edge set E(G), the first Zagreb index (\(M_{1}\)) and second Zagreb index (\(M_{2}\)) are defined as \(M_{1}(G)=\sum \limits _{v_{i}v_{j}\in E(G)}(d_{G}(v_{i})+d_{G}(v_{j}))\)
-
On scheduling multiple parallel two-stage flowshops with Johnson’s Rule J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-23 Guangwei Wu, Fu Zuo, Feng Shi, Jianxin Wang
-
EPTAS for parallel identical machine scheduling with time restrictions J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-22 G. Jaykrishnan, Asaf Levin
We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case
-
Hammock plots: visualizing categorical and numerical variables J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-22 Matthias Schonlau
I discuss the hammock plot for visualizing categorical or mixed categorical/numeric data. Hammock plots can be viewed as a generalization of parallel coordinate plots where the lines are replaced b...
-
An interpretable neural network-based non-proportional odds model for ordinal regression J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-22 Akifumi Okuno, Kazuharu Harada
This study proposes an interpretable neural network-based non-proportional odds model (N3POM) for ordinal regression. N3POM is different from conventional approaches to ordinal regression with non-...
-
The maximum number of copies of an even cycle in a planar graph J. Comb. Theory B (IF 1.4) Pub Date : 2024-02-22 Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Casey Tompkins, Xiutao Zhu
-
On the deepest cycle of a random mapping J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-22 Ljuben Mutafchiev, Steven Finch
Let be the set of all mappings . The corresponding graph of is a union of disjoint connected unicyclic components. We assume that each is chosen uniformly at random (i.e., with probability ). The cycle of contained within its largest component is called the one. For any , let denote the length of this cycle. In this paper, we establish the convergence in distribution of and find the limits of its expectation
-
Two conjectures of Andrews, Merca and Yee on truncated theta series J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-22 Shane Chern, Ernest X.W. Xia
In their study of the truncation of Euler's pentagonal number theorem, Andrews and Merca introduced a partition function to count the number of partitions of in which is the least integer that is not a part and there are more parts exceeding than there are below . In recent years, two conjectures concerning on truncated theta series were posed by Andrews, Merca, and Yee. In this paper, we prove that
-
Constructing generalized Heffter arrays via near alternating sign matrices J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-21 L. Mella, T. Traetta
-
How connectivity affects the extremal number of trees J. Comb. Theory B (IF 1.4) Pub Date : 2024-02-19 Suyun Jiang, Hong Liu, Nika Salia
The Erdős-Sós conjecture states that the maximum number of edges in an -vertex graph without a given -vertex tree is at most . Despite significant interest, the conjecture remains unsolved. Recently, Caro, Patkós, and Tuza considered this problem for host graphs that are connected. Settling a problem posed by them, for a -vertex tree , we construct -vertex connected graphs that are -free with at least
-
Functional linear model with prior information of subjects’ network J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-14 Xiaochen Zhang, Qingzhao Zhang, Kuangnan Fang
In many modern applications, data samples are interconnected by a network, and network information is a crucial factor in forecasting. However, existing network data analysis methods, which are des...
-
Structured variational approximations with skew normal decomposable graphical models and implicit copulas J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-14 Robert Salomone, Xuejun Yu, David J. Nott, Robert Kohn
Although there is much recent work developing flexible variational methods for Bayesian computation, Gaussian approximations with structured covariance matrices are often preferred computationally ...
-
Nonparametric Additive Models for Billion Observations J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-15 Mengyu Li, Jingyi Zhang, Cheng Meng
The nonparametric additive model (NAM) is a widely used nonparametric regression method. Nevertheless, due to the high computational burden, classic statistical techniques for fitting NAMs are not ...
-
MFAI: A Scalable Bayesian Matrix Factorization Approach to Leveraging Auxiliary Information J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-14 Zhiwei Wang, Fa Zhang, Cong Zheng, Xianghong Hu, Mingxuan Cai, Can Yang
In various practical situations, matrix factorization methods suffer from poor data quality, such as high data sparsity and low signal-to-noise ratio (SNR). Here, we consider a matrix factorization...
-
Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness* J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-14 Xiaojun Mao, Hengfang Wang, Zhonglei Wang, Shu Yang
Modern surveys with large sample sizes and growing mixed-type questionnaires require robust and scalable analysis methods. In this work, we consider recovering a mixed dataframe matrix, obtained by...
-
On the maximal number of elements pairwise generating the finite alternating group J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-14 Francesco Fumagalli, Martino Garonzi, Pietro Gheri
Let be the alternating group of degree . Let be the maximal size of a subset of such that whenever and and let be the minimal size of a family of proper subgroups of whose union is . We prove that, when varies in the family of composite numbers, tends to 1 as . Moreover, we explicitly calculate for congruent to 3 modulo 18.
-
-
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-12 Reza Naserasr, Weiqiang Yu
-
On convexity in split graphs: complexity of Steiner tree and domination J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-12 A. Mohanapriya, P. Renjith, N. Sadagopan
-
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-12 Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng
-
Statistical inference in circular structural model and fitting circles to noisy data J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-02-12 A. Donner, A. Goldenshluger
It is well known that commonly used algorithms for circle fitting perform poorly when sampling distribution of the points is not symmetric with respect to the circle center, e.g., when the points a...
-
Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-11 Shikha Mehta
-
A Q-polynomial structure for the Attenuated Space poset Aq(N,M) J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-09 Paul Terwilliger
The goal of this article is to display a -polynomial structure for the Attenuated Space poset . The poset is briefly described as follows. Start with an -dimensional vector space over a finite field with elements. Fix an -dimensional subspace of . The vertex set of consists of the subspaces of that have zero intersection with . The partial order on is the inclusion relation. The -polynomial structure
-
Most plane curves over finite fields are not blocking J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-09 Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip
A plane curve of degree is called if every -line in the plane meets at some -point. We prove that the proportion of blocking curves among those of degree is when and . We also show that the same conclusion holds for smooth curves under the somewhat weaker condition and . Moreover, the two events in which a random plane curve is smooth and respectively blocking are shown to be asymptotically independent
-
Spectral characterization of the complete graph removing a cycle J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-09 Muhuo Liu, Xiaofeng Gu, Haiying Shan, Zoran Stanić
A graph is determined by its spectrum if there is not another graph with the same spectrum. Cámara and Haemers proved that the graph , obtained from the complete graph with vertices by deleting all edges of a cycle with vertices, is determined by its spectrum for , but not for . In this paper, we show that is the unique exception for the spectral determination of .
-
The divisor class group of a discrete polymatroid J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-08 Jürgen Herzog, Takayuki Hibi, Somayeh Moradi, Ayesha Asloob Qureshi
In this paper we introduce toric rings of multicomplexes. We show how to compute the divisor class group and the class of the canonical module when the toric ring is normal. In the special case that the multicomplex is a discrete polymatroid, its toric ring is studied deeply for several classes of polymatroids.
-
Large sum-free sets in Z5n J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-02 Vsevolod F. Lev
It is well-known that for a prime and integer , the maximum possible size of a sum-free subset of the elementary abelian group is . However, the matching stability result is known for only. We consider the first open case showing that if is a sum-free subset with , then there are a subgroup of size and an element such that .
-
Block-transitive 2-designs with a chain of imprimitive point-partitions J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-01 Carmen Amarra, Alice Devillers, Cheryl E. Praeger
More than 30 years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive 2-design, with blocks of size , could leave invariant a nontrivial point-partition, but only if the number of points was bounded in terms of . Since then examples have been found where there are two nontrivial point partitions, either forming a chain of partitions, or forming a grid structure on
-
Large monochromatic components in colorings of complete hypergraphs J. Comb. Theory A (IF 1.1) Pub Date : 2024-02-01 Lyuben Lichev, Sammy Luo
Gyárfás famously showed that in every r-coloring of the edges of the complete graph Kn, there is a monochromatic connected component with at least nr−1 vertices. A recent line of study by Conlon, Tyomkyn, and the second author addresses the analogous question about monochromatic connected components with many edges. In this paper, we study a generalization of these questions for k-uniform hypergraphs
-
The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-28 Linqing Gao, Dengzhe Ha, Litao Ma, Jiqiang Chen
-
A branch-and-cut algorithm for the balanced traveling salesman problem J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-28 Thi Quynh Trang Vo, Mourad Baiou, Viet Hung Nguyen
-
Bayesian Hyperbolic Multidimensional Scaling J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-01-26 Bolun Liu, Shane Lubold, Adrian E. Raftery, Tyler H. McCormick
Multidimensional scaling (MDS) is a widely used approach to representing high-dimensional, dependent data. MDS works by assigning each observation a location on a low-dimensional geometric manifold...
-
Renewable Quantile Regression with Heterogeneous Streaming Datasets J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-01-23 Xuerong Chen, Senlin Yuan
The renewable statistical inference has received much attention since the advent of streaming data collection techniques. However, most existing online updating methods are developed based on a hom...
-
Hybrid Parameter Search and Dynamic Model Selection for Mixed-Variable Bayesian Optimization J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-01-23 Hengrui Luo, Younghyun Cho, James W. Demmel, Xiaoye S. Li, Yang Liu
This paper presents a new type of hybrid model for Bayesian optimization (BO) adept at managing mixed variables, encompassing both quantitative (continuous and integer) and qualitative (categorical...
-
The minimum degree removal lemma thresholds J. Comb. Theory B (IF 1.4) Pub Date : 2024-01-26 Lior Gishboliner, Zhihan Jin, Benny Sudakov
The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph H and ε>0, if an n-vertex graph G contains εn2 edge-disjoint copies of H then G contains δnv(H) copies of H for some δ=δ(ε,H)>0. The current proofs of the removal lemma give only very weak bounds on δ(ε,H), and it is also known that δ(ε,H) is not polynomial in ε unless H is bipartite. Recently
-
Communication-Efficient Nonparametric Quantile Regression via Random Features J. Comput. Graph. Stat. (IF 2.4) Pub Date : 2024-01-23 Caixing Wang, Tao Li, Xinyi Zhang, Xingdong Feng, Xin He
This paper introduces a refined algorithm designed for distributed nonparametric quantile regression in a reproducing kernel Hilbert space (RKHS). Unlike existing nonparametric approaches that prim...
-
A solution to the 1-2-3 conjecture J. Comb. Theory B (IF 1.4) Pub Date : 2024-01-26 Ralph Keusch
We show that for every graph without isolated edge, the edges can be assigned weights from {1,2,3} so that no two neighbors receive the same sum of incident edge weights. This solves a conjecture of Karoński, Łuczak, and Thomason from 2004.
-
A study on free roots of Borcherds-Kac-Moody Lie superalgebras J. Comb. Theory A (IF 1.1) Pub Date : 2024-01-25 Shushma Rani, G. Arunkumar
Consider a Borcherds-Kac-Moody Lie superalgebra, denoted as g, associated with the graph G. This Lie superalgebra is constructed from a free Lie superalgebra by introducing three sets of relations on its generators: (1) Chevalley relations, (2) Serre relations, and (3) The commutation relations derived from the graph G. The Chevalley relations lead to a triangular decomposition of g as g=n+⊕h⊕n−, where
-
The core conjecture of Hilton and Zhao J. Comb. Theory B (IF 1.4) Pub Date : 2024-01-25 Yan Cao, Guantao Chen, Guangming Jing, Songling Shan
A simple graph G with maximum degree Δ is overfull if |E(G)|>Δ⌊|V(G)|/2⌋. The core of G, denoted GΔ, is the subgraph of G induced by its vertices of degree Δ. Clearly, the chromatic index of G equals Δ+1 if G is overfull. Conversely, Hilton and Zhao in 1996 conjectured that if G is a simple connected graph with Δ≥3 and Δ(GΔ)≤2, then χ′(G)=Δ+1 implies that G is overfull or G=P⁎, where P⁎ is obtained
-
Further refinements of Wilf-equivalence for patterns of length 4 J. Comb. Theory A (IF 1.1) Pub Date : 2024-01-25 Robin D.P. Zhou, Yongchun Zang, Sherry H.F. Yan
In this paper, we construct a bijection between 3142-avoiding permutations and 3241-avoiding permutations which proves the equidistribution of five classical set-valued statistics. Our bijection also enables us to establish a bijection between 3142-avoiding permutations and 4132-avoiding permutations, and a bijection between 2413-avoiding permutations and 1423-avoiding permutations, both of which preserve
-
New results on orthogonal arrays OA(3,5,4n + 2) J. Comb. Theory A (IF 1.1) Pub Date : 2024-01-24 Dongliang Li, Haitao Cao
An orthogonal array of index unity, order v, degree 5 and strength 3, or an OA(3,5,v) in short, is a 5×v3 array on v symbols and in every 3×v3 subarray, each 3-tuple column vector occurs exactly once. The existence of an OA(3,5,4n+2) is still open except for few known infinite classes of n. In this paper, we introduce a new combinatorial structure called three dimensions orthogonal complete large sets
-
Integrating supplier selection decisions into an inventory location problem for designing the supply chain network J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-24
Abstract This paper proposes a novel Inventory-Location problem that integrates supplier selection decisions to design a three-echelon supply chain network, under a continuous (s,Q) inventory control policy at the warehouses. In this problem, a set of warehouses must be selected within a set of potential locations to serve several customers or demand zones, additionally involving the selection of the