Related papers: Graph search via star sampling with and without re…
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors of a similarity matrix. It often outperforms traditional clustering algorithms such as $k$-means when the structure of the individual…
We develop lagged Metropolis-Hastings walk for sampling from simple undirected graphs according to given stationary sampling probabilities. We explain how to apply the technique together with designed graphs for sampling of units-in-space.…
The Hertzsprung-Russell diagram is an essential diagnostic diagram for stellar structure and evolution, which has now been in use for more than 100 years. Our spectroscopic Hertzsprung-Russell (sHR) diagram shows the inverse of the…
(Abridged) We describe a new method to extract spectra of stars from observations of crowded stellar fields with integral field spectroscopy (IFS). Our approach extends the well-established concept of crowded field photometry in images into…
Sampling is a widely used graph reduction technique to accelerate graph computations and simplify graph visualizations. By comprehensively analyzing the literature on graph sampling, we assume that existing algorithms cannot effectively…
For high volume data streams and large data warehouses, sampling is used for efficient approximate answers to aggregate queries over selected subsets. Mathematically, we are dealing with a set of weighted items and want to support queries…
Extragalactic surveys provide significant statistical data for the study of crucial galaxy parameters used to constrain galaxy evolution, e.g. stellar mass (M$_*$) and star formation rate (SFR), under different environmental conditions.…
Soft random sampling (SRS) is a simple yet effective approach for efficient training of large-scale deep neural networks when dealing with massive data. SRS selects a subset uniformly at random with replacement from the full data set in…
Sequential change-point detection for graphs is a fundamental problem for streaming network data types and has wide applications in social networks and power systems. Given fixed vertices and a sequence of random graphs, the objective is to…
Extremely metal-poor (EMP) stars ([Fe/H] < -3.0 dex) provide a unique window into understanding the first generation of stars and early chemical enrichment of the Universe. EMP stars are exceptionally rare, however, and the relatively small…
Sun-like stars are a new probe of variations in the fine-structure constant, $\alpha$, via the solar twins approach: velocity separations of close pairs of absorption lines are compared between stars with very similar stellar parameters,…
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destination, has been argued to…
The sampling method has been paid much attention in the field of complex network in general and statistical physics in particular. This paper presents two new sampling methods based on the perspective that a small part of vertices with high…
Exploring small connected and induced subgraph patterns (CIS patterns, or graphlets) has recently attracted considerable attention. Despite recent efforts on computing the number of instances a specific graphlet appears in a large graph…
Massive sizes of real-world graphs, such as social networks and web graph, impose serious challenges to process and perform analytics on them. These issues can be resolved by working on a small summary of the graph instead . A summary is a…
This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components used in the cover. This problem, motivated by a symmetric…
We introduce Tiered Sampling, a novel technique for approximate counting sparse motifs in massive graphs whose edges are observed in a stream. Our technique requires only a single pass on the data and uses a memory of fixed size $M$, which…
The study of sampling signals on graphs, with the goal of building an analog of sampling for standard signals in the time and spatial domains, has attracted considerable attention recently. Beyond adding to the growing theory on graph…
Nested sampling (NS) is an invaluable tool in data analysis in modern astrophysics, cosmology, gravitational wave astronomy and particle physics. We identify a previously unused property of NS related to order statistics: the insertion…
We are carrying out a search for planets around a sample of solar twin stars using the HARPS spectrograph. The goal of this project is to exploit the advantage offered by solar twins to obtain chemical abundances of unmatched precision.…