scispace - formally typeset
Open AccessPosted Content

The Diffusion of Microfinance

TLDR
This article examined how participation in a micro-finance program diffuses through social networks and found that participants are significantly more likely to pass information on to friends and acquaintances than informed non-participants.
Abstract
We examine how participation in a microfinance program diffuses through social networks. We collected detailed demographic and social network data in 43 villages in South India before microfinance was introduced in those villages and then tracked eventual participation. We exploit exogenous variation in the importance (in a network sense) of the people who were first informed about the program, "the injection points". Microfinance participation is higher when the injection points have higher eigenvector centrality. We estimate structural models of diffusion that allow us to (i) determine the relative roles of basic information transmission versus other forms of peer influence, and (ii) distinguish information passing by participants and non-participants. We find that participants are significantly more likely to pass information on to friends and acquaintances than informed non-participants, but that information passing by non-participants is still substantial and significant, accounting for roughly a third of informedness and participation. We also find that, conditioned on being informed, an individual's decision is not significantly affected by the participation of her acquaintances.

read more

Citations
More filters
Proceedings ArticleDOI

Facilitating information spreading with local information in complex networks

TL;DR: Findings show the necessity of using the local information in making sure the rapid information spreading, and can provide us with deep understandings of network-driven dynamics.

Supplement to “testing for differences in stochastic

Eric Auerbach
TL;DR: Theorem 3 as discussed by the authors states that the tests proposed in Theorems 1 and 2 cannot detect differences between random graph models that are too similar, in the sense that T2→2(F1 F2)/τ→ 0 slower than δ−1 N .
Posted Content

Non-Cooperativity in Bayesian Social Learning

TL;DR: A Bayesian model for social learning of a random variable in which agents might observe each other over a directed network is described, and the outcomes produced are compared to those from a model in which observations occur randomly over a complete graph.
Journal ArticleDOI

Inference of monopartite networks from bipartite systems with different link types

TL;DR: In this paper , the authors proposed a new statistical method to identify the most critical links in the bipartite network projection, which takes into account the heterogeneity of node connections and can handle situations where links of different types are present.

Collaboration in scientific digital ecosystems: a socio-technical network analysis

TL;DR: This dissertation seeks to understand the formation, operation, organizational and the effect of scientific digital ecosystems that connect several online community networks in a single platform.
References
More filters
Journal ArticleDOI

Collective dynamics of small-world networks

TL;DR: 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.

A Contribution to the Mathematical Theory of Epidemics.

TL;DR: The present communication discussion will be limited to the case in which all members of the community are initially equally susceptible to the disease, and it will be further assumed that complete immunity is conferred by a single infection.
Journal ArticleDOI

A Simple Model of Herd Behavior

TL;DR: In this article, the authors analyze a sequential decision model in which each decision maker looks at the decisions made by previous decision makers in taking her own decision, and they show that the decision rules that are chosen by optimizing individuals will be characterized by herd behavior.
Proceedings ArticleDOI

Maximizing the spread of influence through a social network

TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Journal ArticleDOI

Epidemic Spreading in Scale-Free Networks

TL;DR: A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.