In this paper, elementary properties of relative extreme points are investigated. The properties are defined in linear and topological terms. Proofs of many of these properties require the use of topological concepts.

Many real-world systems can be represented as network-graphs. Some of the networks have an inherent community structure based on interactions. The problem of identifying this grouping structure given a graph is termed as community detection problem which has certain existing algorithms. This thesis contributes by providing specific improvements to various community detection algorithms such as spectral clustering and extreme point algorithm. One of the main contributions is proposing a new sub-sampling method to make existing spectral clustering method scalable by reducing the computational complexity. Also, we have implemented extreme points algorithm for a general multiple communities detection case along with a sub-sampling based version to reduce the computational complexity. We have also developed spectral clustering algorithm for popularity-adjusted block model (PABM) model based graphs to make the algorithm exact thus improving its accuracy. / Master of Science / We live in an increasingly interconnected world, where agents constantly interact with each other. This general agent-interaction framework describes many important systems, such as social interpersonal systems, protein interaction systems, trade and financial systems, power grids, and the World Wide Web, to name a few. By denoting agents as nodes and their interconnections as links, any such system can be represented as a network. Such networks or graphs provide a powerful and universal representation for analyzing a wide variety of systems spanning a remarkable range of scientific disciplines. Networks act as conduits for many kinds of transmissions. For instance, they are influential in the dissemination of ideas, adoption of technologies, helping find jobs and spread of diseases. Thus networks play a critical role both in providing information and helping make decisions making them a crucial part of the Data and Decisions Destination Area. A well-known feature of many networks is community structure. Nodes in a network are often found to belong to groups or communities that exhibit similar behavior. The identification of this community structure, called community detection, is an important problem with many critical applications. For example, communities in a protein interaction network often correspond to functional groups. This thesis focuses on cutting-edge methods for community detection in networks. The main approach is efficient community detection via sub-sampling. This is applied to two different approaches. The first approach is optimization of a modularity function using a low-rank approximation for multiple communities. The second approach is a spectral clustering where we aim to formulate an algorithm for community detection by exploiting the eigenvectors of the network adjacency matrix.

We study the structure of the set of extreme points of the compact convex set of matrix-valued holomorphic functions with positive real part on a finitely-connected planar domain 𝐑 normalized to have value equal to the identity matrix at some prescribed point t₀ ∈ 𝐑. This leads to an integral representation for such functions more general than what would be expected from the result for the scalar-valued case. After Cayley transformation, this leads to a integral Agler decomposition for the matrix Schur class over 𝐑 (holomorphic contractive matrix-valued functions over 𝐑). Application of a general theory of abstract Schur-class generated by a collection of test functions leads to a transfer-function realization for the matrix Schur-class over 𝐑, extending results known up to now only for the scalar case. We also explain how these results provide a new perspective for the dilation theory for Hilbert space operators having 𝐑 as a spectral set. / Ph. D.

En esta memoria se incluyen diversas alternativas a una teoría de krein-milman no arquimediana las cuales vienen sugeridas bien por intentos anteriores de otros autores bien por conseguir una teoría unificada en los casos arquimediano o no o bien por lograr una teoría independiente del cuerpo valuado y que en condiciones de comparación dan lugar a resultados muy similares / This monography provides several alternatives to a non-Archimedan Krein-Milman Theory. They are suggested by some previous attempts to this subject carried out by other authors, as well as by the aim of getting an unified theory that works in the Archimede and in the non-Archimedean cases, in the sense that in the Archimedean context, this theory coincides with the well-known one existing in the classical literature

In this thesis, we introduce EPOSIC channels, a class of SU(2) -covariant quantum channels. For each of them, we give a Stinespring representation, a Kraus representation, its Choi matrix, a complementary channel, and its dual map. We show that these channels are the extreme points of all SU(2) -irreducibly covariant channels. As an application of these channels to the theory of quantum information, we study the minimal output entropy of EPOSIC channels, and show that a large class of these channels is a potential example of violating the well-known problem, the additivity problem. We determine the cases where their minimal output entropy is not zero, and obtain some partial results on the fulfillment of their entanglement breaking property. We find a bound of the minimal output entropy of the tensor product of two SU(2) -irreducibly covariant channels. We also get an example of a positive map that is not completely positive.

The first part of the thesis deals with aspects of Loewner theory in several complex variables. First we show that a Loewner chain with minimal regularity assumptions (Df(0,t) of local bounded variation) satisfies an associated Loewner equation. Next we give a way of renormalizing a general Loewner chain so that it corresponds to the same increasing family of domains. To do this we will prove a generalization of the converse of Carathéodory's kernel convergence theorem. Next we address the problem of finding a Loewner chain solution to a given Loewner chain equation. The main result is a complete solution in the case when the infinitesimal generator satisfies Dh(0,t)=A where inf {Re<Az,z>: ||z| =1}> 0. We will see that the existence of a bounded solution depends on the real resonances of A, but there always exists a polynomially bounded solution. Finally we discuss some properties of classes of biholomorphic mappings associated to A-normalized Loewner chains. In particular we give a characterization of the compactness of the class of spirallike mappings in terms of the resonance of A. The second part of the thesis deals with the problem of finding examples of extreme points for some classes of mappings. We see that straightforward generalizations of one dimensional extreme functions give examples of extreme Carathéodory mappings and extreme starlike mappings on the polydisc, but not on the ball. We also find examples of extreme Carathéodory mappings on the ball starting from a known example of extreme Carathéodory function in higher dimensions.

The first part of the thesis deals with aspects of Loewner theory in several complex variables. First we show that a Loewner chain with minimal regularity assumptions (Df(0,t) of local bounded variation) satisfies an associated Loewner equation. Next we give a way of renormalizing a general Loewner chain so that it corresponds to the same increasing family of domains. To do this we will prove a generalization of the converse of Carathéodory's kernel convergence theorem. Next we address the problem of finding a Loewner chain solution to a given Loewner chain equation. The main result is a complete solution in the case when the infinitesimal generator satisfies Dh(0,t)=A where inf {Re<Az,z>: ||z| =1}> 0. We will see that the existence of a bounded solution depends on the real resonances of A, but there always exists a polynomially bounded solution. Finally we discuss some properties of classes of biholomorphic mappings associated to A-normalized Loewner chains. In particular we give a characterization of the compactness of the class of spirallike mappings in terms of the resonance of A. The second part of the thesis deals with the problem of finding examples of extreme points for some classes of mappings. We see that straightforward generalizations of one dimensional extreme functions give examples of extreme Carathéodory mappings and extreme starlike mappings on the polydisc, but not on the ball. We also find examples of extreme Carathéodory mappings on the ball starting from a known example of extreme Carathéodory function in higher dimensions.

In this thesis, we consider multiobjective combinatorial optimization problems. We address two main topics. We first address the polynomially solvable cases of the Traveling Salesperson Problem and the Bottleneck Traveling Salesperson Problem. We consider multiobjective versions of these problems with different combinations of objective functions, analyze their computational complexities and develop exact algorithms where possible. We next consider generating extreme supported nondominated points of multiobjective integer programming problems for any number of objective functions. We develop two algorithms for this purpose. The first one is an exact algorithm and finds all such points. The second algorithm finds only a subset of extreme supported nondominated points providing a worst case approximation for the remaining points.