Abstract: Given an $n \times n$ rational matrix A, a vector $u \in \mathbb{Q}^n$ and an affine subspace $W \subset \mathbb{Q}^n$ , the affine subspace reachability problem asks whether there exists $t \in \mathbb{N}$ such that $A
Abstract: In a coordination problem, users in a network observing correlated inputs collaborate to evaluate possibly randomized functions of the inputs.
Abstract: The work is devoted to cooperative and coalitional game-theoretic methods for community detection in networks.The traditional methods for detecting community structure are based on selecting dense subgraphs inside the network.
Abstract: In this talk, we consider a modification of the usual Branching Random Walk (BRW), where at the last step we give certain displacements which may be different from the increments.
Abstract: In 1971, Graham and Pollak showed that if $D_T$ is the distance matrix of a tree $T$ on $n$ nodes, then $\det(D_T)$ depends only on $n$, not $T$.
This course will start with gradient based methods in convex optimization starting with gradient descent, proximal point methods and the use of momentum and randomness.
Abstract: This talk will comprise of two parts. In the first half, I shall discuss about Reed-Muller Codes and Reed-Solomon Codes. Basically, we shall prove that Reed-Muller Codes are a subset of Reed-Solomon Codes.
Abstract: In this talk, we will explore a surprising connection between graph theory and convex geometry. We look at graphs whose edge weights are linear forms in $d$ variables.
Neha Sangwan, graduate student in the School of Technology and Computer Science, wins the runner-up award for her poster at the Croucher Summer Course in Information Theory (
Deepesh Data, a former graduate student at the School of Technology and Computer Science and currently a post-doctorate researcher at the University of California, Los