相关论文: The chromatic symmetric function in the star-basis

We generalize the tree doubling and Christofides algorithm, the two most common approximations for TSP, to parameterized approximations for ATSP. The parameters we consider for the respective parameterizations are upper bounded by the…

Spatially Coherent Random Forest (SCRF) extends Random Forest to create spatially coherent labeling. Each split function in SCRF is evaluated based on a traditional information gain measure that is regularized by a spatial coherency term.…

Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…

Accurate modelling of redshift-space distortions (RSD) is challenging in the non-linear regime for two-point statistics e.g. the two-point correlation function (2PCF). We take a different perspective to split the galaxy density field…

This article is concerned with the numerical solution of subspace optimization problems, consisting of minimizing a smooth functional over the set of orthogonal projectors of fixed rank. Such problems are encountered in particular in…

In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the…

For a graph G = (V,E) where each vertex is coloured by one of k colours, consider a subset C of V such that for each vertex v in V\C, its set of nearest neighbours in C contains at least one vertex of the same colour as v. Such a C is…

Strong spatial mixing (SSM) is a form of correlation decay that has played an essential role in the design of approximate counting algorithms for spin systems. A notable example is the algorithm of Weitz (2006) for the hard-core model on…

The control of systematic effects when measuring galaxy shapes is one of the main challenges for cosmic shear analyses. In this context, we study the fundamental limitations on shear accuracy due to the measurement of the Point Spread…

The main result of this paper is the introduction of marked graphs and the marked graph polynomials ($M$-polynomial) associated with them. These polynomials can be defined via a deletion-contraction operation. These polynomials are a…

A well-known result of Stanley's shows that given a graph $G$ with chromatic symmetric function expanded into the basis of elementary symmetric functions as $X_G = \sum c_{\lambda}e_{\lambda}$, the sum of the coefficients $c_{\lambda}$ for…

We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…

We study the star/galaxy classification efficiency of 13 different decision tree algorithms applied to photometric objects in the Sloan Digital Sky Survey Data Release Seven (SDSS DR7). Each algorithm is defined by a set of parameters…

A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of a graph $G$, is the smallest integer $k$ for which…

In this paper, we propose a new random forest algorithm that constructs the trees using a novel adaptive split-balancing method. Rather than relying on the widely-used random feature selection, we propose a permutation-based balanced…

This paper deals with the so-called Stanley conjecture, which asks whether they are non-isomorphic trees with the same symmetric function generalization of the chromatic polynomial. By establishing a correspondence between caterpillars…

Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subclasses of trees, we prove the conjecture's validity for a new…

The recently introduced graph parameter tree-cut width plays a similar role with respect to immersions as the graph parameter treewidth plays with respect to minors. In this paper, we provide the first algorithmic applications of tree-cut…

Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for…

In this paper, we attempt to explore the landscape of two-dimensional conformal field theories (2d CFTs) by efficiently searching for numerical solutions to the modular bootstrap equation using machine-learning-style optimization. The torus…