Academic literature on the topic 'Online social networks – Mathematical models'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Online social networks – Mathematical models.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Online social networks – Mathematical models"
Bonato, Anthony, Noor Hadi, Paul Horn, Paweł Prałat, and Changping Wang. "Models of Online Social Networks." Internet Mathematics 6, no. 3 (January 2009): 285–313. http://dx.doi.org/10.1080/15427951.2009.10390642.
Full textJiang, Ping, and Xiangbin Yan. "Stability analysis and control models for rumor spreading in online social networks." International Journal of Modern Physics C 28, no. 05 (March 9, 2017): 1750061. http://dx.doi.org/10.1142/s0129183117500619.
Full textGabdrakhmanova, Nailia, and Maria Pilgun. "Intelligent Control Systems in Urban Planning Conflicts: Social Media Users’ Perception." Applied Sciences 11, no. 14 (July 17, 2021): 6579. http://dx.doi.org/10.3390/app11146579.
Full textGovindankutty, Sreeraag, and Shynu Padinjappurathu Gopalan. "SEDIS—A Rumor Propagation Model for Social Networks by Incorporating the Human Nature of Selection." Systems 11, no. 1 (December 29, 2022): 12. http://dx.doi.org/10.3390/systems11010012.
Full textGnedash, Anna, and Veronika Katermina. "Abortion Ban in English Social Media in 2022: Pragmatic Linguistics of Online Communications." Virtual Communication and Social Networks 2022, no. 4 (December 22, 2022): 172–78. http://dx.doi.org/10.21603/2782-4799-2022-1-4-172-178.
Full textDU, FANG, QI XUAN, and TIE-JUN WU. "EMPIRICAL ANALYSIS OF ATTENTION BEHAVIORS IN ONLINE SOCIAL NETWORKS." International Journal of Modern Physics C 21, no. 07 (July 2010): 955–71. http://dx.doi.org/10.1142/s0129183110015592.
Full textAttri, Vikas. "Comparative study of Existing Models for Online Social Network." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (April 11, 2021): 483–90. http://dx.doi.org/10.17762/turcomat.v12i2.856.
Full textLuo, Peng, Chong Wu, and Yongli Li. "Link prediction measures considering different neighbors’ effects and application in social networks." International Journal of Modern Physics C 28, no. 03 (March 2017): 1750033. http://dx.doi.org/10.1142/s0129183117500334.
Full textLiu, Xiaoyang, Chao Liu, and Xiaoping Zeng. "Online Social Network Emergency Public Event Information Propagation and Nonlinear Mathematical Modeling." Complexity 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/5857372.
Full textKuzmenko, O., H. Yarovenko, and L. Skrynka. "ANALYSIS OF MATHEMATICAL MODELS FOR COUNTERING CYBER FRAUD IN BANKS." Vìsnik Sumsʹkogo deržavnogo unìversitetu 2022, no. 2 (2022): 111–20. http://dx.doi.org/10.21272/1817-9215.2022.2-13.
Full textDissertations / Theses on the topic "Online social networks – Mathematical models"
Tang, Hon Cheong 1980. "Gravity-based trust model for web-based social networks." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112366.
Full textBao, Qing. "Inferring diffusion models with structural and behavioral dependency in social networks." HKBU Institutional Repository, 2016. https://repository.hkbu.edu.hk/etd_oa/305.
Full textBotha, Leendert W. "Modeling online social networks using Quasi-clique communities." Thesis, Stellenbosch : Stellenbosch University, 2011. http://hdl.handle.net/10019.1/17859.
Full textENGLISH ABSTRACT: With billions of current internet users interacting through social networks, the need has arisen to analyze the structure of these networks. Many authors have proposed random graph models for social networks in an attempt to understand and reproduce the dynamics that govern social network development. This thesis proposes a random graph model that generates social networks using a community-based approach, in which users’ affiliations to communities are explicitly modeled and then translated into a social network. Our approach explicitly models the tendency of communities to overlap, and also proposes a method for determining the probability of two users being connected based on their levels of commitment to the communities they both belong to. Previous community-based models do not incorporate community overlap, and assume mutual members of any community are automatically connected. We provide a method for fitting our model to real-world social networks and demonstrate the effectiveness of our approach in reproducing real-world social network characteristics by investigating its fit on two data sets of current online social networks. The results verify that our proposed model is promising: it is the first community-based model that can accurately reproduce a variety of important social network characteristics, namely average separation, clustering, degree distribution, transitivity and network densification, simultaneously.
AFRIKAANSE OPSOMMING: Met biljoene huidige internet-gebruikers wat deesdae met behulp van aanlyn sosiale netwerke kommunikeer, het die analise van hierdie netwerke in die navorsingsgemeenskap toegeneem. Navorsers het al verskeie toevalsgrafiekmodelle vir sosiale netwerke voorgestel in ’n poging om die dinamika van die ontwikkeling van dié netwerke beter te verstaan en te dupliseer. In hierdie tesis word ’n nuwe toevalsgrafiekmodel vir sosiale netwerke voorgestel wat ’n gemeenskapsgebaseerde benadering volg, deurdat gebruikers se verbintenisse aan gemeenskappe eksplisiet gemodelleer word, en dié gemeenskapsmodel dan in ’n sosiale netwerk omskep word. Ons metode modelleer uitdruklik die geneigdheid van gemeenskappe om te oorvleuel, en verskaf ’n metode waardeur die waarskynlikheid van vriendskap tussen twee gebruikers bepaal kan word, op grond van hulle toewyding aan hulle wedersydse gemeenskappe. Vorige modelle inkorporeer nie gemeenskapsoorvleueling nie, en aanvaar ook dat alle lede van dieselfde gemeenskap vriende sal wees. Ons verskaf ’n metode om ons model se parameters te pas op sosiale netwerk datastelle en vertoon die vermoë van ons model om eienskappe van sosiale netwerke te dupliseer. Die resultate van ons model lyk belowend: dit is die eerste gemeenskapsgebaseerde model wat gelyktydig ’n belangrike verskeidenheid van sosiale netwerk eienskappe, naamlik gemiddelde skeidingsafstand, samedromming, graadverdeling, transitiwiteit en netwerksverdigting, akkuraat kan weerspieël.
Morales, Matamoros Javier. "On-line norm synthesis for open Multi-Agent systems." Doctoral thesis, Universitat de Barcelona, 2016. http://hdl.handle.net/10803/396133.
Full textEls sistemes Multi-Agent (MAS) són sistemes computeritzats composats d’agents autònoms que interaccionen per resoldre problemes complexos. A un MAS, els agents requereixen algun mecanisme per a coordinar les seves activitats. A la literatura en Sistemes Multi-Agent, les normes han estat àmpliament utilitzades per coordinar les activitats dels agents. Per tant, donat un MAS, un dels majors reptes d’investigació és el de sintetizar el sistema normatiu, és a dir, la col·lecció de normes, que suporti la coordinació dels agents. Aquesta tesi es centra en la síntesi automàtica de normes per sistemes Multi-Agent oberts. A un MAS obert, la població d’agents pot canviar amb el temps, els agents poden ésser desenvolupats per terceres parts, i els comportaments dels agents són desconeguts per endavant. Aquestes condicions particulars fan especialment complicat sintetizar el sistema normatiu que reguli un sistema Multi-Agent obert. En general, la literatura en Sistemes Multi-Agent ha investigat dues aproximacions a la síntesi de normes: disseny off-line, i síntesi on-line. La primera aproximació consisteix a sintetizar un sistema normatiu en temps de disseny. Amb aquest propòsit, aquesta aproximació assumeix que l’espai d’estats d’un MAS és conegut en temps de disseny i no canvia en temps d’execució. Això va contra la natura dels sistemes Multi-Agent oberts, i per tant el disseny off-line no és apropiat per a sintetitzar les seves normes. Com a alternativa, la síntesi on-line considera que les normes són sintetizades en temps d’execució. La majoria de recerca en síntesi on-line s’ha centrat en la emergència de normes, que considera que els agents sintetizen les seves pròpies normes, per tant assumint que tenen la capacitat de sintetitzar-les. Aquestes condicions tampoc no es poden assumir en un MAS obert. Donat això, aquesta tesi introdueix un marc computacional per la síntesi on-line de normes en sistemes Multi-Agent oberts. Primer, aquest marc proveeix un model computacional per sintetizar normes per un MAS en temps d’execució. Aquest model computacional no requereix ni coneixement sobre els comportaments dels agents per endavant ni la seva participación en la síntesi de normes. En canvi, considera que una entitat reguladora observa les interaccions dels agents en temps d’execució, identificant situacions indesitjades per la coordinació i sintetizant normes que regulen aquestes situacions. El nostre model computacional ha estat dissenyat per a ésser de propòsit general per tal que pugui ser utilitzat a la síntesi de normes en un ampli ventall de dominis d’aplicació proporcionant només información clau sobre el domini. Segon, el nostre marc proveeix una arquitectura abstracta per implementar aquesta entitat reguladora, anomenada Màquina de Síntesi, que observa un MAS en temps d’execució i executa una estratègia de síntesi que s’encarrega de sintetizar normes. Tercer, el nostre marc incorpora una familia d’estratègies de síntesi destinades a ésser executades per una màquina de síntesi. En general, aquesta familia d’estratègies soporta la síntesi multi-objectiu i on-line de normes. La nostra primera estratègia, anomenada BASE, està dissenyada per sintetitzar sistemes normatius eficaços que evitin de manera satisfactòria situacions indesitjades per la coordinació d’un sistema Multi-Agent. Després, dues estratègies de síntesi, anomenades IRON i SIMON, van més enllà de la eficàcia i també consideren la compacitat com a objectiu de síntesi. IRON i SIMON prenen aproximacions alternatives a la síntesi de sistemes normatius compactes que, a més d’aconseguir la coordinació de manera efectiva, siguin tant sintètics com fos possible. Això permet a aquestes estratègies reduir els esforços computacionals dels agents a l’hora de raonar sobre les normes. Una quarta estratègia, anomenada LION, va més enllà de la eficàcia i la compacitat per considerar també la liberalitat com a objectiu de síntesi. Lion sintetitza sistemes normatius que són eficaços i compactes mentre preserven la llibertat dels agents tant com sigui possible. La nostra última estratègia és desmon, que és capaç de sintetizar normes considerant diferents graus de reactivitat. desmon permet ajustar la quantitat d’informació necessària per decidir si una norma cal que sigui o no inclosa a un sistema normatiu. DESMON pot sintetizar normes essent reactiu (considerant poca informació), o essent més deliberatiu (considerant més informació). En aquesta tesi presentem avaluacions empíriques de les nostres estratègies de síntesi en dos dominis d’aplicació: el domini del tràfic, i el domini de les comunitats on-line. En aquest primer domini, utilitzem les nostres estratègies per a sintetizar sistemes normatius eficaços, compactes i liberals que eviten colisions entre cotxes. Al segon domini, les nostres estratègies sintetizen sistemes normatius basant-se en les queixes dels usuaris de la comunitat sobre continguts inapropiats. D’aquesta manera, les nostres estratègies implementen un mecanisme de regulació que sintetiza normes quan hi ha suficient consens entre els usuaris sobre la necessitat de normes. Aquesta tesi avança en l’estat de l’art en síntesi de normes al proporcionar un novedós model computacional, una arquitectura abstracta i una familia d’estratègies per la síntesi on-line de normes per sistemes Multi-Agent oberts.
Hamdi, Sana. "Computational models of trust and reputation in online social networks." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLL001/document.
Full textOnline Social Networks (OSNs) have known a dramatic increase and they have been used as means for a rich variety of activities. In fact, within OSNs, usersare able to discover, extend, manage, and leverage their experiences and opinionsonline. However, the open and decentralized nature of the OSNs makes themvulnerable to the appearance of malicious users. Therefore, prospective users facemany problems related to trust. Thus, effective and efficient trust evaluation isvery crucial for users’ decision-making. It provides valuable information to OSNsusers, enabling them to make difference between trustworthy and untrustworthyones. This thesis aims to provide effective and efficient trust and reputationmanagement methods to evaluate trust and reputation of OSNs users, which canbe divided into the following four contributions.The first contribution presents a complex trust-oriented users’ contexts andinterests extraction, where the complex social contextual information is taken intoaccount in modelling, better reflecting the social networks in reality. In addition,we propose an enrichment of the Dbpedia ontology from conceptualizations offolksonomies.We second propose the IRIS (Interactions, Relationship types and Interest Similarity)trust management approach allowing the generation of the trust networkand the computation of direct trust. This model considers social activities of usersincluding their social relationships, preferences and interactions. The intentionhere is to form a solid basis for the reputation and indirect trust models.The third contribution of this thesis is trust inference in OSNs. In fact, it isnecessary and significant to evaluate the trust between two participants whomhave not direct interactions. We propose a trust inference model called TISON(Trust Inference in Social Networks) to evaluate Trust Inference within OSNs.The fourth contribution of this thesis consists on the reputation managementin OSNs. To manage reputation, we proposed two new algorithms. We introducea new exclusive algorithm for clustering users based on reputation, called RepC,based on trust network. In addition, we propose a second algorithm, FCR, whichis a fuzzy extension of RepC.For the proposed approaches, extensive experiments have been conducted onreal or random datasets. The experimental results have demonstrated that ourproposed algorithms generate better results, in terms of the utility of delivered results and efficiency, than do the pioneering approaches of the literature
Sharabati, Walid. "Multi-mode and evolutionary networks." Fairfax, VA : George Mason University, 2008. http://hdl.handle.net/1920/3384.
Full textVita: p. 214-215. Thesis director: Edward J. Wegman, Yasmin H. Said Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computational Sciences and Informatics. Title from PDF t.p. (viewed Mar. 9, 2009). Includes bibliographical references (p. 209-213). Also issued in print.
Noulas, Anastasios. "Human urban mobility in location-based social networks : analysis, models and applications." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.648354.
Full textCorley, Courtney David. "Social Network Simulation and Mining Social Media to Advance Epidemiology." Thesis, University of North Texas, 2009. https://digital.library.unt.edu/ark:/67531/metadc11053/.
Full textBaker, Razan. "Online social networks and Saudi youth participation in physical activity." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/14522.
Full textDoo, Myungcheol. "Spatial and social diffusion of information and influence: models and algorithms." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44740.
Full textBooks on the topic "Online social networks – Mathematical models"
Kesidis, George. An introduction to models of online peer-to-peer social networking. San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA): Morgan & Claypool, 2011.
Find full textUn mondo piccolo ma lento: Dalla fisica ai social network. Ariccia (RM): Aracne editrice int.le S.r.l., 2015.
Find full text1981-, Lin W. Sabrina, and Liu, K. J. Ray, 1961-, eds. Behavior dynamics in media-sharing social networks. Cambridge: Cambridge University Press, 2011.
Find full textPattison, Philippa. Algebraic models for social networks. Cambridge [England]: Cambridge University Press, 1993.
Find full text1946-, Carrington Peter J., Scott John, and Wasserman Stanley, eds. Models and methods in social network analysis. Cambridge: Cambridge University Press, 2005.
Find full textDutta, Bhaskar. Networks and groups: Models of strategic formation. Berlin: Springer, 2003.
Find full textSääskilahti, Pekka. Essays on the economics of networks and social relations. [Helsinki]: Helsinki School of Economics, 2005.
Find full textLeenders, Roger Th A. J. Structure and influence: Statistical models for the dynamics of actor attributes, network structure, and their interdependence. Amsterdam: Thesis Publishers, 1995.
Find full textBoyd, John Paul. Social semigroups: A unified theory of scaling and blockmodelling as applied to social networks. Fairfax, Va: George Mason University Press, 1991.
Find full textWorkshop on Dynamic Social Network Modeling and Analysis (2002 Washington, D.C.). Dynamic Social Network Modeling and Analysis: Workshop summary and papers. Washington, D.C: National Academies Press, 2003.
Find full textBook chapters on the topic "Online social networks – Mathematical models"
Kumar, Ravi, Jasmine Novak, and Andrew Tomkins. "Structure and Evolution of Online Social Networks." In Link Mining: Models, Algorithms, and Applications, 337–57. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-6515-8_13.
Full textWang, Haiyan, Feng Wang, and Kuai Xu. "Ordinary Differential Equation Models on Social Networks." In Surveys and Tutorials in the Applied Mathematical Sciences, 3–13. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38852-2_2.
Full textHarada, Jimpei, David Darmon, Michelle Girvan, and William Rand. "Prediction of Elevated Activity in Online Social Media Using Aggregated and Individualized Models." In Lecture Notes in Social Networks, 169–87. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53420-6_7.
Full textKesidis, George. "Search in structured networks." In An Introduction to Models of Online Peer-to-Peer Social Networking, 41–49. Cham: Springer International Publishing, 2011. http://dx.doi.org/10.1007/978-3-031-79998-3_4.
Full textKesidis, George. "Search in unstructured networks." In An Introduction to Models of Online Peer-to-Peer Social Networking, 51–54. Cham: Springer International Publishing, 2011. http://dx.doi.org/10.1007/978-3-031-79998-3_5.
Full textHu, Changjun, Wenwen Xu, and Peng Shi. "Information Diffusion in Online Social Networks: Models, Methods and Applications." In Web-Age Information Management, 65–76. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23531-8_6.
Full textSalvatori, Roberto. "Advanced Technologies for Social Communication: Methods and Techniques in Online Learning." In Mathematical-Statistical Models and Qualitative Theories for Economic and Social Sciences, 333–42. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-54819-7_22.
Full textShiekh, Mohd Abas, Kalpana Sharma, and Aaquib Hussain Ganai. "Information Diffusion: Survey to Models and Approaches, a Way to Capture Online Social Networks." In Intelligent Data Communication Technologies and Internet of Things, 25–32. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34080-3_3.
Full textTreur, Jan. "Mathematical Details of Specific Difference and Differential Equations and Mathematical Analysis of Emerging Network Behaviour." In Network-Oriented Modeling for Adaptive Networks: Designing Higher-Order Adaptive Biological, Mental and Social Network Models, 375–403. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31445-3_15.
Full textRöchert, Daniel, German Neubaum, and Stefan Stieglitz. "Identifying Political Sentiments on YouTube: A Systematic Comparison Regarding the Accuracy of Recurrent Neural Network and Machine Learning Models." In Disinformation in Open Online Media, 107–21. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61841-4_8.
Full textConference papers on the topic "Online social networks – Mathematical models"
Huang, Donghong, and Chi-Hung Chi. "A mathematical value system model for agent in online social network." In 2011 11th International Conference on Hybrid Intelligent Systems (HIS 2011). IEEE, 2011. http://dx.doi.org/10.1109/his.2011.6122133.
Full textChairunnanda, Prima, Simon Forsyth, and Khuzaima Daudjee. "Graph data partition models for online social networks." In the 23rd ACM conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2309996.2310026.
Full textBalagura, Kyrill, Helen Kazakova, Daliant Maximus, and Victoria Turygina. "Mathematical models of cognitive interaction identification in the social networks." In CENTRAL EUROPEAN SYMPOSIUM ON THERMOPHYSICS 2019 (CEST). AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5114453.
Full textJiang, Wenjun, and Jie Wu. "Trust Models in Wireless Sensor Networks and Online Social Networks: A Comparative Study." In 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, 2014. http://dx.doi.org/10.1109/mass.2014.71.
Full textCramer, Marcos, Jun Pang, and Yang Zhang. "A Logical Approach to Restricting Access in Online Social Networks." In SACMAT '15: 20th ACM Symposium on Access Control Models and Technologies. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2752952.2752967.
Full textBarbosa Neto, Samuel Martins, Maira Athanazio De Cerqueira Gatti, Paulo Rodrigo Cavalin, Claudio Santos Pinhanez, Cicero Nogueira Dos Santos, and Ana Paula Appel. "Reaction times for user behavior models in microblogging online social networks." In the 2103 workshop. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2513577.2513578.
Full textLee, Duan-Shin, Cheng-Shang Chang, Wen-Gui Ye, and Min-Chien Cheng. "Analysis of clustering coefficients of online social networks by duplication models." In ICC 2014 - 2014 IEEE International Conference on Communications. IEEE, 2014. http://dx.doi.org/10.1109/icc.2014.6883962.
Full textNi, Minyue, Yang Zhang, Weili Han, and Jun Pang. "An Empirical Study on User Access Control in Online Social Networks." In SACMAT 2016: The 21st ACM Symposium on Access Control Models and Technologies. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2914642.2914644.
Full textSathanur, Arun V., Vikram Jandhyala, and Chuanjia Xing. "PHYSENSE: Scalable sociological interaction models for influence estimation on online social networks." In 2013 IEEE International Conference on Intelligence and Security Informatics (ISI). IEEE, 2013. http://dx.doi.org/10.1109/isi.2013.6578858.
Full textLovato, Juniper L., Antoine Allard, Randall Harp, Jeremiah Onaolapo, and Laurent Hébert-Dufresne. "Limits of Individual Consent and Models of Distributed Consent in Online Social Networks." In FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3531146.3534640.
Full textReports on the topic "Online social networks – Mathematical models"
McKenna, Patrick, and Mark Evans. Emergency Relief and complex service delivery: Towards better outcomes. Queensland University of Technology, June 2021. http://dx.doi.org/10.5204/rep.eprints.211133.
Full text