English
Related papers

Related papers: Graph search via star sampling with and without re…

200 papers

The next generation of proposed galaxy surveys will increase the number of galaxies with photometric redshifts by two orders of magnitude, drastically expanding both redshift range and detection threshold from the current state of the art.…

Cosmology and Nongalactic Astrophysics · Physics 2011-02-11 A. E. Schulz

We present proper motion measurements for more than $0.55$ million main-sequence stars, by comparing astrometric positions of matched stars between the multi-band imaging datasets from the Hyper Suprime-Cam (HSC) Survey and the SDSS Stripe…

Model fitting is frequently used to determine the shape of galaxies and the point spread function, for examples, in weak lensing analyses or morphology studies aiming at probing the evolution of galaxies. However, the number of parameters…

Cosmology and Nongalactic Astrophysics · Physics 2012-10-03 Guoliang Li , Bo Xin , Wei Cui

Context. The homogenization of the stellar parameters is an important goal for large observational spectroscopic surveys, but it is very difficult to achieve it because of the diversity of the spectroscopic analysis methods used within a…

The spectral energy distribution (SED) of observed stars in wide-field images is crucial for chromatic point spread function (PSF) modelling methods, which use unresolved stars as integrated spectral samples of the PSF across the field of…

Instrumentation and Methods for Astrophysics · Physics 2025-02-19 Ezequiel Centofanti , Samuel Farrens , Jean-Luc Starck , Tobias Liaudat , Alex Szapiro , Jennifer Pollack

While uniform sampling has been widely studied in the matrix completion literature, CUR sampling approximates a low-rank matrix via row and column samples. Unfortunately, both sampling models lack flexibility for various circumstances in…

Machine Learning · Computer Science 2025-04-17 HanQin Cai , Longxiu Huang , Pengyu Li , Deanna Needell

There has been an increased interest in applying machine learning techniques on relational structured-data based on an observed graph. Often, this graph is not fully representative of the true relationship amongst nodes. In these settings,…

Machine Learning · Statistics 2022-08-05 Florence Regol , Soumyasundar Pal , Jianing Sun , Yingxue Zhang , Yanhui Geng , Mark Coates

The number of triangles in a graph is useful to deduce a plethora of important features of the network that the graph is modeling. However, finding the exact value of this number is computationally expensive. Hence, a number of…

Data Structures and Algorithms · Computer Science 2017-10-30 Duru Türkoğlu , Ata Turk

This article explores and analyzes the unsupervised clustering of large partially observed graphs. We propose a scalable and provable randomized framework for clustering graphs generated from the stochastic block model. The clustering is…

Social and Information Networks · Computer Science 2022-12-06 Mostafa Rahmani , Andre Beckus , Adel Karimian , George Atia

Aims: Stellar activity may complicate the analysis of high-precision radial-velocity spectroscopic data when looking for exoplanets signatures. We aim at quantifying the impact of stellar spots on stars with various spectral types and…

Astrophysics · Physics 2009-11-13 Morgan Desort , Anne-Marie Lagrange , Franck Galland , Stephane Udry , Michel Mayor

Sparse exchangeable graphs on $\mathbb{R}_+$, and the associated graphex framework for sparse graphs, generalize exchangeable graphs on $\mathbb{N}$, and the associated graphon framework for dense graphs. We develop the graphex framework as…

Statistics Theory · Mathematics 2016-11-04 Victor Veitch , Daniel M. Roy

A new method for selecting stars in the Galactic bar based on 2MASS infrared photometry in combination with stellar proper motions from the Kharkiv XPM catalogue has been implemented. In accordance with this method, red clump and red giant…

Astrophysics of Galaxies · Physics 2014-02-14 V. V. Bobylev , A. V. Mosenkov , A. T. Bajkova , G. A. Gontcharov

The graph matching problem emerges naturally in various applications such as web privacy, image processing and computational biology. In this paper, graph matching is considered under a stochastic model, where a pair of randomly generated…

Information Theory · Computer Science 2021-01-27 Farhad Shirani , Siddharth Garg , Elza Erkip

The ACS Survey of Globular Clusters has used HST's Wide-Field Channel to obtain uniform imaging of 65 of the nearest globular clusters to provide an extensive homogeneous dataset for a broad range of scientific investigations. The survey…

This paper introduces new efficient algorithms for two problems: sampling conditional on vertex degrees in unweighted graphs, and sampling conditional on vertex strengths in weighted graphs. The algorithms can sample conditional on the…

Methodology · Statistics 2018-09-19 James Scott , Axel Gandy

Subgraph counting is a fundamental problem in understanding and analyzing graph structured data, yet computationally challenging. This calls for an accurate and efficient algorithm for Subgraph Cardinality Estimation, which is to estimate…

Databases · Computer Science 2024-04-16 Wonseok Shin , Siwoo Song , Kunsoo Park , Wook-Shin Han

A parametric cluster model is a statistical model providing geometric insights onto the points defining a cluster. The {\em spherical cluster model} (SC) approximates a finite point set $P\subset \mathbb{R}^d$ by a sphere $S(c,r)$ as…

Methodology · Statistics 2025-12-29 Frédéric Cazals , Antoine Commaret , Louis Goldenberg

The Spitzer-SDSS-GALEX Spectroscopic Survey (SSGSS) provides a new sample of 101 star-forming galaxies at z < 0.2 with unprecedented multi-wavelength coverage. New mid- to far-infrared spectroscopy from the Spitzer Space Telescope is added…

This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a graph is sampled from a specific probability distribution and…

Data Structures and Algorithms · Computer Science 2020-05-19 Eleni C. Akrida , Argyrios Deligkas , George B. Mertzios , Paul G. Spirakis , Viktor Zamaraev

We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (V, E), its cycle space is the family of all subsets of E that have even degree at each vertex. We prove that with high probability, sampling the…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-07-22 David Pritchard , Ramakrishna Thurimella