Search

We present simultaneous X-ray polarimetric and spectral observations of the bright atoll source Ser~X-1 carried out with the Imaging X-ray Polarimetry Explorer (IXPE), NICER, and NuSTAR. We obtain an upper limit of 2% (99% confidence level) on the polarization degree in the 2--8 keV energy band. We detect four type-I X-ray bursts, two of which during the IXPE observation. This is the first time that has IXPE observed type-I X-ray bursts, and it allows us to place an upper limit on their polarization degree; however, due to the limited total number of counts in each burst, we obtain a relatively high upper limit (80%). We confirm the presence of reflection features in the X-ray spectrum, notably a broad iron line. Fitting the data with a relativistic reflection model, we derive a disk inclination of 25 deg. The spectral and polarization properties are comparable with other atolls observed by IXPE, suggesting a similar accretion geometry, and the relatively low polarization is consistent with the low inclination., Comment: Accepted by A&A

We report on the second observing program of the active galactic nucleus NGC 4151 with simultaneous Imaging X-ray Polarimetry Explorer (IXPE; {\sim}750 ks), NuSTAR ({\sim}60 ks), XMM-Newton ({\sim}75 ks), and NICER ({\sim}65 ks) pointings. NGC 4151 is the first Type 1 radio-quiet Seyfert galaxy with constrained polarization properties for the X-ray corona. Despite the lower flux state in which the source is re-observed and the resulting higher contribution of the constant reflection component in the IXPE energy band, our results are in agreement with the first detection. From the polarimetric analysis, a polarization degree {\Pi} = 4.7 {\pm} 1.3 per cent and angle {\Psi} = 77{\deg} {\pm} 8{\deg} east of north (68 per cent confidence level) are derived in the 2.0 - 8.0 keV energy range. Combining the two observations leads to polarization properties that are more constrained than those of the individual detections, showing {\Pi} = 4.5 {\pm} 0.9 per cent and {\Psi} = 81{\deg} {\pm} 6{\deg} (with detection significance {\sim}4.6{\sigma}). The observed polarization angle aligns very well with the radio emission in this source, supporting, together with the significant polarization degree, a slab or wedge geometry for the X-ray corona. However, a switch in the polarization angle at low energies (37{\deg} {\pm} 7{\deg} in the 2 - 3.5 keV bin) suggests the presence of another component. When it is included in the spectro-polarimetric fit, a high polarization degree disfavors an interpretation in terms of a leakage through the absorbers, rather pointing to scattering from some kind of mirror., Comment: 10 pages, 8 figures, 3 tables. Submitted to Astronomy & Astrophysics

Networked dynamical systems are widely used as formal models of real-world cascading phenomena, such as the spread of diseases and information. Prior research has addressed the problem of learning the behavior of an unknown dynamical system when the underlying network has a single layer. In this work, we study the learnability of dynamical systems over multilayer networks, which are more realistic and challenging. First, we present an efficient PAC learning algorithm with provable guarantees to show that the learner only requires a small number of training examples to infer an unknown system. We further provide a tight analysis of the Natarajan dimension which measures the model complexity. Asymptotically, our bound on the Nararajan dimension is tight for almost all multilayer graphs. The techniques and insights from our work provide the theoretical foundations for future investigations of learning problems for multilayer dynamical systems., Comment: Accepted at ICML 2024

We used the Imaging X-ray Polarimetry Explorer (IXPE) satellite to measure, for the first time, the 2-8 keV polarization of NGC 1068. We pointed IXPE for a net exposure time of 1.15 Ms on the target, in addition to two ~ 10 ks each Chandra snapshots in order to account for the potential impact of several ultraluminous X-ray source (ULXs) within IXPE's field-of-view. We measured a 2 - 8 keV polarization degree of 12.4% +/- 3.6% and an electric vector polarization angle of 101{\deg} +/- 8{\deg} at 68% confidence level. If we exclude the spectral region containing the bright Fe K lines and other soft X-ray lines where depolarization occurs, the polarization fraction rises up to 21.3% +/- 6.7% in the 3.5 - 6.0 keV band, with a similar polarization angle. The observed polarization angle is found to be perpendicular to the parsec scale radio jet. Using a combined Chandra and IXPE analysis plus multi-wavelength constraints, we estimated that the circumnuclear "torus" may sustain a half-opening angle of 50{\deg} - 55{\deg} (from the vertical axis of the system). Thanks to IXPE, we have measured the X-ray polarization of NGC 1068 and found comparable results, both in terms of polarization angle orientation with respect to the radio-jet and torus half-opening angle, to the X-ray polarimetric measurement achieved for the other archetypal Compton-thick AGN : the Circinus galaxy. Probing the geometric arrangement of parsec-scale matter in extragalactic object is now feasible thanks to X-ray polarimetry., Comment: 9 pages, 5 figures, 2 tables, submited to A&A

Exploiting the cluster of three Bell coherent-states as quantum channel, we presented a scheme wherein quantum-informations encoded in three arbitrary superposed coherent states, i.e., Schrodinger Cat coherent-states are simultaneously transmitted in unidirectional cyclic sequence among three parties by invoking usage of linear optical gadgets such as ideal beam-splitters, phase shifters and photon-number-resolving detectors. Proposed simultaneous unidirectional Cyclic Quantum Teleportation is faithful with one-eighth probability of success. Furthermore, it is seen that not every detection-events provides faithful scheme and, hence, fidelity and probability of success of near-faithful Cyclic Quantum Teleportation is evaluated and numerically interpreted., Comment: 26 pages, 3 figures

Discrete dynamical systems are commonly used to model the spread of contagions on real-world networks. Under the PAC framework, existing research has studied the problem of learning the behavior of a system, assuming that the underlying network is known. In this work, we focus on a more challenging setting: to learn both the behavior and the underlying topology of a black-box system. We show that, in general, this learning problem is computationally intractable. On the positive side, we present efficient learning methods under the PAC model when the underlying graph of the dynamical system belongs to some classes. Further, we examine a relaxed setting where the topology of an unknown system is partially observed. For this case, we develop an efficient PAC learner to infer the system and establish the sample complexity. Lastly, we present a formal analysis of the expressive power of the hypothesis class of dynamical systems where both the topology and behavior are unknown, using the well-known formalism of the Natarajan dimension. Our results provide a theoretical foundation for learning both the behavior and topology of discrete dynamical systems., Comment: Accepted at AAAI-24

Optimal allocation of agricultural water in the event of droughts is an important global problem. In addressing this problem, many aspects, including the welfare of farmers, the economy, and the environment, must be considered. Under this backdrop, our work focuses on several resource-matching problems accounting for agents with multi-crop portfolios, geographic constraints, and fairness. First, we address a matching problem where the goal is to maximize a welfare function in two-sided markets where buyers' requirements and sellers' supplies are represented by value functions that assign prices (or costs) to specified volumes of water. For the setting where the value functions satisfy certain monotonicity properties, we present an efficient algorithm that maximizes a social welfare function. When there are minimum water requirement constraints, we present a randomized algorithm which ensures that the constraints are satisfied in expectation. For a single seller--multiple buyers setting with fairness constraints, we design an efficient algorithm that maximizes the minimum level of satisfaction of any buyer. We also present computational complexity results that highlight the limits on the generalizability of our results. We evaluate the algorithms developed in our work with experiments on both real-world and synthetic data sets with respect to drought severity, value functions, and seniority of agents.

In the present study, we identified an extremely low-mass white dwarf as a companion to a low luminous blue straggler star within the Galactic globular cluster NGC 362. To conduct the analysis, we utilized data obtained from various sources, including AstroSat Ultra Violet Imaging Telescope, UVOT, and the 2.2-m ESO telescope. By examining the spectral energy distribution of the blue straggler star candidate, we successfully identified an extremely low mass white dwarf as its binary companion. We determined the effective temperature, radius, and luminosity for both, the extremely low-mass white dwarf and the blue straggler star candidate. Specifically, the extremely low-mass white dwarf exhibits an effective temperature of 15000 K, a radius of 0.17 Rsun, a luminosity of 1.40 Lsun, and a mass range of 0.19-0.20 Msun. Furthermore, the position of the straggler star within the cluster suggests their formation via the Case A/B mass-transfer mechanism in a low-density environment., Comment: 6 pages, 2 figures, Submitted: 31 May, 2023 and Accepted: 26 July 2023

