اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Cluster AgeS Experiment (CASE). Detecting Photometric Variability with the Friends of Friends Algorithm
128
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We adapt the friends of friends algorithm to the analysis of light curves, and show that it can be successfully applied to searches for transient phenomena in large photometric databases. As a test case we search OGLE-III light curves for known dwarf novae. A single combination of control parameters allows to narrow the search to 1% of the data while reaching a $sim$90% detection efficiency. A search involving $sim$2% of the data and three combinations of control parameters can be significantly more effective - in our case a 100% efficiency is reached. The method can also quite efficiently detect semi-regular or strictly periodic variability. We report 28 new variables found in the field of the globular cluster M22, which was examined earlier with the help of periodicity-searching algorithms
قيم البحث
اقرأ أيضاً
We report time-series photometry for 55 variable stars located in the central part of the globular cluster M55. The sample includes 28 newly identified objects of which 13 are eclipsing binaries. Three of these are detached systems located in the tur
n-off region on the cluster color-magnitude diagram. Two of them are proper motion (PM) members of M55 and are excellent candidates for a detailed follow-up study aimed at a determination of the cluster age and distance. Other detached binaries are located along the unevolved part of the cluster main sequence. Most of the variables are cluster blue straggler stars. This group includes 35 SX Phe stars, two contact binaries, and one semi-detached binary. V60 is a low mass, short period algol with the less massive and cooler component filling its Roche lobe. The more massive component is an SX Phe variable. The orbital period of V60 increases at a rate of dP/P=3.0E-9. In addition to numerous variable blue stragglers we also report the detection of two red stragglers showing periodic variability. Both of these are PM members of M55. We note and discuss the observed paucity of contact binaries among unevolved main sequence stars in M55 and NGC 6752. This apparent paucity supports an evolution model in which the formation of contact binaries is triggered by stellar evolution at the main-sequence turn off.
We present a catalogue of galaxy groups and clusters selected using a friends-of-friends algorithm with a dynamic linking length from the 2dF-SDSS and QSO (2SLAQ) luminous red galaxy survey. The linking parameters for the code are chosen through an a
nalysis of simulated 2SLAQ haloes. The resulting catalogue includes 313 clusters containing 1,152 galaxies. The galaxy groups and clusters have an average velocity dispersion of sigma_v = 467.97 km/s and an average size of R_clt = 0.78 Mpc/h. Galaxies from regions of one square degree and centred on the galaxy clusters were downloaded from the Sloan Digital Sky Survey Data Release 6 (SDSS DR6). Investigating the photometric redshifts and cluster red-sequence of these galaxies shows that the galaxy clusters detected with the FoF algorithm are reliable out to z~0.6. We estimate masses for the clusters using their velocity dispersions. These mass estimates are shown to be consistent with 2SLAQ mock halo masses. Further analysis of the simulation haloes shows that clipping out low richness groups with large radii improves the purity of catalogue from 52% to 88%, while retaining a completeness of 94%. Finally, we test the two-point correlation function of our cluster catalogue. We find a best-fitting power law model with parameters r0 = 24pm4 Mpc/h and gamma = -2.1pm 0.2, which are in agreement with other low redshift cluster samples and consistent with a {Lambda}CDM universe.
We present the galaxy group catalogue for the recently-completed 2MASS Redshift Survey (2MRS, Macri2019) which consists of 44572 redshifts, including 1041 new measurements for galaxies mostly located within the Zone of Avoidance. The galaxy group cat
alogue is generated by using a novel, graph-theory based, modified version of the Friends-of-Friends algorithm. Several graph-theory examples are presented throughout this paper, including a new method for identifying substructures within groups. The results and graph-theory methods have been thoroughly interrogated against previous 2MRS group catalogues and a Theoretical Astrophysical Observatory (TAO) mock by making use of cutting-edge visualization techniques including immersive facilities, a digital planetarium, and virtual reality. This has resulted in a stable and robust catalogue with on-sky positions and line-of-sight distances within 0.5 Mpc and 2 Mpc, respectively, and has recovered all major groups and clusters. The final catalogue consists of 3022 groups, resulting in the most complete whole-sky galaxy group catalogue to date. We determine the 3D positions of these groups, as well as their luminosity and comoving distances, observed and corrected number of members, richness metric, velocity dispersion, and estimates of $R_{200}$ and $M_{200}$. We present three additional data products, i.e. the 2MRS galaxies found in groups, a catalogue of subgroups, and a catalogue of 687 new group candidates with no counterparts in previous 2MRS-based analyses.
Barter exchange studies the setting where each agent owns a good, and they can exchange with each other if that gives them more preferred goods. This exchange will give better outcomes if there are more participants. The challenge here is how to get
more participants and our goal is to incentivize the existing participants to invite new participants. However, new participants might be competitors for the existing participants. Therefore, we design an exchange mechanism based on the classical Top Trading Cycle (TTC) algorithm to solve their conflicts. Our mechanism is truthful in terms of revealing their preferences and also guarantees that inviting all their neighbors is a dominant strategy for all participants. The mechanism can be applied in settings where more participants are preferred but no extra budget to reach new participants.
We examine the problem of assigning plots of land to prospective buyers who prefer living next to their friends. They care not only about the plot they receive, but also about their neighbors. This externality results in a highly non-trivial problem
structure, as both friendship and land value play a role in determining agent behavior. We examine mechanisms that guarantee truthful reporting of both land values and friendships. We propose variants of random serial dictatorship (RSD) that can offer both truthfulness and welfare guarantees. Interestingly, our social welfare guarantees are parameterized by the value of friendship: if these values are low, enforcing truthful behavior results in poor welfare guarantees and imposes significant constraints on agents choices; if they are high, we achieve good approximation to the optimal social welfare.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
