Clan Capitalism, Graph Distance, and Other Issues : A Collection of Social and Economics Papers

By Smarandache, Florentin

Book Id: WPLBN0002828176
Format Type: PDF eBook:
File Size: 2.31 MB
Reproduction Date: 7/12/2013

Title:	Clan Capitalism, Graph Distance, and Other Issues : A Collection of Social and Economics Papers
Author:	Smarandache, Florentin
Volume:
Language:	English
Subject:	Non Fiction, Social Sciences, Urbanization
Collections:	Favorites in Hong Kong, Sociology, Science Fiction Collection, Social Sciences, Economics, Economy, Authors Community, Commerce, Finance, Literature, Most Popular Books in China
Historic Publication Date:	2013
Publisher:	World Public Library

Member Page:	Florentin Smarandache
Citation APA MLA Chicago Smarandache, B. F., & Christianto, V. (2013). Clan Capitalism, Graph Distance, and Other Issues : A Collection of Social and Economics Papers. Retrieved from http://www.gutenberg.us/

Description
This book consists of 6 papers focusing on social and economic issues. The topics covered include graph distance and optimal communication, migration in Jaipur, urbanization, clan capitalism, world population growth rate, and scientific inquiry. These papers were written in the period between 2009-2010. Hopefully the readers will find some new insights in this collection of papers.

Excerpt
In recent years, there has been a rapid increase in the literature which discusses new phenomenon associated to social network. One of the well-known phenomenon in this regards is known as ‘six degrees of separation’ [1], which implies that one can always keep a communication with each other anywhere within a six-step. A number of experiments has verified this hypothesis, either in the context of offline communication (postal mail), or online communication (email, etc.). In this article, we argue that by introducing this known ‘six degrees of separation’ into the context of group instability problem, one can find a new type of wisdom in organization. Therefore, we offer a new conjecture, which may be called ‘Group stability conjectures based on Graph/Network distance.”