Closure invariants for polarised radio interferometric observations: A graph theoretical approach
| dc.contributor.author | Kumar, Vinay | |
| dc.contributor.author | Nityananda, Rajaram | |
| dc.contributor.author | Samuel, Joseph | |
| dc.date.accessioned | 2025-08-25T05:51:29Z | |
| dc.date.available | 2025-08-25T05:51:29Z | |
| dc.date.issued | 2025-08-18 | |
| dc.description | Open Access | en_US |
| dc.description.abstract | Aperture synthesis observations in radio wavelengths with full polarisation, have long been used to study the magnetic fields of synchrotron-emitting sources. Recently proposed closure invariants – quantities immune to antenna-specific signal corruptions – give us a powerful method for extracting information from measured visibilities, which are corrupted by antenna and polarisation-dependent gains. This paper extends a formalism developed earlier for complete graphs (where all visibilities are available) to incomplete graphs. The formalism provides a complete and independent set of closure invariants from the measured visibilities in a general situation, where not all visibilities are available. We then show in a simulated, quasi-realistic case, that the invariants developed here contain usable information even in the presence of noise. | en_US |
| dc.identifier.citation | Journal of Astrophysics and Astronomy, 2025, Vol.46, Article No. 56 | en_US |
| dc.identifier.uri | http://hdl.handle.net/2289/8438 | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer for Indian Academy of Sciences | en_US |
| dc.relation.uri | https://arxiv.org/abs/2407.00583 | en_US |
| dc.relation.uri | https://doi.org/10.1007/s12036-025-10081-9 | en_US |
| dc.relation.uri | https://ui.adsabs.harvard.edu/abs/2024arXiv240700583K/abstract | en_US |
| dc.rights | 2025 Indian Academy of Sciences | en_US |
| dc.subject | Aperture synthesis | en_US |
| dc.subject | polarisation | en_US |
| dc.subject | closure invariants | en_US |
| dc.title | Closure invariants for polarised radio interferometric observations: A graph theoretical approach | en_US |
| dc.type | Article | en_US |