Arabian Sea Mid-Tropospheric Cyclones (MTCs), which are responsible for extreme rainfall events in western India, often coincide with monsoon low-pressure systems (LPS) over the Bay of Bengal. However, the role of Bay of Bengal LPSs in the formation of Arabian Sea MTCs remains unclear. This study utilizes the Weather Research and Forecasting Model (WRF) to investigate the atmospheric connection between the two basins. By introducing a balanced bogus vortex over the Bay of Bengal, cyclonic systems are induced over the Arabian Sea in the majority of ensemble members, exhibiting characteristics consistent with observations. As the Bay of Bengal vortex moves westward, the middle tropospheric trough deepens, horizontal wind shear increases, the low-level Arabian Sea stable inversion layer weakens, and the middle troposphere moisture content increases over western India and the northeast Arabian Sea. Subsequently, MTC genesis occurs along the western edge of the trough within 2-4 days of model integration over the northeast Arabian Sea. Vorticity budget analysis highlights the critical role of vorticity advection and tilting during the initial 24 hours of MTC genesis, while vortex stretching becomes the dominant vorticity source during rapid intensification. To further substantiate these findings, a mechanism denial experiment is conducted using a real-world instance of coexistent Arabian Sea MTC and Bay of Bengal LPS, which was replicated in the model. In the experiment, conditions unfavorable for LPS genesis are created by cooling and drying the Bay of Bengal. The results demonstrate that when the Bay of Bengal LPS does not develop or intensify, the Arabian Sea MTC fails to form. This study presents compelling evidence for the significant influence of Bay of Bengal low-pressure systems on the formation of severe weather-inducing MTCs over the Arabian Sea and western India., Comment: 32 pages 18 figures

We report the discovery of four blue lurkers with low and extremely low-mass white dwarf (ELM WDs) companions in the Galactic globular cluster NGC 362 using AstroSat Ultra Violet Imaging Telescope (UVIT). We analyzed the multi-wavelength spectral energy distribution (SED) of FUV-bright MS stars using data from the UVIT, UVOT, GAIA EDR3, and 2.2m ESO/MPI telescopes. Two each of low-mass WDs and ELM WDs are found as companions for the four blue lurkers by the fitting of two-component SED models. The effective temperatures, radii, luminosities, and masses of two low-mass WDs are (35000, 23000) K, (0.04, 0.05) Rsun , (1.45, 0.22) Lsun , and (0.2, 0.2) Msun, while the two ELM WDs are (14750, 14750) K, (0.09, 0.10) Rsun, (0.34, 0.40) Lsun, and (0.18, 0.18) Msun. The position of blue lurkers within the cluster shows that they originated via the Case A/B mass-transfer mechanism in a low-density environment. This is the first detection of blue lurkers with low-mass WDs and ELM WDs as companions in a globular cluster. The companion cooling age is less than 4 Myr, which suggests that they were just recently formed. These binary systems might have originated due to the cluster recent core collapse., Comment: 6 pages, 3 figures, 1 table

Poverty is a multifaceted phenomenon linked to the lack of capabilities of households to earn a sustainable livelihood, increasingly being assessed using multidimensional indicators. Its spatial pattern depends on social, economic, political, and regional variables. Artificial intelligence has shown immense scope in analyzing the complexities and nuances of poverty. The proposed project aims to examine the poverty situation of rural India for the period of 1990-2022 based on the quality of life and livelihood indicators. The districts will be classified into `advanced', `catching up', `falling behind', and `lagged' regions. The project proposes to integrate multiple data sources, including conventional national-level large sample household surveys, census surveys, and proxy variables like daytime, and nighttime data from satellite images, and communication networks, to name a few, to provide a comprehensive view of poverty at the district level. The project also intends to examine causation and longitudinal analysis to examine the reasons for poverty. Poverty and inequality could be widening in developing countries due to demographic and growth-agglomerating policies. Therefore, targeting the lagging regions and the vulnerable population is essential to eradicate poverty and improve the quality of life to achieve the goal of `zero poverty'. Thus, the study also focuses on the districts with a higher share of the marginal section of the population compared to the national average to trace the performance of development indicators and their association with poverty in these regions., Comment: Accepted to IJCAI 2023 Main Conference (AI for Social Good Track)

