Network formed by traces of random walks

Ikeda, Nobutoshi

doi:10.1016/j.physa.2007.01.006

Cited by 10 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…N. Ikeda [16] proposed a model of time evolving networks by random walks. We have groups of experiments with the simulation data, including personal information in social networks and re-tweeting relationships.…”

Section: A Datasetmentioning

confidence: 99%

Hadoop Cellular Automata for Identifying Rumor in Social Networks

Zhang

Xiao

2013

2013 International Conference on Information Science and Cloud Computing Companion

View full text Add to dashboard Cite

Rumors are unavoidable in social networks and spreading through social networks. In this paper, we introduce three roles, which are rumor maker, accomplice and innocent, into social networks. Rumor makers are people who distribute rumors in social networks. In order to propagate rumor as more people as possible, rumor maker cannot achieve this goal without others' help. So that accomplices are people who help rumor maker spread rumors. Innocent are people who do not share help for rumors spreading. We introduce an extended cellular automata algorithm, i.e. Hadoop Cellular Automata (HCA), to simulate people's tweeting activity in social networks. We deploy our experiments on an open source platform, Hadoop. Our result shows that Hadoop Cellular Automata is a liner algorithm. Also HCA can simulate people's tweeting activity very well and can pick out rumors easily in social networks.

show abstract

Section: A Datasetmentioning

confidence: 99%

Hadoop Cellular Automata for Identifying Rumor in Social Networks

Zhang

Xiao

2013

2013 International Conference on Information Science and Cloud Computing Companion

View full text Add to dashboard Cite

show abstract

“…Each shortcut link is added between the current resident node of a randomly chosen packet and a randomly chosen node from the nodes that have already been visited on the routing path before arriving at its terminal. Such a direct shortcut between nodes separated by more than two hops suppresses the forming of a quasi-complete graph [11,12] in the hop-by-hop connections. To compare the communication efficiency and the robustness of connectivity with LS and PR networks, we further consider a Random Shortcut(RS) network.…”

Section: Network Self-organizationmentioning

confidence: 99%

“…Another idea of path reinforcement is introduced by iteratively adding a bypass between nodes separated by two hops on frequently traveled paths [11,12]. Through the induced diffusion process by random walkers, quasi-complete and scale-free (SF) networks emerge from the initial 1D-chain and 2D-lattice, respectively.…”

Section: Introductionmentioning

confidence: 99%

“…Through the induced diffusion process by random walkers, quasi-complete and scale-free (SF) networks emerge from the initial 1D-chain and 2D-lattice, respectively. However, in the topological formations involved with diffusive flow dynamics [7,8,9,10,11,12], the geographical positions of nodes are ignored or restricted in spite of their importance at least for transportation and communication networks. In addition, these network structures are not necessarily desirable due to the large cost of maintaining many links and the vulnerability against hub attacks [13].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Self-organized network design by link survivals and shortcuts

Hayashi

Meguro

2012

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

One of the challenges for future infrastructures is how to design a network with high efficiency and strong connectivity at low cost. We propose self-organized geographical networks beyond the vulnerable scale-free structure found in many real systems. The networks with spatially concentrated nodes emerge through link survival and path reinforcement on routing flows in a wireless environment with a constant transmission range of a node. In particular, we show that adding some shortcuts induces both the small-world effect and a significant improvement of the robustness to the same level as in the optimal bimodal networks. Such a simple universal mechanism will open prospective ways for several applications in wide-area ad hoc networks, smart grids, and urban planning.

show abstract

“…This paper studies a simple network model where random transits, represented by a random walker, stimulate short-cut creations in the network [25,26]. The rule is that new edges are created between the vertex where the random walker is situated currently and the vertex where the random walker was two time-steps before.…”

mentioning

confidence: 99%

Impact of initial lattice structures on networks generated by traces of random walks

Ikeda

2010

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

Network formed by traces of random walks

Cited by 10 publications

References 22 publications

Hadoop Cellular Automata for Identifying Rumor in Social Networks

Hadoop Cellular Automata for Identifying Rumor in Social Networks

Self-organized network design by link survivals and shortcuts

Impact of initial lattice structures on networks generated by traces of random walks

Contact Info

Product

Resources

About