20 Jul 2026 | 6th CNI Summer School 2026This summer school focused on model approximation techniques in Markov Decision Processes (MDPs) and Partially Observable Markov Decision Processes (POMDPs). |
14 Jul 2026 | SPARC Workshop on Distributed Learning and OptimizationA one-day workshop featuring invited talks on distributed learning, optimization, and related areas. |
13 Apr 2026 | Future Communications and Networking WorkshopOrganised In collaboration with the UK-India Future Networks Initiative |
11 Mar 2026 | Cisco MD Visit to CNI, ECEVisit of the Cisco Managing Director and Cisco National Security & Trust Officer to CNI |
14 Sep 2026, 4:00 PM — 5:00 PM
Zoom link: https://us06web.zoom.us/j/83388976389?pwd=XcpO3GhLxsR14a7SVbPx33HQQa1jbt.1
Dear All, Networks Seminar, supported by the Centre for Networked Intelligence, is a technical discussion forum in topics including but not limited to computer networks, machine learning, signal processing, and information theory. The seminar series has a webpage hosted at https://cni.iisc.ac.in/seminars/. You are invited to the following seminar held as part of this series. Title: Asymptotics of the Number of Labelled Connected Sparse Multitype Graphs Speaker: Prof. Luisa Andreis, Professor, University of Turin Time: 4:00 PM - 5:00 PM (IST) Date: 14 September 2026 Venue: Online on Zoom Zoom link: https://us06web.zoom.us/j/83388976389?pwd=XcpO3GhLxsR14a7SVbPx33HQQa1jbt.1 Zoom Meeting ID: 833 8897 6389, Pass Code: NSSIISc YouTube: https://www.youtube.com/watch?v=Wu8MynsrO0Q&list=PLNN9TCnjABcY5RBvFXAghzQ6HMsNX8GeF Webpage Link: https://cni.iisc.ac.in/seminars/2026-09-14/ <https://cni.iisc.ac.in/seminars/2026-09-14/> Abstract: We consider the enumeration of connected multitype (colored) graphs with prescribed vertex profile and edge matrix, in the sparse regime where the number of edges and the excess are proportional to the size of the graph. This extends the classical result of Bender, Canfield, and McKay for connected sparse graphs to the multitype setting. Our approach is probabilistic: we establish that a connected multitype graph with prescribed statistics can be identified, with high probability, as the giant component of an appropriately tuned supercritical inhomogeneous random graph. Combining this correspondence with large-deviation estimates for the connectivity probability of inhomogeneous random graphs, we derive the leading exponential asymptotics of the corresponding enumeration problem. We will outline the proof strategy and discuss the connectivity constraints that arise specifically in the multitype setting. This is a joint work with M. Veshaj (WIAS- Berlin). Bio: Luisa Andreis is Associate Professor at the Department of Mathematics "Giuseppe Peano," University of Torino, in Italy. She received her PhD from the University of Padova, and held positions as a postdoc at the Weierstrass Institute in Berlin and as Assistant Professor at the University of Florence and Politecnico di Milano. Her research focuses on probability theory, with an emphasis on random graphs, large deviations, and interacting particle systems, and, most recently, on mathematical models for artificial intelligence. More Details: https://sites.google.com/view/luisaandreis/home ALL ARE WELCOME. Thank you, CNI Seminar Series Organizing Committee.
We are racing towards a connected world where every individual and device contribute to and benefit from the network. However, our data collection surpasses our ability to extract valuable knowledge. To achieve networked intelligence, we need a holistic approach involving real-time sensing, communication, analytics, and more. The centre aims to develop next-gen networking solutions for smart cities, IoT, data exchanges, and society's benefit.



