CN114628038B - SKIR information transmission method based on online social network - Google Patents

SKIR information transmission method based on online social network Download PDF

Info

Publication number
CN114628038B
CN114628038B CN202210241429.4A CN202210241429A CN114628038B CN 114628038 B CN114628038 B CN 114628038B CN 202210241429 A CN202210241429 A CN 202210241429A CN 114628038 B CN114628038 B CN 114628038B
Authority
CN
China
Prior art keywords
state
information
propagation
probability
nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210241429.4A
Other languages
Chinese (zh)
Other versions
CN114628038A (en
Inventor
匡平
高宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN202210241429.4A priority Critical patent/CN114628038B/en
Publication of CN114628038A publication Critical patent/CN114628038A/en
Application granted granted Critical
Publication of CN114628038B publication Critical patent/CN114628038B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16HHEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
    • G16H50/00ICT specially adapted for medical diagnosis, medical simulation or medical data mining; ICT specially adapted for detecting, monitoring or modelling epidemics or pandemics
    • G16H50/80ICT specially adapted for medical diagnosis, medical simulation or medical data mining; ICT specially adapted for detecting, monitoring or modelling epidemics or pandemics for detecting, monitoring or modelling epidemics or pandemics, e.g. flu
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01Social networking
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02ATECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
    • Y02A90/00Technologies having an indirect contribution to adaptation to climate change
    • Y02A90/10Information and communication technologies [ICT] supporting adaptation to climate change, e.g. for weather forecasting or climate simulation

Landscapes

  • Health & Medical Sciences (AREA)
  • Engineering & Computer Science (AREA)
  • Public Health (AREA)
  • Primary Health Care (AREA)
  • Medical Informatics (AREA)
  • Business, Economics & Management (AREA)
  • General Health & Medical Sciences (AREA)
  • General Business, Economics & Management (AREA)
  • Biomedical Technology (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Computing Systems (AREA)
  • Pathology (AREA)
  • Epidemiology (AREA)
  • Information Transfer Between Computers (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses an SKIR information propagation method based on an online social network, which comprises the following steps: step 1, dividing user states into an unknown information state S, an informed state K, a propagation state I and a non-inductive state R; step 2, obtaining information transmission probability among different processes; step 3, combining a classical propagation model and an average field theory, and establishing an SKIR information propagation model by using the information propagation probability determined in the step 2; step 4, analyzing the SKIR information propagation model obtained in the step 3, and deducing a system balance point; and 5, performing stability analysis on the balance point obtained in the step 4 to obtain the stability condition of the system balance point. The invention predicts the propagation range and the propagation speed of the information on the real-world social network by simulating the propagation process of the information on the real-world social network, can timely acquire the factors influencing the information propagation guidance, and is favorable for controlling the propagation of bad information, thereby preventing the occurrence of social crisis events and further keeping the safety and the stability of the social network.

Description

SKIR information propagation method based on online social network
Technical Field
The invention belongs to the technical field of communication, relates to a communication security technology, and particularly relates to an SKIR information propagation method based on an online social network.
Background
In the early stage, in the research process of infectious diseases, the establishment of an infectious disease transmission model has theoretical guidance and practical significance for understanding the transmission process and the transmission mechanism of viruses and preventing and controlling the viruses. When constructing the propagation model, the population is first divided into three states: a susceptible state (S) in which the individual is in a healthy state prior to being infected, but is likely to subsequently receive a viral infection; infection status (I), the individual has been infected and will infect other healthy individuals; immune status (R), infected individuals are cured and no longer receive such viral infections.
Similar to the infectious disease spreading process, during the information spreading process, the system users are divided into the following three states: (1) unknown state S: the system user has the condition of receiving the information but does not receive the information, (2) the propagation state I: the user has contacted the information and disseminates the information to other users; (3) immune status R: the information is no longer interesting and does not continue to be disseminated due to its timeliness or the user's own factors. Because the information transmission has many similarities with the infectious disease spread, the research on the information transmission model in the social network is mostly constructed on the basis of the infectious disease model, and therefore, the information transmission model is also mostly constructed on the basis of the SI, SIS and SIR infectious disease models.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide the SKIR information transmission method based on the online social network, which can predict the transmission range and the transmission speed of the information on the real-world social network by simulating the transmission process of the information, can timely acquire the factors influencing the information transmission guidance, is favorable for governments and related departments to control the transmission of the bad information, thereby preventing the occurrence of social crisis events and further keeping the safety and stability of the social network.
The purpose of the invention is realized by the following technical scheme: an SKIR information propagation method based on an online social network comprises the following steps:
step 1, dividing a user state into an unknown information state S, an informed state K, a propagation state I and a non-inductive state R, and describing an information propagation process through state transition;
step 2, calculating the information propagation probability among different processes;
step 3, combining a classical propagation model and an average field theory, and establishing an SKIR information propagation model by using the information propagation probability determined in the step 2;
step 4, analyzing the SKIR information propagation model obtained in the step 3, and deducing a system balance point;
and 5, performing stability analysis on the balance point obtained in the step 4 to obtain the stability condition of the system balance point.
Further, the specific implementation method of step S1 is as follows: representing users and concern relationships of an online social network by nodes and connecting edges respectively: with N ═ N 1 ,N 2 ,...,N num Representing a user set, and representing that attention relationship exists and information interaction is possible if connecting edges exist among nodes;
combining the real world situation, the user is divided into the following four states: unknown information state S represents that information has not been contacted; the informed state K represents known information but is not immediately transmitted, and the capability of participating in transmission again is reserved; the propagation state I represents that information is being propagated; the non-sensing state R represents known information and no further messages will be propagated later.
Further, the step 2 is specifically implemented as follows:
the probability of the information browsed by the unknown node is alpha, the direct propagation probability is beta, the hesitation rate is epsilon, and the indirect propagation probability is
Figure GDA0003746408240000021
The migration rate is mu, and the propagation insensitivity is eta;
when the node state of the user is changed into a propagation state I, the neighbor nodes have the probability of alpha to browse the message, if the message is not browsed, the neighbor nodes keep the unknown information state S unchanged, otherwise, the neighbor nodes are changed into the propagation state I with the probability of beta, the probability of epsilon is changed into an informed state K, and the probability of eta is changed into an insensitive state R; the probability that the nodes in the informed state K and the propagation state I have eta is changed into the non-inductive state R, and the nodes in the informed state K also have eta
Figure GDA0003746408240000022
The probability of (2) is changed into a propagation state I to continue to propagate information; the model assumes that there is a population migration rate of μ, and the migration rate is also set to μ in order to keep the total population of the model constant.
Further, the specific implementation method of step 3 is as follows: at time t, the densities of the node in the unknown information state S, the node in the informed state K, the node in the propagation state I and the node in the non-sensible state R in the network are respectively expressed by S (t), K (t), I (t), R (t), and satisfy
S(t)+K(t)+I(t)+R(t)=1
And constructing a state transition formula shown as the formula according to the basic assumption and the state transition rule:
Figure GDA0003746408240000023
k is the average degree of the network.
Further, the specific implementation method of step 4 is as follows: to solve the model equilibrium point, let the value of the state transition formula be 0, obtain the state transition equation:
Figure GDA0003746408240000031
solving the equation to obtain the balance points of the system, namely two points are: one is the disease-free balance point E 0 (1,0, 0), and the other is the sick balance point E 0 * =(S * ,K * ,I * ,1-S * -K * -I * ) (ii) a Wherein the content of the first and second substances,
Figure GDA0003746408240000032
Figure GDA0003746408240000033
Figure GDA0003746408240000034
Figure GDA0003746408240000035
further, the step 5 is specifically implemented as follows: the Jacobian matrix in the state transition equation is:
Figure GDA0003746408240000036
will balance point E 0 Substituting (1,0,0,0) into the Jacobian matrix yields:
Figure GDA0003746408240000037
calculating the characteristic value to obtain:
λ 1,2 =-μ
Figure GDA0003746408240000038
Figure GDA0003746408240000039
λ 1 =λ 2 <0and lambda 3 <λ 4 Therefore, only λ needs to be discussed 4 When sign of (a) 4 If < 0 is true, the Jacobian matrix is at equilibrium point E 0 The eigenvalues at (1,0,0,0) all have negative real parts, i.e. when
Figure GDA0003746408240000041
When true, the system is at equilibrium point E 0 The eigenvalues of the Jacobian matrix at (1,0,0,0) all have negative real parts, the equilibrium point E of the system 0 And the information can not be propagated in the network because of gradual stability.
The invention has the beneficial effects that: the invention provides a new social network information transmission model by defining state transition probability functions among different nodes and comprehensively considering various factors influencing transmission on the basis of an improved SIR model. By simulating the information transmission process on the real world social network and predicting the transmission range and the transmission speed, the method can timely acquire the factors influencing the information transmission guide, is helpful for governments and related departments to control the transmission of bad information, thereby preventing the occurrence of social crisis events, further keeping the safety and stability of the social network and better serving users.
Detailed Description
The technical solution of the present invention is further explained below.
The invention discloses an SKIR information transmission method based on an online social network, which comprises the following steps:
step 1, dividing a user state into an unknown information state S, an informed state K, a propagation state I and a non-inductive state R, and describing an information propagation process through state transition; the specific implementation method comprises the following steps: representing users and concern relationships of an online social network by nodes and connecting edges respectively: with N ═ N 1 ,N 2 ,...,N num Representing a user set, and representing that attention relationship exists and information interaction is possible if connecting edges exist among nodes;
combining the real world situation, the user is divided into the following four states: unknown information state S represents that information has not been contacted; the informed state K represents known information but is not immediately transmitted, and the capability of participating in transmission again is reserved; the propagation state I represents that information is being propagated; the non-sensing state R represents known information and no further messages will be propagated later.
Step 2, calculating the information propagation probability among different processes; the specific implementation method comprises the following steps:
the probability of the information browsed by the unknown node is alpha, the direct propagation probability is beta, the hesitation rate is epsilon, and the indirect propagation probability is alpha
Figure GDA0003746408240000042
The migration rate is mu, and the propagation insensitivity is eta;
when the node state of the user is changed into a propagation state I, the neighbor nodes have the probability of alpha to browse the message, if the message is not browsed, the neighbor nodes keep the unknown information state S unchanged, otherwise, the neighbor nodes are changed into the propagation state I with the probability of beta, the probability of epsilon is changed into an informed state K, and the probability of eta is changed into an insensitive state R; the probability that the nodes in the informed state K and the propagation state I have eta is changed into the non-inductive state R, and the nodes in the informed state K also have eta
Figure GDA0003746408240000051
The probability of (2) is changed into a propagation state I to continue to propagate information; the model assumes that there is a population migration rate of μ, and the migration rate is also set to μ in order to keep the population in the model unchanged.
For example, the user is node a and the initial states of his neighbor nodes B, C, D are all unknown information states S. When a changes to the propagation state I, B, C, D all have a probability of viewing a propagated message, and 1-a probability of not viewing a message. If B is not browsed, B keeps the state S of unknown information unchanged; assuming C, D browsed, they would change to propagation state I with a probability of β, an informed state K with a probability of ε, and an imperceptible state R with a probability of η.
Step 3, combining a classical propagation model and an average field theory, and establishing an SKIR information propagation model by using the information propagation probability determined in the step 2; the specific implementation method comprises the following steps: at time t, the densities of the nodes in the unknown information state S, the nodes in the informed state K, the nodes in the propagation state I and the nodes in the non-inductive state R in the network are respectively expressed by S (t), K (t), I (t) and R (t), and the densities meet the requirements
S(t)+K(t)+I(t)+R(t)=1
And constructing a state transition formula shown as the formula according to the basic assumption and the state transition rule:
Figure GDA0003746408240000052
k is the average degree of the network.
Step 4, analyzing the SKIR information propagation model obtained in the step 3, and deducing a system balance point; the specific implementation method comprises the following steps: to solve the model equilibrium point, let the value of the state transition equation be 0, get the state transition equation:
Figure GDA0003746408240000053
solving the equation, two balance points of the system are obtained: one is the disease-free balance point E 0 (1,0, 0), and the other is the sick balance point E 0 * =(S * ,K * ,I * ,1-S * -K * -I * ) (ii) a Wherein the content of the first and second substances,
Figure GDA0003746408240000061
Figure GDA0003746408240000062
Figure GDA0003746408240000063
Figure GDA0003746408240000064
step 5, performing stability analysis on the balance point obtained in the step 4 to obtain a stability condition of the system balance point; the specific implementation method comprises the following steps: the Jacobian matrix in the state transition equation is:
Figure GDA0003746408240000065
will balance point E 0 Substituting (1,0,0,0) into the Jacobian matrix yields:
Figure GDA0003746408240000066
calculating the characteristic value to obtain:
λ 1 =λ 2 =-μ
Figure GDA0003746408240000067
Figure GDA0003746408240000068
λ 1 =λ 2 < 0 and λ 3 <λ 4 Therefore, only λ needs to be discussed 4 When a sign of (b) is 4 If < 0 is true, the Jacobian matrix is at equilibrium point E 0 The eigenvalues at (1,0,0,0) all have negative real parts, i.e. when
Figure GDA0003746408240000069
When established, the system is at equilibrium point E 0 The characteristic values of Jacobian matrix at (1,0,0,0) are allNegative real part, equilibrium point E of the system 0 And the information can not be propagated in the network because of gradual stability. Therefore, the probability of the information browsed by the unknown node is adjusted to be alpha, the direct propagation probability is beta, the hesitation rate is epsilon, and the indirect propagation probability is
Figure GDA00037464082400000610
The immigration migration rate is mu, and the propagation insensitive rate is eta, so that the above formula is established to prevent propagation of bad information.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (1)

1. An SKIR information transmission method based on an online social network is characterized by comprising the following steps:
step 1, dividing user states into an unknown information state S, an informed state K, a propagation state I and a non-inductive state R; the specific implementation method comprises the following steps: representing users and concern relationships of an online social network by nodes and connecting edges respectively: with N ═ N 1 ,N 2 ,...,N num Representing a user set, and representing that an attention relationship exists if connecting edges exist among nodes, so that information interaction can be carried out;
combining the real world situation, the user is divided into the following four states: unknown information state S represents that information has not been touched; the informed state K represents known information, but is not immediately transmitted, and the capability of participating in transmission again is reserved; the propagation state I represents that information is being propagated; the non-sensing state R represents known information and no further messages will be propagated later;
step 2, obtaining information transmission probability among different processes; the specific implementation method comprises the following steps:
the probability of the information browsed by the unknown node is alpha, the direct propagation probability is beta, the hesitation rate is epsilon, and the indirect propagation probability is
Figure FDA0003746408230000012
The migration rate is mu, and the propagation insensitivity is eta;
when the node state of the user is changed into a propagation state I, the neighbor nodes have the probability of alpha to browse the message, if the message is not browsed, the neighbor nodes keep the unknown information state S unchanged, otherwise, the neighbor nodes are changed into the propagation state I with the probability of beta, the probability of epsilon is changed into an informed state K, and the probability of eta is changed into an insensitive state R; the probability that the nodes in the informed state K and the propagation state I have eta is changed into the non-inductive state R, and the nodes in the informed state K also have eta
Figure FDA0003746408230000013
The probability of (2) is changed into a propagation state I to continue to propagate information; the model assumes that the population migration rate of mu exists, and the migration rate is also set as mu in order to keep the total population of the model unchanged;
step 3, combining a classical propagation model and an average field theory, and establishing an SKIR information propagation model by using the information propagation probability determined in the step 2; the specific implementation method comprises the following steps: at time t, the densities of the nodes in the unknown information state S, the nodes in the informed state K, the nodes in the propagation state I and the nodes in the non-inductive state R in the network are respectively expressed by S (t), K (t), I (t) and R (t), and the densities meet the requirements
S(t)+K(t)+I(t)+R(t)=1
And constructing a state transition formula shown as the formula according to the basic assumption and the state transition rule:
Figure FDA0003746408230000011
k is the average of the network;
step 4, analyzing the SKIR information propagation model obtained in the step 3, and deducing a system balance point; the specific implementation method comprises the following steps: to solve the model equilibrium point, let the value of the state transition formula be 0, obtain the state transition equation:
Figure FDA0003746408230000021
solving the equation to obtain the balance points of the system, namely two points are: one is the disease-free balance point E 0 (1,0, 0), and the other is the sick balance point E 0 * =(S * ,K * ,I * ,1-S * -K * -I * ) (ii) a Wherein the content of the first and second substances,
Figure FDA0003746408230000022
Figure FDA0003746408230000023
Figure FDA0003746408230000024
Figure FDA0003746408230000025
step 5, performing stability analysis on the balance point obtained in the step 4 to obtain a stability condition of the system balance point; the specific implementation method comprises the following steps: the Jacobian matrix in the state transition equation is:
Figure FDA0003746408230000026
will balance point E 0 Substituting (1,0,0,0) into the Jacobian matrix yields:
Figure FDA0003746408230000027
calculating the characteristic value to obtain:
λ 1,2 =-μ
Figure FDA0003746408230000031
Figure FDA0003746408230000032
λ 1 =λ 2 < 0 and λ 3 <λ 4 Therefore, only λ needs to be discussed 4 When a sign of (b) is 4 If < 0 is true, the Jacobian matrix is at equilibrium point E 0 The eigenvalues at (1,0,0,0) all have negative real parts, i.e. when
Figure FDA0003746408230000033
When true, the system is at equilibrium point E 0 The eigenvalues of the Jacobian matrix at (1,0,0,0) all have negative real parts, the equilibrium point E of the system 0 And the information cannot be spread in the network because of gradual stability.
CN202210241429.4A 2022-03-11 2022-03-11 SKIR information transmission method based on online social network Active CN114628038B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210241429.4A CN114628038B (en) 2022-03-11 2022-03-11 SKIR information transmission method based on online social network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210241429.4A CN114628038B (en) 2022-03-11 2022-03-11 SKIR information transmission method based on online social network

Publications (2)

Publication Number Publication Date
CN114628038A CN114628038A (en) 2022-06-14
CN114628038B true CN114628038B (en) 2022-08-26

Family

ID=81901739

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210241429.4A Active CN114628038B (en) 2022-03-11 2022-03-11 SKIR information transmission method based on online social network

Country Status (1)

Country Link
CN (1) CN114628038B (en)

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9317567B1 (en) * 2011-02-16 2016-04-19 Hrl Laboratories, Llc System and method of computational social network development environment for human intelligence
CN106844697A (en) * 2017-01-25 2017-06-13 中国矿业大学 It is a kind of that tracking is propagated based on the potential social network information for propagating collection
CN108092832A (en) * 2018-02-12 2018-05-29 山东师范大学 A kind of social networks Virus Info suppressing method and system
CN108322328A (en) * 2017-12-07 2018-07-24 国网新疆电力有限公司信息通信公司 The method of internet worm diffusion model structure based on Infectious Dynamics
CN109300056A (en) * 2018-08-16 2019-02-01 西安邮电大学 A kind of emotion Internet communication dynamic model based on SIRS and the emotion propagation analogy method using the model
CN109376195A (en) * 2018-11-14 2019-02-22 重庆理工大学 For online social network data mining model numerical value mechanism validation verification method
CN109446713A (en) * 2018-11-14 2019-03-08 重庆理工大学 Stability judgment method for extracted online social network data
CN109462506A (en) * 2018-11-14 2019-03-12 重庆理工大学 A kind of online social network data competitiveness information extraction dissemination method
CN109657330A (en) * 2018-12-14 2019-04-19 中国人民解放军国防科技大学 Large-scale network information propagation calculation method and device based on distributed platform
CN109903853A (en) * 2019-01-08 2019-06-18 南京邮电大学 Double-layer network propagation model construction method based on individual susceptibility Yu mass media's influence power
CN111079024A (en) * 2019-11-05 2020-04-28 大连交通大学 Public opinion propagation model construction method based on enhanced effect SCIR network
CN112784123A (en) * 2021-02-25 2021-05-11 电子科技大学 Cold start recommendation method for graph network
CN113271575A (en) * 2021-05-14 2021-08-17 重庆邮电大学 D2D information propagation modeling method based on information and user consciousness coupling
CN113569188A (en) * 2021-06-03 2021-10-29 大连交通大学 DI-SCIR-based double-layer coupling social network public opinion propagation model construction method
CN113946733A (en) * 2020-07-15 2022-01-18 北京信息科技大学 Social network SETQR propagation model study

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7761401B2 (en) * 2007-06-07 2010-07-20 International Business Machines Corporation Stochastic control optimization for sender-based flow control in a distributed stateful messaging system
WO2011133209A2 (en) * 2010-04-23 2011-10-27 Thomson Licensing Method and system for providing recommendations in a social network
US8473437B2 (en) * 2010-12-17 2013-06-25 Microsoft Corporation Information propagation probability for a social network
US20180018709A1 (en) * 2016-05-31 2018-01-18 Ramot At Tel-Aviv University Ltd. Information spread in social networks through scheduling seeding methods
US11645524B2 (en) * 2019-05-10 2023-05-09 Royal Bank Of Canada System and method for machine learning architecture with privacy-preserving node embeddings
US20210329026A1 (en) * 2020-04-15 2021-10-21 University Of Southern California Reconstructing missing complex networks against adversarial interventions
US11494439B2 (en) * 2020-05-01 2022-11-08 International Business Machines Corporation Digital modeling and prediction for spreading digital data

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9317567B1 (en) * 2011-02-16 2016-04-19 Hrl Laboratories, Llc System and method of computational social network development environment for human intelligence
CN106844697A (en) * 2017-01-25 2017-06-13 中国矿业大学 It is a kind of that tracking is propagated based on the potential social network information for propagating collection
CN108322328A (en) * 2017-12-07 2018-07-24 国网新疆电力有限公司信息通信公司 The method of internet worm diffusion model structure based on Infectious Dynamics
CN108092832A (en) * 2018-02-12 2018-05-29 山东师范大学 A kind of social networks Virus Info suppressing method and system
CN109300056A (en) * 2018-08-16 2019-02-01 西安邮电大学 A kind of emotion Internet communication dynamic model based on SIRS and the emotion propagation analogy method using the model
CN109446713A (en) * 2018-11-14 2019-03-08 重庆理工大学 Stability judgment method for extracted online social network data
CN109376195A (en) * 2018-11-14 2019-02-22 重庆理工大学 For online social network data mining model numerical value mechanism validation verification method
CN109462506A (en) * 2018-11-14 2019-03-12 重庆理工大学 A kind of online social network data competitiveness information extraction dissemination method
CN109657330A (en) * 2018-12-14 2019-04-19 中国人民解放军国防科技大学 Large-scale network information propagation calculation method and device based on distributed platform
CN109903853A (en) * 2019-01-08 2019-06-18 南京邮电大学 Double-layer network propagation model construction method based on individual susceptibility Yu mass media's influence power
CN111079024A (en) * 2019-11-05 2020-04-28 大连交通大学 Public opinion propagation model construction method based on enhanced effect SCIR network
CN113946733A (en) * 2020-07-15 2022-01-18 北京信息科技大学 Social network SETQR propagation model study
CN112784123A (en) * 2021-02-25 2021-05-11 电子科技大学 Cold start recommendation method for graph network
CN113271575A (en) * 2021-05-14 2021-08-17 重庆邮电大学 D2D information propagation modeling method based on information and user consciousness coupling
CN113569188A (en) * 2021-06-03 2021-10-29 大连交通大学 DI-SCIR-based double-layer coupling social network public opinion propagation model construction method

Non-Patent Citations (11)

* Cited by examiner, † Cited by third party
Title
Information propagation based on information value;Yu Gao 等;《2021 International Conference on Culture-oriented Science & Technology (ICCST)》;20211213;第310-315页 *
SETQR propagation model for social networks;Y Zhang 等;《IEEE Access》;20190903;第7卷;第127533-127543页 *
一类信息传播动力学模型与控制策略分析;潘玮 等;《内蒙古大学学报(自然科学版)》;20171115;第48卷(第06期);第601-606页 *
一类新SEIRS模型上的网络舆情传播行为研究;陈福集 等;《情报资料工作》;20140725(第04期);第62-67页 *
基于在线社交网络的D-SIR信息传播模型研究;彭慧洁 等;《电子科技》;20170515;第30卷(第05期);第172-175、179页 *
基于数据挖据的电信客户流失和网络信息传播模型;洪丽平;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160315;第2016年卷(第3期);第I138-5287页 *
基于转发行为影响因素的SCIR信息传播模型;张永 等;《计算机工程》;20171109;第44卷(第11期);第282-288、299页 *
社交网络中信息传播的稳定性研究;王超 等;《物理学报》;20140923;第63卷(第18期);第87-93页 *
社会化网络下基于改进SIR模型的观点信息传播规律研究;王谢宁等;《情报科学》;20170205;第35卷(第02期);第33-37页 *
网络垃圾信息ILDR传播模型;蔡秀梅 等;《计算机应用》;20180419;第38卷(第08期);第2316-2322页 *
考虑时延和辟谣效应的谣言传播模型;裴蕾 等;《小型微型计算机***》;20220114;第43卷(第01期);第144-151页 *

Also Published As

Publication number Publication date
CN114628038A (en) 2022-06-14

Similar Documents

Publication Publication Date Title
May et al. Infection dynamics on scale-free networks
Zhu et al. The dynamics analysis of a rumor propagation model in online social networks
KR101592479B1 (en) Distributed cache for graph data
Carswell HIV infection in healthy persons in Uganda.
Jiang et al. Dynamical behavior of a rumor transmission model with Holling-type II functional response in emergency event
Zhu et al. Analysis of SHIR rumor propagation in random heterogeneous networks with dynamic friendships
CN109492429B (en) Privacy protection method for data release
Minnebo et al. A fair comparison of pull and push strategies in large distributed networks
Zhang et al. SETQR propagation model for social networks
CN108322328B (en) Method for constructing network virus diffusion model based on infectious disease dynamics
Liu et al. Global stability of a network-based SIRS epidemic model with nonmonotone incidence rate
Fu et al. Dynamic model with super spreaders and lurker users for preferential information propagation analysis
Wang et al. Distributed join-the-idle-queue for low latency cloud services
Gao et al. Modeling covid-19 with mean field evolutionary dynamics: Social distancing and seasonality
CN114628038B (en) SKIR information transmission method based on online social network
CN111460679A (en) Dynamics-based synchronous cross information propagation analysis method and system
Gao et al. Design of telemedicine information query system based on wireless sensor network
Potterat et al. Evidence undermining the adequacy of the HIV reproduction number formula
Dobbins et al. Herpes in the time of AIDS: a comparison of the epidemiology of HIV-1 and HSV-2 in young men in northern Thailand
Ahmad et al. Modeling spread of ideas in online social networks
Gao et al. Analyzing social distancing and seasonality of COVID-19 with mean field evolutionary dynamics
CN114254251A (en) Public opinion propagation model construction method for direct immune SCIR
Zhai et al. Dynamical behavior mechanism in the network of interaction between group behavior and virus propagation
Zhu et al. Modeling the dynamics of multi-cluster information propagation in presence of time delay
Li et al. Suppressing epidemic spreading by optimizing the allocation of resources between prevention and treatment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant