Uncovering Randomness and Success in Society

@article{Jalan2014UncoveringRA,
  title={Uncovering Randomness and Success in Society},
  author={Sarika Jalan and Camellia Sarkar and Anagha Madhusudanan and Sanjiv Kumar Dwivedi},
  journal={PLoS ONE},
  year={2014},
  volume={9}
}
An understanding of how individuals shape and impact the evolution of society is vastly limited due to the unavailability of large-scale reliable datasets that can simultaneously capture information regarding individual movements and social interactions. We believe that the popular Indian film industry, “Bollywood”, can provide a social network apt for such a study. Bollywood provides massive amounts of real, unbiased data that spans more than 100 years, and hence this network has been used as… Expand
Deciphering versatility and cooperation in multilayer social networks
TLDR
The present study encompasses the multilayer network analysis of Bollywood, the largest film industry of the world, comprising of a massive time-varying social data and indicates the gradual restoration of cooperation in the recent dataset. Expand
Multilayer network decoding versatility and trust
TLDR
A massive time-varying social data drawn from the largest film industry of the world under multilayer network framework is analyzed to evaluate the versatility of actors, which turns out to be an intrinsic property of lead actors. Expand
Randomness and Structure in Collaboration Networks: A Random Matrix Analysis
TLDR
It is propagated that a blend of directional advancement and the mixing of schools of thoughts is essential for the steady development of a particular field of research. Expand
Interplay of degree correlations and cluster synchronization.
TLDR
The role of degree-degree correlation in the networks' cluster synchronizability is investigated and degeneracy at the zero eigenvalues provides an understanding of the occurrence of the driven phenomenon behind the synchronization in disassortative networks. Expand
so cph ] 1 O ct 2 01 8 Spectra of networks
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under threeExpand
Spectral properties of complex networks.
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under threeExpand
Importance of randomness in biological networks: A random matrix analysis
TLDR
An overview of the importance of random matrix framework in complex systems research with biological systems as examples is provided and it is shown that in spite of huge differences these interaction networks, representing real-world systems, posses from random matrix models, the spectral properties of the underlying matrices of these networks follow random matrix theory bringing them into the same universality class. Expand
Eigenvalue crossing in principal eigenvector localized networks.
Investigation of eigenvectors localization of complex networks is important to get insight into various structural and dynamical properties of the corresponding systems. Networks having highlyExpand
Origin and implications of zero degeneracy in networks spectra.
TLDR
This work provides all the possible reasons behind the occurrence of the zero degeneracy in the network spectra, namely, the complete and partial duplications, as well as their implications. Expand
Engineering chimera patterns in networks using heterogeneous delays.
TLDR
It is demonstrated that control over the spatial location of the incoherent region of a chimera state in a network can be achieved by appropriately introducing time delays, and borrowing a measure of eigenvector localization from the spectral graph theory, this method allows for the engineering of tailor-made one cluster or multi-cluster chimera patterns. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 82 REFERENCES
Robustness of Social Networks: Comparative Results Based on Distance Distributions
TLDR
This work approaches the problem of which node-removal order has the greatest impact on the network structure of a social network for the first time in a setting that combines both web graphs and social networks, using datasets that are orders of magnitude larger than those appearing in the previous literature. Expand
A Strategic Model of Social and Economic Networks
We study the stability and efficiency of social and economic networks, when self-interested individuals have the discretion to form or sever links. First, in the context of two stylized models, weExpand
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. Expand
Random graphs with arbitrary degree distributions and their applications.
TLDR
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph. Expand
Spectra of "real-world" graphs: beyond the semicircle law.
TLDR
Methods to determine the eigenvalues of networks comparable in size to real systems are developed, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs. Expand
Spectral analysis and the dynamic response of complex networks.
TLDR
It is shown that the spectral density of hierarchical networks follows a very different pattern, which can be used as a fingerprint of modularity, related to the homeostatic response of the network. Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
Spectra of complex networks.
TLDR
It is shown that spectra of locally treelike random graphs may serve as a starting point in the analysis of spectral properties of real-world networks, e.g., of the Internet. Expand
Models and methods in social network analysis
Models and Methods in Social Network Analysis presents the most important developments in quantitative models and methods for analyzing social network data that have appeared during the 1990s.Expand
The Structure and Function of Complex Networks
  • M. Newman
  • Physics, Computer Science
  • SIAM Rev.
  • 2003
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks. Expand
...
1
2
3
4
5
...