Добірка наукової літератури з теми "Rumour Spreading"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Rumour Spreading".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Rumour Spreading"
Sun, Zhonggen, Xin Cheng, Ruilian Zhang, and Bingqing Yang. "Factors Influencing Rumour Re-Spreading in a Public Health Crisis by the Middle-Aged and Elderly Populations." International Journal of Environmental Research and Public Health 17, no. 18 (September 8, 2020): 6542. http://dx.doi.org/10.3390/ijerph17186542.
Повний текст джерелаNiranjan, Utkarsh, Anurag Singh, and Ramesh Kumar Agrawal. "A mean-field-theoretic model for dual information propagation in networks." Journal of Complex Networks 7, no. 4 (January 7, 2019): 585–602. http://dx.doi.org/10.1093/comnet/cny033.
Повний текст джерелаPANAGIOTOU, KONSTANTINOS, XAVIER PÉREZ-GIMÉNEZ, THOMAS SAUERWALD, and HE SUN. "Randomized Rumour Spreading: The Effect of the Network Topology." Combinatorics, Probability and Computing 24, no. 2 (May 6, 2014): 457–79. http://dx.doi.org/10.1017/s0963548314000194.
Повний текст джерелаAngel, Omer, Abbas Mehrabian, and Yuval Peres. "The string of diamonds is nearly tight for rumour spreading." Combinatorics, Probability and Computing 29, no. 2 (November 4, 2019): 190–99. http://dx.doi.org/10.1017/s0963548319000385.
Повний текст джерелаNekovee, M., Y. Moreno, G. Bianconi, and M. Marsili. "Theory of rumour spreading in complex social networks." Physica A: Statistical Mechanics and its Applications 374, no. 1 (January 2007): 457–70. http://dx.doi.org/10.1016/j.physa.2006.07.017.
Повний текст джерелаOstilli, Massimo, Eiko Yoneki, Ian X. Y. Leung, Jose F. F. Mendes, Pietro Lió, and Jon Crowcroft. "Statistical mechanics of rumour spreading in network communities." Procedia Computer Science 1, no. 1 (May 2010): 2331–39. http://dx.doi.org/10.1016/j.procs.2010.04.262.
Повний текст джерелаZhang, Zi-li, and Zi-qiong Zhang. "An interplay model for rumour spreading and emergency development." Physica A: Statistical Mechanics and its Applications 388, no. 19 (October 2009): 4159–66. http://dx.doi.org/10.1016/j.physa.2009.06.020.
Повний текст джерелаDoerr, Benjamin, and Mahmoud Fouz. "A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading." Electronic Notes in Discrete Mathematics 34 (August 2009): 335–39. http://dx.doi.org/10.1016/j.endm.2009.07.055.
Повний текст джерелаBelen, Selma, C. Yalçin Kaya, and C. E. M. Pearce. "Impulsive control of rumours with two broadcasts." ANZIAM Journal 46, no. 3 (January 2005): 379–91. http://dx.doi.org/10.1017/s1446181100008324.
Повний текст джерелаde Arruda, Guilherme Ferraz, Elcio Lebensztayn, Francisco A. Rodrigues, and Pablo Martín Rodríguez. "A process of rumour scotching on finite populations." Royal Society Open Science 2, no. 9 (September 2015): 150240. http://dx.doi.org/10.1098/rsos.150240.
Повний текст джерелаДисертації з теми "Rumour Spreading"
Vera, Azócar Alberto Abel. "Adaptive rumor spreading." Tesis, Universidad de Chile, 2015. http://repositorio.uchile.cl/handle/2250/134778.
Повний текст джерелаIngeniero Civil Industrial
El esparcimiento de rumores es un modelo intuitivo para la difusión de información en una red social. Una entidad que controla la red, por ejemplo el proveedor del servicio, desea acelerar el proceso de esparcimiento del rumor, de forma tal que se maximice la cantidad de información entregada. Este problema, definido a grandes rasgos, ha sido objeto de múltiples investigaciones en el último tiempo, entre otros como marketing viral y maximización de influencia. Un enfoque natural y ausente en los estudios previos es la adaptividad. En este trabajo se abordan las siguientes preguntas: ¿cómo el controlador puede usar la información del estado de la red para acelerar el proceso de rumor? y ¿cuánto beneficio se obtiene de tal conocimiento? Un concepto novedoso es la comunicación oportunista en redes; cada agente de la red social comparte información (noticias, actualización de software, etc.) con otros usuarios al momento de estar momentáneamente en rango (vía wi-fi, bluetooth, etc.), de esta forma se evita la saturación de la infraestructura que soporta la red. Con esta motivación se estudia un modelo a tiempo continuo, donde cada par de nodos se comunica de acuerdo a un proceso de Poisson de cierta tasa y el rumor se transmite siempre que alguno estuviera informado. Las anteriores comunicaciones no tienen costo para el controlador, pero si éste lo desea puede informar a cualquier nodo pagando un costo unitario por ello. En vez de la usual restricción de presupuesto se fija un deadline, en tal tiempo todos los nodos deben estar informados, debiendo pagar el controlador un costo unitario por cada nodo que no haya obtenido el rumor antes del deadline. Una estrategia no-adaptativa puede informar sólo al comienzo del periodo y cuando se cumple el deadline, pagando por todos aquellos nodos que no se comunicaron nunca con otro nodo informado. Una estrategia adaptativa puede intervenir la red en cualquier instante, usando toda la información disponible hasta ese entonces, en particular sabiendo cuales nodos tienen el rumor en cada momento. El resultado principal de este trabajo es que en el caso homogéneo, donde cada par de nodos se encuentra con la misma tasa, el beneficio de la adaptividad está acotado por una constante. La demostración requiere un entendimiento profundo del proceso estocástico que domina el sistema, que se cree ya una contribución interesante. Adicionalmente, se presenta una extensión natural del caso homogéneo, donde el controlador está interesado sólo en un conjunto de nodos y no en toda la red social, se demuestra que en este escenario el beneficio de la adaptividad también está acotado por una constante. Finalmente, se muestra que, sin el supuesto de homogeneidad, el beneficio de la adaptividad puede crecer de forma no acotada.
Fouz, Mahmoud [Verfasser], and Benjamin [Akademischer Betreuer] Doerr. "Randomized rumor spreading in social networks and complete graphs / Mahmoud Fouz. Betreuer: Benjamin Doerr." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2012. http://d-nb.info/1052549861/34.
Повний текст джерелаKostrygin, Anatolii. "Precise Analysis of Epidemic Algorithms." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX042/document.
Повний текст джерелаEpidemic algorithms are distributed algorithms in which the agents in thenetwork involve peers similarly to the spread of epidemics. In this work, we focus on randomized rumor spreading -- a class of epidemic algorithms based on the paradigm that nodes call random neighbors and exchange information with these contacts. Randomized rumor spreading has found numerous applications from the consistency maintenance of replicated databases to newsspreading in social networks. Numerous mathematical analyses of different rumor spreading algorithms can be found in the literature. Some of them provide extremely sharp estimates for the performance of such processes, but most of them are based on the inherent properties of concrete algorithms.We develop new simple and generic method to analyze randomized rumor spreading processes in fully connected networks. In contrast to all previous works, which heavily exploit the precise definition of the process under investigation, we only need to understand the probability and the covariance of the events that uninformed nodes become informed. This universality allows us to easily analyze the classic push, pull, and push-pull protocols both in their pure version and in several variations such as when messages fail with constant probability or when nodes call a random number of others each round. Some dynamic models can be analyzed as well, e.g., when the network is a random graph sampled independently each round [Clementi et al. (ESA 2013)]. Despite this generality, our method determines the expected rumor spreading time precisely apart from additive constants, which is more precise than almost all previous works. We also prove tail bounds showing that a deviation from the expectation by more than an additive number of r rounds occurs with probability at most exp(−Ω(r)).We further use our method to discuss the common assumption that nodes can answer any number of incoming calls. We observe that the restriction that only one call can be answered leads to a significant increase of the runtime of the push-pull protocol. In particular, the double logarithmic end phase of the process now takes logarithmic time. This also increases the message complexity from the asymptotically optimal Θ(n log log n) [Karp, Shenker, Schindelhauer, Vöcking (FOCS 2000)] to Θ(n log n). We propose a simple variation of the push-pull protocol that reverts back to the double logarithmic end phase and thus to the Θ(n log log n) message complexity
Oliveros, Didier Augusto Vega. "Dinâmicas de propagação de informações e rumores em redes sociais." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-13092017-102818/.
Повний текст джерелаOn-line Social networks become a new and important medium of exchange of information, ideas and communication that approximate relatives and friends no matter the distances. Given the open nature of the Internet, the information can flow very easy and fast in the population. The network can be represented as a graph, where individuals or organizations are the set of vertices and the relationship or connection among the vertices are the set of edge. Moreover, the social networks are also intrinsically representing the structure of a more complex system that is the society. These structures are related with characteristics of the subjects, like the most popular individuals have many connections, the correlation in the connectivity of vertices that is a trace of homophily phenomenon, among many others. In particular, it is well accepted that the structure of the network can affect the way the information propagates on the social networks. However, how the structure impacts in the propagation, how to measure that impact and what are the strategies for controlling the propagation of some information, it is still unclear. In this thesis, we seek to contribute in the analysis of the interplay between the dynamics of information and rumor spreading and the structure of the networks. We propose a more realistic propagation model considering the heterogeneity of the individuals in the transmission of ideas or information. We confirm the presence of influential spreaders in the rumor propagation process and found that selecting a very small fraction of influential spreaders, it is possible to expressively improve or reduce de diffusion of some information on the network. In the case we want to select a set of initial spreaders that maximize the information diffusion on the network, the simple and best alternative is to select the most central or important individuals from the networks communities. But, if the pattern of connection of the networks is negatively correlated, the best alternative is to choose from the most central individuals in the whole network. On the other hand, we identify, by topological approach and machine learning techniques, the least influential spreaders and show that they act as a firewall in the propagation process. We propose an adaptative method that rewires one edge for a given vertex to a central individual, without affecting the overall distribution of connection. Applying our proposed method in a little fraction of least influential spreaders, we observed an important increasing in the capacity of propagation of these vertices and in the overall network. Our results are from a wide range of simulations in artificial and real-world data sets and the comparison with the classical rumor propagation model. The propagation of information is of greatest relevance for publicity and marketing area, education, political or health campaigns, among others. The results of this these might be applicable and extended in different research fields like biological networks and animal social behavior models.
Josefsson, Joakim, Jesper Jarl, and Mikael Lödöen. "Den kaotiska ryktesspridningen : En teorijämförelse av begreppet word of mouth och appliceringen av den utredda definitionen på Internetforumet Prisjakt.nu." Thesis, Jönköping University, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-1202.
Повний текст джерелаDagens samhälle är präglat av ett enormt reklamutbud och reklamstrategier. I denna djungel av marknadsföring har företag ibland valt en annan strategi, en relativt outnyttjad strategi, som baseras på rykten om produkten, tjänsten eller företaget och är det som används som marknadsföring. Denna strategi kallas för word of mouth. Ena syftet har varit att undersöka hur word of mouth definieras av olika författare. Genom att göra en jämförelse av teorier av begreppet word of mouth har ett försök gjorts att skapa en definition av begreppet, som tillämpas på vårt andra syfte med undersökningen. Det andra syftet är att undersöka om kommunikationen på det utvalda internetforum prisjakt.nu kan liknas vid vår definition av word of mouth. Genom vår undersökning ville vi exemplifiera vad word of mouth är och vilket som är dess användningsområde. Forskningen har därför genomförts genom en litteraturstudie där word of mouth som begrepp har kartlagts och förklarats. Genom litteraturstudien utvecklades sedan en jämförelse av teorier av begreppet word of mouth. Dessa jämförelser av begreppet gjorde det möjligt för oss att kunna applicera begreppet på det tidigare nämnda utvalda internetforum. När slutdefinitionen fanns tillhanda, utfördes studien på Internetforumet Prisjakt.nu, med inriktning på en produkt som det pratades mycket om på detta Internetforum. Denna produkt valdes strategiskt då vi ansåg att det var väsentligt för undersökningen att produkten ännu inte fanns på marknaden, då tidigare teorier om word of mouths beteende tydde på att frekvensen på kommunikation om produkten var som högst innan produkten släppts. Denna produkt var Apple Iphone, som då ännu inte lanserats i Sverige. Därefter genomfördes studien med vår definition av traditionell och generaliserad word of mouth som teoretisk utgångspunkt, och studien resulterade i att förekomsten var positiv för word of mouth-baserad kommunikation på internetforumet prisjakt.nu. Vår definition av begreppet word of mouth lyder så som följer: “Word of mouth är interpersonell kommunikation, där självgenererande ryktesspridning om personer, företag, produkter eller tjänster kan ske via telefon, Internet eller mun-till-mun-kommunikation”. Kommunikationen på det undersökta forumet innehåller en hög grad av interpersonell kommunikation, självgenererande ryktesspridning och har en kommersiell karaktär på dess kommunikation, och uppfyller således de tre delar som enligt vår definition behövs för att kalla det en word of mouth-baserad kommunikation.
Today’s society is characterized by an enormously large advertising range and commercial strategies. In this jungle of marketing companies often chosen another strategy, a comparatively unknown strategy based on rumors about a product, service or company as marketing. That strategy is called word of mouth. The purpose of examine word of mouth as concept is important, because today the concept is defined on various manner of several different authors. By making a theory comparison of the conception word of mouth it is possible to create a good definition of the concept, this because that the concept word of mouth lacks a definite definition, that can be applied on our second purpose. The second purpose is to examine if the communication on the selected internet forum prisjakt.nu is word of mouth. In earlier cases this would been examined according to electronic word of mouth that is an adjustment to the internet, but we felt that the concept almost was identical to other word of mouth-theories we choose to make a theory comparison of the concept as described above. Through our examination we wanted to exemplify what word of mouth is and what it can be used for. A literature study was done as a replacement for the earlier research, the earlier research missed an evident significance of the conception word of mouth, and it handled its usage. The research had therefore been made through a literature study where the concept has been plotted and explained. Through the literature study the theory comparison of the concept word of mouth developed. . The theory comparison made it possible for us to apply the concept on the earlier mentioned internet forum. When the finished definition was at hand, the study was made on the internet forum prisjakt.nu, with the concentration on a product that had a big talk about it on this internet forum. This product was strategically selected as we considered it as an essential part for the research as the product didn’t even exist on the market; this due to the earlier theory’s about word of mouths behaviour that indicated that the frequency of the communication about the product was highest just before the product was released in the USA. The product was the Apple Iphone, and has after this research not yet been released in Sweden.The result shows that our definition of word of mouth can be applied on internet forums and that a separate concept for word of mouth on the internet is unnecessary. Our definition of word of mouth is as follows: “Word of mouth is an interpersonal communication, where self generating rumour spreading about people, companies, products or services can be made via telephone, internet or by mouth-to-mouth-communication“. The communication on the studied forums contain a high pitch of interpersonal communication, self generating rumour spread and have a commercialized character on it’s communication and fulfil the three parts that according of our theory comparison is needed for being called word of mouth-based communication.
Taghavianfar, Mohsen. "An Investigation on Network Entropy-Gossiping Protocol and Anti-entropy Evaluation." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2684.
Повний текст джерелаGossiping Protocols, are inherently random in behavior.Nonetheless, they are not structure-less. Their asymptotic behavior when implemented in large scales is the matter of focus in this thesis.
Tel: +46709700505 Address: Pinnharvsgatan 3 E lgh 1202 43147 Mölndal Sweden
Huber, Anna [Verfasser]. "Randomized rounding and rumor spreading with stochastic dependencies / vorgelegt von Anna Huber." 2010. http://d-nb.info/1008296163/34.
Повний текст джерелаshih-chieh, Chang, and 張世杰. "A Study of the Securities Market Manipulation ─ focusing on spreading rumors and false information." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/26962716161365869789.
Повний текст джерела南台科技大學
財經法律研究所
100
The goal of formulation of Securities and Exchange Act of Taiwan, R.O.C. is “develops the national economy” and “the safeguard investment”. One of the most important functions of Securities Exchange Market, lies in forms the moderate price. Article 155 of Securities Exchange Act, so called “anti-manipulation clause” is designed for this purpose.There are six kinds of manipulation in Article 155 of Securities Exchange Act. And this thesis focusing on spreading rumors and false information of paragraph1, subparagraph 6 of Article 155 of Securities Exchange Act. The Securities and Exchange Act of Taiwan, R.O.C., Section 155, is specifically made for this kind of market manipulation, so called “Anti-manipulation provision”. There are five types of manipulation in this specific term and this study will be focusing on “spreading rumors or false information” in the Securities and Exchange Act of Taiwan, R.O.C., Section 155, Provision 1, Article 6. Here we are going to understand every type of the manipulation then compare them with the legislation of the U.S. and Japan. In the end, analyzing the key factors and related problems concerning the application of the “Illegal price-fixing by spreading rumors or false information”, also identify the problems from the actual cases then make relevant amendment.
Hsu, Chan-Jung, and 許展榕. "The study on the boundaries between press freedom and securities market manipulation — focusing on spreading rumors and false information." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/susd9p.
Повний текст джерела銘傳大學
法律學系碩士班
97
The securities market is a prospective index of the economic development of a nation, the prosperity or depression of which would influence investors’ behavior. Securities, which are different from personal property and real estate, hold abstract and flexible values. Investors estimate the value of securities through factors such as corporate prospects, profitability, political and economic trend, and surrounding environment. This function could not be achieved if the market power is manipulated. As a result, manipulation should be prohibited. Article 155 of Securities Exchange Act, so called “anti-manipulation clause” is designed for this purpose.There are six kinds of manipulation in Article 155 of Securities Exchange Act. And this thesis focusing on spreading rumors and false information of paragraph1, subparagraph 6 of Article 155 of Securities Exchange Act. This thesis indicates that securities market manipulation and securities frauds are one object with two sides. It is very hard to definite the market manipulation. According to the principle of "nulla poena sine lege", the legislation of market manipulation must based on the theory of securities frauds. There are no any limits to the subject of the crime of spreading rumors or false information to manipulate prices. Spreading mean that seminate on uncertain peoples. False information means that inconsistent description of the truth. The discussion on the false information is always focused on the fraudulent financial statement. Rumors means the gossip which entirely groundless. The opinion of government officials is closed the life of general public on the discussion of the rumor.Besides, the analyst recommendations of securities firms still be discussed which constitute the crime of spreading rumors or false information to manipulate prices. Mess media have penetration and influence on the modern society.Maybe it will be the subject of the crime of spreading rumors or false information to manipulate prices. This thesis indicates that mess media have the effect on the securities market in Taiwan. It can be the subject of the crime of spreading rumors or false information to manipulate prices.But it must find out the subjective wrongful intent of frauds on the perpetrator. This thesis investigates related issues on the basis of the crime of spreading rumors or false information to manipulate prices. Finally, this thesis analyzes the precondition and application of this crime and brings out advices about its modification.
FAN, CHENG-JUI, and 范成瑞. "A Study of the Securities Fraud and the Securities Market Manipulation-focusing on the General Antifraud Provisions of securities exchange act and spreading rumors and false Information." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/snesfd.
Повний текст джерелаКниги з теми "Rumour Spreading"
Cracking the Code: Spreading Rumors. Nelson Publishing & Marketing, 2012.
Знайти повний текст джерелаLicate, Jennifer, and Suzanne Beaky. Why Is He Spreading Rumors about Me? Lulu Press, Inc., 2022.
Знайти повний текст джерелаLicate, Jennifer. Why Is He Spreading Rumors about Me? Teacher and Counselor Activity Guide. Boys Town Press, 2022.
Знайти повний текст джерелаAsseraf, Arthur. Electric News in Colonial Algeria. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198844044.001.0001.
Повний текст джерелаЧастини книг з теми "Rumour Spreading"
Acan, Hüseyin, Andrea Collevecchio, Abbas Mehrabian, and Nick Wormald. "On the Push&Pull Protocol for Rumour Spreading." In Trends in Mathematics, 3–10. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51753-7_1.
Повний текст джерелаCorrea, José, Marcos Kiwi, Neil Olver, and Alberto Vera. "Adaptive Rumor Spreading." In Web and Internet Economics, 272–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48995-6_20.
Повний текст джерелаChierichetti, Flavio, Silvio Lattanzi, and Alessandro Panconesi. "Rumor Spreading in Social Networks." In Automata, Languages and Programming, 375–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02930-1_31.
Повний текст джерелаDoerr, Benjamin, and Mahmoud Fouz. "Asymptotically Optimal Randomized Rumor Spreading." In Automata, Languages and Programming, 502–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22012-8_40.
Повний текст джерелаBronner, Stephen Eric. "Spreading the News: The Protocols Triumphant." In A Rumor about the Jews, 83–109. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95396-0_5.
Повний текст джерелаPanagiotou, Konstantinos, and Leo Speidel. "Asynchronous Rumor Spreading on Random Graphs." In Algorithms and Computation, 424–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45030-3_40.
Повний текст джерелаPanagiotou, Konstantinos, Ali Pourmiri, and Thomas Sauerwald. "Faster Rumor Spreading with Multiple Calls." In Algorithms and Computation, 446–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45030-3_42.
Повний текст джерелаDaum, Sebastian, Fabian Kuhn, and Yannic Maus. "Rumor Spreading with Bounded In-Degree." In Structural Information and Communication Complexity, 323–39. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48314-6_21.
Повний текст джерелаClementi, Andrea, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, and Riccardo Silvestri. "Rumor Spreading in Random Evolving Graphs." In Lecture Notes in Computer Science, 325–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40450-4_28.
Повний текст джерелаBerenbrink, Petra, Robert Elsässer, and Thomas Sauerwald. "Communication Complexity of Quasirandom Rumor Spreading." In Algorithms – ESA 2010, 134–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15775-2_12.
Повний текст джерелаТези доповідей конференцій з теми "Rumour Spreading"
Chierichetti, Flavio, Silvio Lattanzi, and Alessandro Panconesi. "Rumour spreading and graph conductance." In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611973075.135.
Повний текст джерелаKarelin, Vladimir V., Vladimir M. Bure, Lyudmila N. Polyakova, and Michail V. Svirkin. "A stochastic model of rumour spreading." In 2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA). IEEE, 2017. http://dx.doi.org/10.1109/cnsa.2017.7973968.
Повний текст джерелаChierichetti, Flavio, Silvio Lattanzi, and Alessandro Panconesi. "Almost tight bounds for rumour spreading with conductance." In the 42nd ACM symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1806689.1806745.
Повний текст джерелаAcan, Huseyin, Andrea Collevecchio, Abbas Mehrabian, and Nick Wormald. "On the Push&Pull Protocol for Rumour Spreading." In PODC '15: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2767386.2767416.
Повний текст джерелаWang, Ping, Yixia Hu, and Qiao Li. "The Trust-Building Process in the Social Media Environment of Rumour Spreading." In GROUP '20: The 2020 ACM International Conference on Supporting Group Work. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3323994.3369882.
Повний текст джерелаCollard, Martine, Philippe Collard, Laurent Brisson, and Erick Stattner. "Rumor Spreading Modeling." In ASONAM '15: Advances in Social Networks Analysis and Mining 2015. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2808797.2809299.
Повний текст джерелаBrach, Paweł, Alessandro Epasto, Alessandro Panconesi, and Piotr Sankowski. "Spreading rumours without the network." In the second edition of the ACM conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2660460.2660472.
Повний текст джерелаGiakkoupis, George, and Thomas Sauerwald. "Rumor Spreading and Vertex Expansion." In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973099.129.
Повний текст джерелаDoerr, Benjamin, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, and Martin Schirneck. "Island models meet rumor spreading." In GECCO '17: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3071178.3071206.
Повний текст джерелаKostkova, Patty, Vino Mano, Heidi J. Larson, and William S. Schulz. "Who is Spreading Rumours about Vaccines?" In DH '17: International Conference on Digital Health. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3079452.3079505.
Повний текст джерела