A simple model of influence
The paper studies a simple model of influence based on edge density. Consider a fixed graph \(G=(V,E)\), where vertices are either active or passive and all vertices of \(V\) initially are active and all fragments are individual vertices. For the vertex model, an active vertex \(u\) is chosen uniformly at random and contacts a random active neighbor \(v\). For the edge model, a directed edge \((v,u)\) between active vertices is chosen uniformly at random and the active vertex \(u\) contacts its active neighbor \(v\). The contacted neighbor \(v\) then becomes passive. Vertex \(v\) directs an edge to \(u\) in the fragment graph. Vertex \(v\) and its fragment \(F(v)\) become part of the fragment \(F(u)\) rooted at \(u\). An active vertex is isolated if it has no edges to active neighbors in \(G\). The process ends when all active vertices are isolated. The paper presents with high probability the number of fragments in \(G(n,m)\), which is the random graph for the edge model, for \(m\ll\binom{n}{2}\), and an upper bound on the expected number for any \(m\). The tail distribution of size of the largest fragment and its expected size are also examined. For the entire collection see [Zbl 1521.68009].
- A gentle introduction to the differential equation method and dynamic concentration
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 3233336 (Why is no real title available?)
- On tail probabilities for martingales
- On the lengths of the pieces of a stick broken at random
- Voter and majority dynamics with biased and stubborn agents
This page was built for publication: A simple model of influence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057303)
