The Experts below are selected from a list of 22956 Experts worldwide ranked by ideXlab platform
A Palmese - One of the best experts on this subject based on the ideXlab platform.
-
stellar mass as a galaxy cluster mass proxy application to the dark energy survey redmapper clusters
Monthly Notices of the Royal Astronomical Society, 2020Co-Authors: A Palmese, J Annis, J Burgad, Arya Farahi, M Soaressantos, B Welch, M Da Silva Pereira, H Lin, S BhargavaAbstract:We introduce a galaxy cluster mass observable, mu(*), based on the stellar masses of cluster members, and we present results for the Dark Energy Survey (DES) Year 1 (Y1) observations. Stellar masses are computed using a Bayesian model averaging method, and are validated for DES data using simulations and COSMOS data. We show that mu(*) works as a promising mass proxy by comparing our predictions to X-ray measurements. We measure the X-ray temperature-mu(*) relation for a total of 129 clusters matched between the wide-field DES Y1 redMaPPer catalogue and Chandra and XMM archival observations, spanning the redshift range 0.1
Logarithmic Space, we find a slope of alpha = 0.488 +/- 0.043 and a scatter in the X-ray temperature at fixed mu(*) of sigma(lnTX)vertical bar mu(*) = 0.266(-0.020)(+0.019) for the joint sample. By using the halo mass scaling relations of the X-ray temperature from the Weighing the Giants program, we further derive the mu(star)- conditioned scatter inmass, finding sigma(lnM)vertical bar mu(*) = 0.26(-0.10)(+0.15). These results are competitive with well-established cluster mass proxies used for cosmological analyses, showing that mu(*) can be used as a reliable and physically motivated mass proxy to derive cosmological constraints.
S Bhargava - One of the best experts on this subject based on the ideXlab platform.
-
stellar mass as a galaxy cluster mass proxy application to the dark energy survey redmapper clusters
Monthly Notices of the Royal Astronomical Society, 2020Co-Authors: A Palmese, J Annis, J Burgad, Arya Farahi, M Soaressantos, B Welch, M Da Silva Pereira, H Lin, S BhargavaAbstract:We introduce a galaxy cluster mass observable, mu(*), based on the stellar masses of cluster members, and we present results for the Dark Energy Survey (DES) Year 1 (Y1) observations. Stellar masses are computed using a Bayesian model averaging method, and are validated for DES data using simulations and COSMOS data. We show that mu(*) works as a promising mass proxy by comparing our predictions to X-ray measurements. We measure the X-ray temperature-mu(*) relation for a total of 129 clusters matched between the wide-field DES Y1 redMaPPer catalogue and Chandra and XMM archival observations, spanning the redshift range 0.1
Logarithmic Space, we find a slope of alpha = 0.488 +/- 0.043 and a scatter in the X-ray temperature at fixed mu(*) of sigma(lnTX)vertical bar mu(*) = 0.266(-0.020)(+0.019) for the joint sample. By using the halo mass scaling relations of the X-ray temperature from the Weighing the Giants program, we further derive the mu(star)- conditioned scatter inmass, finding sigma(lnM)vertical bar mu(*) = 0.26(-0.10)(+0.15). These results are competitive with well-established cluster mass proxies used for cosmological analyses, showing that mu(*) can be used as a reliable and physically motivated mass proxy to derive cosmological constraints.
Oleg Verbitsky - One of the best experts on this subject based on the ideXlab platform.
-
solving the canonical representation and star system problems for proper circular arc graphs in logSpace
Journal of Discrete Algorithms, 2016Co-Authors: Johannes Kobler, Sebastian Kuhnert, Oleg VerbitskyAbstract:Abstract We present a logSpace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models. This implies that the recognition and the isomorphism problems for these graphs are solvable in logSpace. For the broader class of concave-round graphs, which still possess (not necessarily proper) circular-arc models, we show that a canonical circular-arc model can also be constructed in logSpace. As a building block for these results, we design a logSpace algorithm for computing canonical circular-arc models of circular-arc hypergraphs. This class of hypergraphs corresponds to matrices with the circular ones property , which play an important role in computational genomics. Our results imply that there is a logSpace algorithm that decides whether a given matrix has this property. Furthermore, we consider the Star System Problem that consists in reconstructing a graph from its closed neighborhood hypergraph. We show that this problem is solvable in Logarithmic Space for the classes of proper circular-arc, concave-round, and co-convex graphs. Note that solving a problem in logSpace implies that it is solvable by a parallel algorithm of the class AC 1 . For the problems under consideration, at most AC 2 algorithms were known earlier.
-
solving the canonical representation and star system problems for proper circular arc graphs in logSpace
Foundations of Software Technology and Theoretical Computer Science, 2012Co-Authors: Johannes Kobler, Sebastian Kuhnert, Oleg VerbitskyAbstract:We present a logSpace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models. This implies that the recognition and the isomorphism problems for these graphs are solvable in logSpace. For the broader class of concave-round graphs, which still possess (not necessarily proper) circular-arc models, we show that a canonical circular-arc model can also be constructed in logSpace. As a building block for these results, we design a logSpace algorithm for computing canonical circular-arc models of circular-arc hypergraphs; this important class of hypergraphs corresponds to matrices with the circular ones property. Furthermore, we consider the Star System Problem that consists in reconstructing a graph from its closed neighborhood hypergraph. We show that this problem is solvable in Logarithmic Space for the classes of proper circular-arc, concave-round, and co-convex graphs.
Johannes Kobler - One of the best experts on this subject based on the ideXlab platform.
-
solving the canonical representation and star system problems for proper circular arc graphs in logSpace
Journal of Discrete Algorithms, 2016Co-Authors: Johannes Kobler, Sebastian Kuhnert, Oleg VerbitskyAbstract:Abstract We present a logSpace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models. This implies that the recognition and the isomorphism problems for these graphs are solvable in logSpace. For the broader class of concave-round graphs, which still possess (not necessarily proper) circular-arc models, we show that a canonical circular-arc model can also be constructed in logSpace. As a building block for these results, we design a logSpace algorithm for computing canonical circular-arc models of circular-arc hypergraphs. This class of hypergraphs corresponds to matrices with the circular ones property , which play an important role in computational genomics. Our results imply that there is a logSpace algorithm that decides whether a given matrix has this property. Furthermore, we consider the Star System Problem that consists in reconstructing a graph from its closed neighborhood hypergraph. We show that this problem is solvable in Logarithmic Space for the classes of proper circular-arc, concave-round, and co-convex graphs. Note that solving a problem in logSpace implies that it is solvable by a parallel algorithm of the class AC 1 . For the problems under consideration, at most AC 2 algorithms were known earlier.
-
solving the canonical representation and star system problems for proper circular arc graphs in logSpace
Foundations of Software Technology and Theoretical Computer Science, 2012Co-Authors: Johannes Kobler, Sebastian Kuhnert, Oleg VerbitskyAbstract:We present a logSpace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models. This implies that the recognition and the isomorphism problems for these graphs are solvable in logSpace. For the broader class of concave-round graphs, which still possess (not necessarily proper) circular-arc models, we show that a canonical circular-arc model can also be constructed in logSpace. As a building block for these results, we design a logSpace algorithm for computing canonical circular-arc models of circular-arc hypergraphs; this important class of hypergraphs corresponds to matrices with the circular ones property. Furthermore, we consider the Star System Problem that consists in reconstructing a graph from its closed neighborhood hypergraph. We show that this problem is solvable in Logarithmic Space for the classes of proper circular-arc, concave-round, and co-convex graphs.
J Burgad - One of the best experts on this subject based on the ideXlab platform.
-
stellar mass as a galaxy cluster mass proxy application to the dark energy survey redmapper clusters
Monthly Notices of the Royal Astronomical Society, 2020Co-Authors: A Palmese, J Annis, J Burgad, Arya Farahi, M Soaressantos, B Welch, M Da Silva Pereira, H Lin, S BhargavaAbstract:We introduce a galaxy cluster mass observable, mu(*), based on the stellar masses of cluster members, and we present results for the Dark Energy Survey (DES) Year 1 (Y1) observations. Stellar masses are computed using a Bayesian model averaging method, and are validated for DES data using simulations and COSMOS data. We show that mu(*) works as a promising mass proxy by comparing our predictions to X-ray measurements. We measure the X-ray temperature-mu(*) relation for a total of 129 clusters matched between the wide-field DES Y1 redMaPPer catalogue and Chandra and XMM archival observations, spanning the redshift range 0.1
Logarithmic Space, we find a slope of alpha = 0.488 +/- 0.043 and a scatter in the X-ray temperature at fixed mu(*) of sigma(lnTX)vertical bar mu(*) = 0.266(-0.020)(+0.019) for the joint sample. By using the halo mass scaling relations of the X-ray temperature from the Weighing the Giants program, we further derive the mu(star)- conditioned scatter inmass, finding sigma(lnM)vertical bar mu(*) = 0.26(-0.10)(+0.15). These results are competitive with well-established cluster mass proxies used for cosmological analyses, showing that mu(*) can be used as a reliable and physically motivated mass proxy to derive cosmological constraints.
