Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Society for Industrial and Applied Mathematics (SIAM) |
|---|---|
| Author | Kulkarni, Varsha S. |
| Copyright Year | 2016 |
| Abstract | Variations in patterns of innovation propagation found across complex networks are governed by the preference for an innovation and the topology (or connectivity pattern) of a network. This paper incorporates the interplay of these two features, which has received scant attention so far, in a simple model to study the temporal evolution of innovation in a social network. An individual upon interaction with an acceptor in the neighborhood progresses from an uninformed state to being informed before accepting the innovation, with a probability $\lambda$ that specifies the preference for innovation. Using only one intermediate information acquisition stage, the model concisely brings out a variety of patterns. Time taken to attain maximum velocity in a class of connectivity $k$ and population $N_k$ depends on $\lambda^{-2}k^{-2}N_{k}^{1/2}$. More importantly, we establish the lower bound that the average connectivity of a random network having minimum connectivity as low as 2 can attain and still be able to overtake the corresponding innovation emergence in a scale-free network. We show computationally and analytically the conditions in which the propagation in random networks may lead or lag behind that in scale-free networks. Hierarchical propagation is evident across connectivity classes within scale-free networks, as well as across random networks with distinct values of $k$, population. For highly preferred innovations, however, the hierarchy within scale-free networks tends to be insignificant. We verify using stochastic dominance, an uncertainty in class contributions in the upper range of connectivity. This makes innovation hard to administer in finite size networks. |
| Starting Page | 1485 |
| Ending Page | 1500 |
| Page Count | 16 |
| File Format | |
| DOI | 10.1137/15M1040797 |
| e-ISSN | 15360040 |
| Issue Number | 3 |
| Volume Number | 15 |
| Language | English |
| Publisher | Society for Industrial and Applied Mathematics |
| Publisher Date | 2016-08-09 |
| Access Restriction | Subscribed |
| Subject Keyword | innovation diffusion emergence time social networks preference Social networks dominance network structure hierarchical propagation |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|