A Statistical Strategy for the Sunyaev-Zel'dovich Effect's Cluster Data

We present a statistical strategy for the efficient determination of the cluster luminosity function from the Sunyaev-Zel'dovich (SZ) effects survey. To determine the cluster luminosity function from the noise contaminated SZ map, we first define the zeroth-order cluster luminosity function as a discrepancy between the measured peak number density of the SZ map and the mean number density of noise. Then we demonstrate that the noise contamination effects can be removed by the stabilized deconvolution of the zeroth-order cluster luminosity function with the one-dimensional Gaussian distribution. We test this analysis technique against Monte-Carlo simulations, and find that it works quite well especially in the medium amplitude range where the conventional cluster identification method based on the threshold cut-off usually fails.Comment: final version, accepted by ApJ Letter

Network conduciveness with application to the graph-coloring and independent-set optimization transitions

We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another. We exemplify its use through an application to the two problems in combinatorial optimization that, given an undirected graph, ask that its so-called chromatic and independence numbers be found. Though NP-hard, when solved on sequences of expanding random graphs there appear marked transitions at which optimal solutions can be obtained substantially more easily than right before them. We demonstrate that these phenomena can be understood by resorting to the network that represents the solution space of the problems for each graph and examining its conduciveness between the non-optimal solutions and the optimal ones. At the said transitions, this network becomes strikingly more conducive in the direction of the optimal solutions than it was just before them, while at the same time becoming less conducive in the opposite direction. We believe that, besides becoming useful also in other areas in which network theory has a role to play, network conduciveness may become instrumental in helping clarify further issues related to NP-hardness that remain poorly understood

Kinematics of a Spacetime with an Infinite Cosmological Constant

A solution of the sourceless Einstein's equation with an infinite value for the cosmological constant \Lambda is discussed by using Inonu-Wigner contractions of the de Sitter groups and spaces. When \Lambda --> infinity, spacetime becomes a four-dimensional cone, dual to Minkowski space by a spacetime inversion. This inversion relates the four-cone vertex to the infinity of Minkowski space, and the four-cone infinity to the Minkowski light-cone. The non-relativistic limit c --> infinity is further considered, the kinematical group in this case being a modified Galilei group in which the space and time translations are replaced by the non-relativistic limits of the corresponding proper conformal transformations. This group presents the same abstract Lie algebra as the Galilei group and can be named the conformal Galilei group. The results may be of interest to the early Universe Cosmology.Comment: RevTex, 7 pages, no figures. Presentation changes, including a new Title. Version to appear in Found. Phys. Let

Mass Generation from Lie Algebra Extensions

Applied to the electroweak interactions, the theory of Lie algebra extensions suggests a mechanism by which the boson masses are generated without resource to spontaneous symmetry breaking. It starts from a gauge theory without any additional scalar field. All the couplings predicted by the Weinberg-Salam theory are present, and a few others which are nevertheless consistent within the model.Comment: 11 pages; revtex; title and PACS have been changed; comments included in the manuscrip