New Models and Methods for Formation and Analysis of Social Networks
MetadataShow full item record
Social networks are an inseparable part of human lives, and play a major role in a wide range of activities in our day-to-day as well as long-term lives. The rapid growth of online social networks has enabled people to reach each other, while bridging the gaps of geographical locations, age groups, socioeconomic classes, etc. It is natural for government agencies, political parties, product companies, etc. to harness social networks for planning the well-being of society, launching e ective campaigns, making pro ts for themselves, etc. Social networks can be e ectively used to spread a certain information so as to increase the sales of a product using word-of-mouth marketing, to create awareness about something, to in uence people about a viewpoint, etc. Social networks can also be used to know the viewpoints of a large population by knowing the viewpoints of only a few selected people; this could help in predicting outcomes of elections, obtaining suggestions for improving a product, etc. The study on social network formation helps us know how one forms social and political contacts, how terrorist networks are formed, and how one's position in a social network makes one an in uential person or enables one to achieve a particular level of socioeconomic status. This doctoral work focuses on three main problems related to social networks: • Orchestrating Network Formation: We consider the problem of orchestrating formation of a social network having a certain given topology that may be desirable for the intended usecases. Assuming the social network nodes to be strategic in forming relationships, we derive conditions under which a given topology can be uniquely obtained. We also study the e ciency and robustness of the derived conditions. • Multi-phase In uence Maximization: We propose that information di usion be carried out in multiple phases rather than in a single instalment. With the objective of achieving better di usion, we discover optimal ways of splitting the available budget among the phases, determining the time delay between consecutive phases, and also nding the individuals to be targeted for initiating the di usion process. • Scalable Preference Aggregation: It is extremely useful to determine a small number of v representatives of a social network such that the individual preferences of these nodes, when aggregated, re ect the aggregate preference of the entire network. Using real-world data collected from Facebook with human subjects, we discover a model that faithfully captures the spread of preferences in a social network. We hence propose fast and reliable ways of computing a truly representative aggregate preference of the entire network. In particular, we develop models and methods for solving the above problems, which primarily deal with formation and analysis of social networks.
Showing items related by title, author, creator and subject.
Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation Shukla, Samta (2018-04-02)We consider a wireless sensor network, in which end users are interested in maximizing the useful information supplied by the network till network partition due to inevitable node deaths. Neither throughput maximization ...
On Network Coding and Network-Error Correction Prasad, Krishnan (2018-04-24)The paradigm of network coding was introduced as a means to conserve bandwidth (or equivalently increase throughput) in information ﬂow networks. Network coding makes use of the fact that unlike physical commodities, ...
Topics In Modeling, Analysis And Optimisation Of Wireless Networks Ramaiyan, Venkatesh (2010-11-02)The work in this thesis is concerned with two complementary aspects of wireless networks research; performance analysis and resource optimization. The first part of the thesis focusses on the performance analysis of IEEE ...