Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On Spreading a Rumor - MaRDI portal

On Spreading a Rumor

From MaRDI portal
Publication:3756252

DOI10.1137/0147013zbMath0619.60068OpenAlexW1984977694MaRDI QIDQ3756252

Boris G. Pittel

Publication date: 1987

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0147013




Related Items (62)

Trust in cohesive communitiesDiffusion without false rumors: On propagating updates in a Byzantine environment.Simple and optimal randomized fault-tolerant rumor spreadingOn the runtime and robustness of randomized broadcastingBroadcasting on paths and cyclesOn mixing and edge expansion properties in randomized broadcastingHow to run a campaign: optimal control of SIS and SIR information epidemicsAn Introduction to Temporal Graphs: An Algorithmic PerspectiveThe state complexity of random DFAsStochastic analysis of rumor spreading with multiple pull operationsAgent-based randomized broadcasting in large networksOn broadcasting time in the model of travelling agentsAsynchronous rumor spreading on random graphsDiameter and broadcast time of random geometric graphs in arbitrary dimensionsInformation Spreading in a Large Population of Active Transmitters and Passive ReceiversRandomised broadcasting: memory vs. randomnessUnnamed ItemBreathe before speaking: efficient information dissemination despite noisy, limited and anonymous communicationContinuous-time stochastic analysis of rumor spreading with multiple operationsRumors' spread: a game theoretical approach with the replicator dynamicsOn the probability of rumour survival among scepticsA model for the spreading of fake newsSpread mechanism and control strategy of social network rumors under the influence of COVID-19How fast can we reach a target vertex in stochastic temporal graphs?Can the indifferent population affect the spread of rumors?Messy broadcasting - decentralized broadcast schemes with limited knowledgeQuasi-random rumor spreading: reducing randomness can be costlyContagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network AlgorithmsA random walk model for infection on graphs: spread of epidemics \& rumours with mobile agentsAsymptotics for pull on the complete graphEfficient randomised broadcasting in random regular networks with applications in peer-to-peer systemsOn Mixing and Edge Expansion Properties in Randomized BroadcastingOn linear-time data dissemination in dynamic rooted treesProbabilistic Analysis of Rumor-Spreading TimeThe worst case behavior of randomized gossip protocolsParsimonious flooding in dynamic graphsInformation Spreading in Dynamic Networks: An Analytical ApproachFaster rumor spreading with multiple callsRumor spreading in social networksModeling cyber rumor spreading over mobile social networks: a compartment approachExpected coalescence time for a nonuniform allocation processEfficient Broadcasting in Random Power Law NetworksRumor spreading in random evolving graphsRandom coloring evolution on graphsRumor processes on \(\mathbb N\) and discrete renewal processesOn randomized broadcasting in star graphsAsymptotics for push on the complete graphDeterministic models for rumor transmissionOptimal control of information epidemics modeled as Maki Thompson rumorsViral Processes by Random Walks on Random Regular GraphsFirst passage percolation on sparse random graphs with boundary weightsHow fast can we reach a target vertex in stochastic temporal graphsNoisy rumor spreading and plurality consensusSub-linear Universal Spatial Gossip ProtocolsBreaking the \(\log n\) barrier on rumor spreadingModeling and analysis of rumor spreading with social reinforcement mechanismA Time-Randomness Tradeoff for Quasi-Random Rumour SpreadingQuasirandom broadcasting on the complete graph is as fast as randomized broadcastingAn Introduction to Temporal Graphs: An Algorithmic Perspective*Viral processes by random walks on random regular graphsUnnamed ItemCommunication complexity of quasirandom rumor spreading







This page was built for publication: On Spreading a Rumor