A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Rumor Spreading in Random Evolving Graphs
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
We consider the edge-Markovian evolving graph model which captures natural temporal dependencies between the structure of the network at time t, and the one at time t + 1. ...
In this paper, we aim at analyzing the classical information spreading Push protocol in dynamic networks. ...
of the rumor spreading algorithm. ...
doi:10.1007/978-3-642-40450-4_28
fatcat:ovrox5xlrrd4vpryuubwetik3q
Rumor Spreading in Random Evolving Graphs
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We consider the "edge-Markovian" evolving graph model which captures natural temporal dependencies between the structure of the network at time t, and the one at time t+1. ...
We prove that, in this realistic scenario, the Push protocol does perform well, completing information spreading in O( n) time steps w.h.p. ...
We believe that the most challenging question is to analyze rumor spreading over more general classes of evolving graphs where edges may be not independent: for instance, it would be interesting to analyze ...
arXiv:1302.3828v1
fatcat:b3a2ufl7yfbmdmlfh7k4sjxlhu
Rumor spreading in random evolving graphs
2015
Random structures & algorithms (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the edge-Markovian evolving graph model which captures natural temporal dependencies between the structure of the network at time t, and the one at time t + 1. ...
In this paper, we aim at analyzing the classical information spreading Push protocol in dynamic networks. ...
of the rumor spreading algorithm. ...
doi:10.1002/rsa.20586
fatcat:ygubvaldrrg3tmqqwhihswmjyq
Rumor evolution in social networks
2013
Physical Review E
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Indeed, the rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped, and told. ...
Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn out to be a rumor as well. ...
The rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped, and told [1] . ...
doi:10.1103/physreve.87.032133
fatcat:sk7x4xnthfhmdaou4r22x4z4xe
Why rumors spread so quickly in social networks
2012
Communications of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the contrary, they are not designed at all, but have evolved in a random and decentralized manner. ...
To answer these questions, we simulate a simple rumor spreading process on several graphs having the structure of existing large social networks. ...
On the contrary, they are not designed at all, but have evolved in a random and decentralized manner. ...
doi:10.1145/2184319.2184338
fatcat:4v7imawtbnd2hla7uz3jns6g3e
Pull and Push&Pull in Random Evolving Graphs
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The Push, the Pull and the Push&Pull algorithms are well-studied rumor spreading protocols. In all three, in the beginning one node of a graph is informed. ...
In one setting they investigated, in each round the underlying graph is a newly sampled Erdős-Rényi random graph G(n,p). ...
We use this framework to investigate Pull and Push&Pull in random evolving graphs. ...
arXiv:1801.00316v2
fatcat:jpzqx2h33nbxne2y3tfwpl77im
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider spread time of the algorithm in any dynamic evolving network, G={G^(t)}_t=0^∞, which is a sequence of graphs exposed at discrete time step t=0,1.... ...
The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. ...
Introduction Randomized rumor spreading algorithms spread a piece of information, the so-called rumor, in a given network. ...
arXiv:2005.07859v1
fatcat:bh3guh6h5zhstop6xopi4beooy
Experimental Analysis of Rumor Spreading in Social Networks
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Randomized rumor spreading was recently shown to be a very efficient mechanism to spread information in preferential attachment networks. ...
For the asynchronous version of the rumor spreading protocol, we observe that the theoretically predicted asymptotic advantage of preferential attachment graphs is smaller than expected. ...
This is remarkable as social networks evolve in a random and decentralized manner and are not designed with this purpose in mind. ...
doi:10.1007/978-3-642-34862-4_12
fatcat:qlozimt5srdr5m7on4adeactpa
Finding Rumor Sources on Random Trees
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In a recent work ref:rc this rumor source detection problem was introduced and studied. The authors proposed the graph score function rumor centrality as an estimator for detecting the source. ...
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when ...
Given such 'locally tree-like' structural properties, if a rumor spreads on a random d-regular graph or sparse Erdos-Renyi graph for time o(log m) starting from a random node, then rumor centrality can ...
arXiv:1110.6230v3
fatcat:pb4lnyj7vjcu5hse5vgvimvczu
Finding Rumor Sources on Random Trees
2016
Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when ...
This paper overcomes this limitation and establishes the effectiveness of rumor centrality for source detection for generic random trees and the SI model with a generic spreading time distribution. ...
We shall call an undirected graph a tree if it is connected and it does not have any cycles. ...
doi:10.1287/opre.2015.1455
fatcat:ncowh3pxj5d7vizmqwgynqcuhe
Asynchronous Rumor Spreading in Preferential Attachment Graphs
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the asynchronous push-pull protocol spreads rumors in preferential attachment graphs (as defined by Barabási and Albert) in time O( √ log n) to all but a lower order fraction of the nodes ...
In this paper, we revisit the rumor spreading problem in PA graphs, i.e., the spread of one piece of information in a graph. The classical rumor spreading process is modeled on a discrete time line. ...
In this section, all probabilities are taken over the product space of the random graph G and the random decisions of the rumor spreading process. ...
doi:10.1007/978-3-642-31155-0_27
fatcat:tzyy5mhx7zhxthdrk475qxaace
Randomized Rumor Spreading in Poorly Connected Small-World Networks
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. ...
In each round, every informed node sends the rumor to a random neighbor, and every uninformed node contacts a random neighbor and gets the rumor from her if she knows it. ...
Sometimes it is convenient to view this as a 'random graph evolving in time.' ...
arXiv:1410.8175v1
fatcat:e2y2aaumovb2zjukw2yxd726yq
Critical threshold and dynamics of a general rumor model on complex networks
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumor spreading rate below which a rumor cannot propagate in the system. ...
We find that the initial rate at which a rumor spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased ...
In particular, we find the presence of a critical value for the rumor spreading rate (a rumor threshold) below which rumors cannot spread in random graphs, and its absence in scale-free networks with unbounded ...
arXiv:physics/0508008v1
fatcat:ez2knhlecje35hkm3fghu736ce
Dynamic graph convolutional networks with attention mechanism for rumor detection on social media
2021
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this study, we propose novel graph convolutional networks with attention mechanisms, named Dynamic GCN, for rumor detection. ...
The representation learning on graph snapshots with attention mechanism captures both structural and temporal information of rumor spreads. ...
In this study, motivated by the dynamic nature of rumor propagation, we present a novel graph convolutional network-based model, named Dynamic GCN, to better understand the evolving pattern of rumor propagation ...
doi:10.1371/journal.pone.0256039
pmid:34407111
pmcid:PMC8372894
fatcat:ygdo3znl3vduxhcpt3turs3h24
On spreading rumor in heterogeneous systems
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we consider a model of spreading information in heterogeneous systems wherein we have two kinds of objects. Some of them are active and others are passive. ...
In this paper we provide mathematical models of such process and show rigid and very precise mathematical analysis for some special cases important from practical point of view. ...
Thus, the considered model is a kind of a push and pull rumor spreading scheme. We are interested in the expected time of total spreading of the information. ...
arXiv:1612.01061v1
fatcat:buwo5l5e25gl7dfb7o4idvrdqe
« Previous
Showing results 1 — 15 out of 1,893 results