We explore the potential of the ongoing Zwicky-Transient-Facility (ZTF) survey for studying Intra-Night Optical Variability (INOV) of active galactic nuclei (AGN), in particular for picking rare events of large INOV amplitudes, whose detection may require extensive temporal coverage. For this, we have used the available high cadence subsets of the ZTF database to build a well-defined large sample of 53 blazars (BLs) and another sample of 132 radio-quiet quasars (RQQs), matched to the blazar sample in the redshift-magnitude plane. High-cadence ZTF monitoring of these two matched samples are available, respectively, for 156 and 418 intranight sessions. Median durations for both sets of sessions are 3.7 hours. The two classes of powerful AGN monitored in these sessions represent opposite extremes of jet activity. The present analysis of their ZTF light curves has revealed some strong INOV events which, although not exceptionally rare for blazars, are indeed so for RQQs, and their possible nature is briefly discussed., Comment: Accepted for publication in MNRAS

GRB~210704A is a burst of intermediate duration ($T_{90} \sim 1-4$~s) followed by a fading afterglow and an optical excess that peaked about 7 days after the explosion. Its properties, and in particular those of the excess, do not easily fit into the well established classification scheme of GRBs as being long or short, leaving the nature of its progenitor uncertain. We present multi-wavelength observations of the GRB and its counterpart, observed up to 160 days after the burst. In order to decipher the nature of the progenitor system, we present a detailed analysis of the GRB high-energy properties (duration, spectral lag, and Amati correlation), its environment, and late-time optical excess. We discuss three possible scenarios: a neutron star merger, a collapsing massive star, and an atypical explosion possibly hosted in a cluster of galaxies. We find that traditional kilonova and supernova models do not match well the properties of the optical excess, leaving us with the intriguing suggestion that this event was an exotic high-energy merger., Comment: Revised version submitted to MNRAS after minor comments, 14 pages, 9 figures

Evolutionary anti-coordination games on networks capture real-world strategic situations such as traffic routing and market competition. In such games, agents maximize their utility by choosing actions that differ from their neighbors' actions. Two important problems concerning evolutionary games are the existence of a pure Nash equilibrium (NE) and the convergence time of the dynamics. In this work, we study these two problems for anti-coordination games under sequential and synchronous update schemes. For each update scheme, we examine two decision modes based on whether an agent considers its own previous action (self essential ) or not (self non-essential ) in choosing its next action. Using a relationship between games and dynamical systems, we show that for both update schemes, finding an NE can be done efficiently under the self non-essential mode but is computationally intractable under the self essential mode. To cope with this hardness, we identify special cases for which an NE can be obtained efficiently. For convergence time, we show that the best-response dynamics converges in a polynomial number of steps in the synchronous scheme for both modes; for the sequential scheme, the convergence time is polynomial only under the self non-essential mode. Through experiments, we empirically examine the convergence time and the equilibria for both synthetic and real-world networks., Comment: Accepted at AAAI-23

Motivated by real-world applications such as the allocation of public housing, we examine the problem of assigning a group of agents to vertices (e.g., spatial locations) of a network so that the diversity level is maximized. Specifically, agents are of two types (characterized by features), and we measure diversity by the number of agents who have at least one neighbor of a different type. This problem is known to be NP-hard, and we focus on developing approximation algorithms with provable performance guarantees. We first present a local-improvement algorithm for general graphs that provides an approximation factor of 1/2. For the special case where the sizes of agent subgroups are similar, we present a randomized approach based on semidefinite programming that yields an approximation factor better than 1/2. Further, we show that the problem can be solved efficiently when the underlying graph is treewidth-bounded and obtain a polynomial time approximation scheme (PTAS) for the problem on planar graphs. Lastly, we conduct experiments to evaluate the per-performance of the proposed algorithms on synthetic and real-world networks., Comment: Accepted at AAMAS-23

Networked discrete dynamical systems are often used to model the spread of contagions and decision-making by agents in coordination games. Fixed points of such dynamical systems represent configurations to which the system converges. In the dissemination of undesirable contagions (such as rumors and misinformation), convergence to fixed points with a small number of affected nodes is a desirable goal. Motivated by such considerations, we formulate a novel optimization problem of finding a nontrivial fixed point of the system with the minimum number of affected nodes. We establish that, unless P = NP, there is no polynomial time algorithm for approximating a solution to this problem to within the factor n^1-\epsilon for any constant epsilon > 0. To cope with this computational intractability, we identify several special cases for which the problem can be solved efficiently. Further, we introduce an integer linear program to address the problem for networks of reasonable sizes. For solving the problem on larger networks, we propose a general heuristic framework along with greedy selection methods. Extensive experimental results on real-world networks demonstrate the effectiveness of the proposed heuristics., Comment: Accepted at AAAI-22