High-order network information spreading method and system based on social acting force theory
Through the advanced network information dissemination method based on social force theory, user relationships and influence in social networks are analyzed, information dissemination trends are predicted, and the problem of difficult information dissemination in social networks is solved, and more complex and universality is achieved. information dissemination model.
Patent Information
- Application Number
- CN202411037646.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-08
AI Technical Summary
Existing information dissemination research has limitations in social networks and cannot effectively manage and control information dissemination, especially due to the impact of the spread of false information and rumors on network security.
Using the advanced network information dissemination method based on social force theory, the relationship between users is analyzed through the advanced network model, and the UAPR information dissemination model is generated. Combined with user influence, intimacy and herd effect, the information dissemination trend and laws are predicted. Including the degree of information attraction and aging speed.
It reflects the information dissemination situation more accurately, provides a more complex and universal information dissemination model, which can effectively predict information dissemination trends and laws, and solves the problem that traditional models are not general and universal in the system.
Smart Images

Figure CN118917547A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of information dissemination technology, and specifically to a high-order network information dissemination method and system based on social force theory. Background Art
[0002] With the continuous advancement of Internet technology, social networks are no longer limited to traditional face-to-face or letter communication modes. Driven by social software such as WeChat, Weibo, QQ, etc., people's social networks have become more and more complex, and the way of information dissemination has also undergone earth-shaking changes. In social networks, people can easily get some news, such as hot news happening in the current society or new policies just promulgated by the country, which undoubtedly provides a fast and convenient way for the public. However, technology is a double-edged sword. Social networks also lower the threshold for the spread of false information, allowing false information or rumors to spread on the Internet, disrupting a healthy network security environment. Therefore, the present invention aims to study the laws of information dissemination, especially the dynamics and influencing factors of information dissemination in the social network environment, so as to better manage and control the dissemination of information on social networks.
[0003] As the number of online social network users continues to increase, the relationships between users have become more diverse, and the clustering characteristics in social networks have become more significant. Various social groups have emerged on the network. Through these platforms, users can quickly receive and reply to messages, which greatly improves the efficiency of information dissemination to a certain extent. However, most of the current information dissemination research focuses on traditional complex networks. For example, in ordinary complex networks, by analyzing the stability of the SIS model with a saturation function, an immune control strategy is proposed to effectively inhibit information dissemination. The network structure in this study only represents the connection relationship between node pairs, which has certain limitations, that is, one edge cannot describe the situation where more than two nodes are related. Summary of the invention
[0004] In order to solve the deficiencies mentioned in the above background technology, the purpose of the present invention is to provide a high-level network information dissemination method and system based on social force theory, which can more intuitively reflect the online information dissemination situation and comprehensively analyze the information dissemination patterns and laws.
[0005] In a first aspect, the purpose of the present invention can be achieved by the following technical solution: a high-order network information dissemination method based on social force theory, the method comprising the following steps:
[0006] Obtaining relevant information about social network users, inputting the relevant information about social network users into a pre-established high-order network model, and generating relationships between social network users through a simplicial complex in the high-order network model;
[0007] According to the relationship between users in social networks, the user influence, intimacy and herd effect are obtained, and the information acceptance rate is generated based on the social force theory combined with the user influence, intimacy and herd effect. The information attraction degree is used as the information propagation rate, and the information aging speed is used as the information aging rate to generate the UAPR information propagation model based on the simple complex network.
[0008] The influence of information attraction degree and information aging speed on the propagation process is explored, and the information attraction degree and information aging speed are input into the pre-established UAPR information propagation model based on simplex complex network, and the predicted information propagation trend and law are output.
[0009] In combination with the first aspect, in certain implementations of the first aspect, the method also includes: the high-order network model includes two forms: a hypergraph and a simplicial complex, the hypergraph is composed of vertices and hyperedges, and the simplex is called a simplex, wherein there are interactions between k+1 nodes in the k-order simplex k-simplex, and different simplices are further connected to form a simplicial complex.
[0010] In combination with the first aspect, in some implementations of the first aspect, the method further includes: the high-order network model is generated by a BA scale-free simplicial complex network, and the generation steps are as follows:
[0011] In a common BA scale-free network, each time a new node is added, m existing nodes are selected according to the degree preference to generate a new edge, and then a second-order simplex is generated between any three nodes with probability q, where the probability q is related to the number of first-order simplexes associated with the nodes on average. <k>, the number of second-order simplexes with average node associations <k Δ The relationship between > is as follows:
[0012]
[0013] Where N is the total number of nodes.
[0014] In combination with the first aspect, in some implementations of the first aspect, the method further includes: in the UAPR information propagation model based on a simple complex network:
[0015] U represents the unknown person, A represents the information receiver, P represents the information disseminator, R represents the information immune person, β represents the information acceptance rate in the first-order simplex, β Δ represents the information acceptance rate in the second-order simplex, λ represents the information propagation rate, μ represents the information aging rate, ξ represents the information forgetting rate, and ε represents the information regeneration rate.
[0016] In combination with the first aspect, in some implementations of the first aspect, the method further includes: the dynamic propagation equations of the four states in the UAPR information propagation model based on the simplex complex network are established based on the microscopic Markov MMCA method:
[0017] At any time t, any individual can only be in one of the four states. The density of node i in various states at time t is recorded as Use q A (t), q AΔ (t) represents the probability that the U state is not transformed into the A state in the first-order simplex and the second-order simplex, respectively, and the following formula can be obtained:
[0018]
[0019] Where v represents the set of neighbors of node i, a ij Represents the edge relationship between two nodes in a first-order simplex, a ijk Represents the edge relationship between three nodes in a second-order simplex;
[0020] The microscopic Markov state transition equation for each state is expressed as:
[0021]
[0022] The individual density of each state is expressed as follows:
[0023]
[0024] Here x i (t) represents the probability of different states of node i at time t. The first formula in equation (5) indicates that node i in the R state and U state at time t has the probability of changing to the U state at the next time step t+1.
[0025] In combination with the first aspect, in some implementations of the first aspect, the method further includes: a state transition rule of the UAPR information propagation model based on a simple complex network is as follows:
[0026] At the initial moment, an infected node is randomly selected in the network and serves as the information disseminator P. Other nodes are in an unknown state U. In each time step, the information disseminator P transmits information to the surrounding unknown information U. Under the influence of social forces, the unknown information U changes with β, β Δ With the probability of receiving relevant information, the information receiver A will be transformed into information receiver A; under the attraction of information, the information receiver A will spread information with the probability of λ and be transformed into information disseminator P, or will know the information but not spread it and be transformed into information immune R with the probability of ξ; as time goes by, the attractiveness of information to users of information disseminator P will gradually decrease, and the information disseminator P will be transformed into information immune R with the probability of μ; the information immune R will eventually recover to information unknown U with the probability of ε, ready to participate in a new round of information dissemination.
[0027] In combination with the first aspect, in some implementations of the first aspect, the method further includes: the information acceptance rate β in the first-order simplex and the information acceptance rate β in the second-order simplex Δ as follows:
[0028]
[0029] The information propagation rate λ is expressed as:
[0030]
[0031] Among them, m is the mean of information attractiveness, and n is the standard deviation of information attractiveness;
[0032] Here, the larger the x is, the more attractive the information is to the user, so the corresponding propagation rate λ is also larger.
[0033] Information aging rate μ:
[0034] μ=1-e -αt #(10)
[0035] Among them, α is a constant greater than zero, indicating the information aging speed.
[0036] In a second aspect, in order to achieve the above-mentioned purpose, the present invention discloses a high-order network information dissemination system based on social force theory, comprising:
[0037] A data processing module is used to obtain information related to social network users, input the information related to social network users into a pre-established high-order network model, and generate relationships between social network users through a simplicial complex in the high-order network model;
[0038] The model generation module is used to obtain user influence, intimacy and herd effect according to the relationship between social network users, and generate information acceptance rate based on social force theory combined with user influence, intimacy and herd effect, taking the information attraction degree as the information propagation rate and the information aging speed as the information aging rate, to generate a UAPR information propagation model based on a simple complex network;
[0039] The propagation prediction module is used to explore the impact of information attraction and information aging speed on the propagation process. The information attraction and information aging speed are input into the pre-established UAPR information propagation model based on a simple complex network, and the predicted information propagation trends and laws are output.
[0040] In conjunction with the second aspect, in certain implementations of the second aspect, the system further includes: the high-order network model in the data processing module includes two forms: a hypergraph and a simplicial complex, the hypergraph is composed of vertices and hyperedges, and the simplicial is called a simplex, wherein there are interactions between k+1 nodes in a k-order simplex k-simplex, and different simplices are further connected to form a simplicial complex;
[0041] Alternatively, the high-order network model in the data processing module is generated by the BA scale-free simplicial complex network. The generation steps are as follows:
[0042] In a common BA scale-free network, each time a new node is added, m existing nodes are selected according to the degree preference to generate a new edge, and then a second-order simplex is generated between any three nodes with probability q, where the probability q is related to the number of first-order simplexes associated with the nodes on average. <k>, the number of second-order simplexes with average node associations <k Δ The relationship between > is as follows:
[0043]
[0044] Where N is the total number of nodes
[0045] In the UAPR information propagation model based on a simple complex network in the model generation module:
[0046] U represents the unknown person, A represents the information receiver, P represents the information disseminator, R represents the information immune person, β represents the information acceptance rate in the first-order simplex, β Δ represents the information acceptance rate in the second-order simplex, λ represents the information propagation rate, μ represents the information aging rate, ξ represents the information forgetting rate, and ε represents the information regeneration rate;
[0047] The dynamic propagation equations of the four states in the UAPR information propagation model based on the simple complex network in the model generation module are established based on the micro-Markov MMCA method:
[0048] At any time t, any individual can only be in one of the four states. The density of node i in various states at time t is recorded as Use q A (t), q AΔ (t) represents the probability that the U state is not transformed into the A state in the first-order simplex and the second-order simplex, respectively, and the following formula can be obtained:
[0049]
[0050] Where v represents the set of neighbors of node i, a ij Represents the edge relationship between two nodes in a first-order simplex, a ijk Represents the edge relationship between three nodes in a second-order simplex;
[0051] The microscopic Markov state transition equation for each state is expressed as:
[0052]
[0053] The individual density of each state is expressed as follows:
[0054]
[0055] Here x i (t) represents the probability of different states of node i at time t. The first formula in equation (5) indicates that node i in the R state and U state at time t has a probability of changing to the U state at the next time step t+1.
[0056] The state transition rules of the UAPR information propagation model based on a simple complex network in the model generation module are as follows:
[0057] At the initial moment, an infected node is randomly selected in the network and serves as the information disseminator P. Other nodes are in an unknown state U. In each time step, the information disseminator P transmits information to the surrounding unknown information U. Under the influence of social forces, the unknown information U changes with β, β Δ The probability of receiving relevant information is λ, and the information receiver A is transformed into information receiver A; under the information attraction, information receiver A transmits information with probability λ and transforms into information transmitter P, or knows the information but does not transmit it with probability ξ and transforms into information immune R; as time goes by, the information transmitter P's attractiveness to users gradually decreases, and it will transform into information immune R with probability μ; information immune R will eventually return to information unknown U with probability ε, ready to participate in a new round of information transmission;
[0058] Information acceptance rate β in the first-order simplex and information acceptance rate β in the second-order simplex in the model generation module Δ as follows:
[0059]
[0060] The information propagation rate λ is expressed as:
[0061]
[0062] Among them, m is the mean of information attractiveness, and n is the standard deviation of information attractiveness;
[0063] Here, the larger the x is, the more attractive the information is to the user, so the corresponding propagation rate λ is also larger.
[0064] Information aging rate μ:
[0065] μ=1-e -αt #(10)
[0066] Among them, α is a constant greater than zero, indicating the information aging speed.
[0067] In another aspect of the present invention, in order to achieve the above-mentioned purpose, a terminal device is disclosed, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor, wherein the memory stores a computer program capable of running on the processor, and when the processor loads and executes the computer program, the high-order network information dissemination method based on social force theory as described above is adopted.
[0068] Beneficial effects of the present invention:
[0069] The present invention links the social force theory with communication dynamics. It does not assume that all users will have read the relevant information, but defines the information acceptance rate from multiple perspectives such as user influence, intimacy, and herd effect. This is more in line with the actual situation of information dissemination.
[0070] The information propagation model considered by the present invention is more complex and more universal, which solves the problem that the high requirements for the information propagation model result in the system being considered not being general and universal.
[0071] The present invention studies the influence of different network structures, information attraction degree and information aging speed on the information propagation process on a high-order network, so as to predict the trend and law of information propagation. BRIEF DESCRIPTION OF THE DRAWINGS
[0072] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative work.
[0073] Figure 1 It is a schematic diagram of the overall structure of the present invention;
[0074] Figure 2 is a schematic diagram of a social network structure based on a simple complex in the present invention;
[0075] Figure 3 It is a diagram of the information receiving process in the UAPR of the present invention;
[0076] Figure 4 It is a user state transition diagram in the UAPR information propagation model of the present invention;
[0077] Figure 5 It is a schematic diagram of the state transition probability tree of four types of users of the present invention;
[0078] Figure 6 It is a schematic diagram of the system structure of the present invention. DETAILED DESCRIPTION
[0079] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0080] Embodiment 1:
[0081] The following is an introduction to the relevant terms involved in the embodiments of the present application:
[0082] The state transfer matrix is a matrix in the control theory proposed by Markov. It is a function of time and initial time. The state vector at time can be multiplied by this matrix to obtain the state vector at time.
[0083] Simplex: Simplex is the most basic concept in algebraic topology. It is a generalization of triangles and tetrahedrons. A k-dimensional simplex is a convex polyhedron with k+1 nodes.
[0084] like Figure 1 As shown, a high-order network information dissemination method based on social force theory includes the following steps:
[0085] S101: Obtaining relevant information about social network users, inputting the relevant information about social network users into a pre-established high-order network model, and generating relationships between social network users through a simplicial complex in the high-order network model;
[0086] High-order networks include two forms: hypergraphs and simplicial complexes. Hypergraphs are composed of vertices and hyperedges. Simplexes can also be called simplexes. There are k+1 interactions between nodes in a k-order simplex (k-simplex), and different simplices are further connected to form a simplicial complex. For example: a 0-order simplex represents a single node, a 1-order simplex represents an edge, a 2-order simplex represents a "full" triangle face, a 3-order simplex represents a tetrahedron, and so on. In addition, any subset of nodes of a k-order simplex also constitutes a simplex. For example, the 3 nodes and 3 edges in a 2-order simplex also belong to a simplex. However, the hypergraph does not require that all sub-interactions of a high-order interaction must appear in the hypergraph. Therefore, we use simplicial complexes to represent user relationships in online social networks, reflecting the high-order and low-order interaction relationships between multiple user nodes, so as to truly simulate the information dissemination process.
[0087] The BA scale-free simplicial complex network (SFSC) is a synthetic high-order network. Its generation steps are as follows: on a normal BA scale-free network, for each new node added, m existing nodes are selected according to degree preference to generate a new edge. Then, a second-order simplex is generated between any three nodes with probability q. The probability q is the number of first-order simplexes associated with the nodes on average. <k>, the number of second-order simplexes with average node associations <k Δ The relationship between > is as follows:
[0088]
[0089] Figure 3 This is the information reception process diagram in UAPR. Figure 4 It is the user state transition diagram in the UAPR information propagation model, which mainly analyzes the establishment of the UAPR information propagation model.
[0090] S102: Obtain user influence, intimacy and herd effect based on the relationship between social network users, and generate information acceptance rate based on social force theory combined with user influence, intimacy and herd effect, take the information attraction degree as the information propagation rate, and the information aging speed as the information aging rate, to generate a UAPR information propagation model based on a simple complex network;
[0091] (1) Since the spread of online information has many similarities with the spread of epidemics, based on this and combining the characteristics of information dissemination in social networks, a UAPR information dissemination model is constructed, where U represents the unknown person, A represents the information receiver, P represents the information disseminator, R represents the information immune person, β represents the information acceptance rate in the first-order simplex, and β Δ represents the information acceptance rate in the second-order simplex, λ represents the information transmission rate, μ represents the information aging rate, ξ represents the information forgetting rate, and ε represents the information regeneration rate. The simplex complex used in the present invention only includes 0-order simplex, 1-order simplex and 2-order simplex. (2) The state transition rule is as follows: At the initial moment, a random infected node is selected in the network. This node is the information disseminator P, and the other nodes are in the unknown state U. In each time step, the information disseminator P transmits information to the surrounding unknown information U. Under the influence of social forces, the unknown information U changes with β, β Δ With the probability of receiving relevant information, the user becomes an information receiver A. Under the attraction of information, the information receiver A spreads information with a probability of λ and becomes an information disseminator P, or knows the information but does not spread it and becomes an information immune person R with a probability of ξ. As time goes by, the information disseminator P becomes less attractive to users, and users lose their attention to the information, and they become information immune people R with a probability of μ. Information immune people R will eventually recover to information unknown people U with a probability of ε, ready to participate in a new round of information dissemination.
[0092] Figure 5 It is the state transition probability tree of four types of users. The microscopic Markov state transition tree is used to list the dynamic propagation equation for theoretical analysis.
[0093] Based on the microscopic Markov chain (MMCA) method, the dynamic propagation equations of the four states in the UAPR information propagation model are established. At any time t, any individual can only be in one of the four states, and the density of node i in various states at time t is recorded as We use q A (t), q AΔ (t) represents the probability that the U state is not transformed into the A state in the first-order simplex and the second-order simplex respectively, and the following formula can be obtained.
[0094]
[0095] Where v represents the set of neighbors of node i, a ij Represents the edge relationship between two nodes in a first-order simplex, a ijk Represents the edge relationship between three nodes in a second-order simplex.
[0096] The microscopic Markov state transition equation for each state is expressed as:
[0097]
[0098] The individual density of each state is expressed as follows:
[0099]
[0100] Here x i (t) represents the probability of different states of node i at time t. The first equation in equation (5) indicates that node i in R state and U state at time t has a certain probability of changing to U state at the next time step t+1. The other equations have similar meanings.
[0101] Setting of state transfer parameters:
[0102] (1) Information acceptance rate β, β Δ :Here, the closeness τ of the first-order simplex ij Set to 0.3, the closeness τ of the second-order simplex ijΔ Set to 0.5. Number of sources of action: When multiple sources of action work together, their influence may be greater, making it easier to influence the attitudes and behaviors of individuals. Similarly, in social networks, the more people discuss a certain information, the greater the influence. Just like the higher the like rate and forwarding rate of a short video, the more likely it is to be watched or commented on by everyone, which reflects the herd effect. The present invention uses the Holling type II function to represent the relationship between the reinforcement effect of the herd effect and the number of communicators, which is mathematically expressed as:
[0103]
[0104] Where ω is the saturation constant, here ω is 2, and the range of η is In real life, people's herd mentality increases as the number of people spreading information increases. Formula (6) represents this nonlinear growth trend, but it is not an infinite growth and will eventually reach a saturation state, which is more in line with the law of information dissemination in reality.
[0105] Through the above analysis, the three factors are multiplied to obtain the information acceptance rate β in the first-order simplex and the information acceptance rate β in the second-order simplex. Δ , the mathematical expression is:
[0106]
[0107] (2) Information diffusion rate λ: Assume that the information attraction degree x of different users to the same information follows a normal distribution, that is, x~(m,n 2 ). Where m is the mean of the information attraction, and n is the standard deviation of the information attraction. Therefore, the information diffusion rate λ is expressed as:
[0108]
[0109] Here, the larger the x is, the more attractive the information is to the user, so the corresponding propagation rate λ is also larger.
[0110] (3) Information aging rate μ: The information life cycle theory shows that any piece of information will go through the process of generation, development, and extinction. As time goes by, people’s attention to a piece of information will eventually disappear. It is not that the information no longer exists, but that it is no longer the focus of social attention. The vigorous development of the Internet has caused old information on the network to be quickly replaced by new information. Therefore, the information aging rate must be considered in the process of information dissemination. When the information ages to a certain extent, it will no longer have an impact on the information dissemination process. Because users are no longer interested in a certain piece of information and it changes exponentially over time, the formula for defining the information aging rate in the present invention is:
[0111] μ=1-e -αt #(11)
[0112] Here, α is a constant greater than zero, indicating the speed of information aging. The larger α is, the faster the information ages. As time goes by, the speed of information aging increases exponentially, and it will soon exit the propagation process. Then, all users will be in an immune state, which is consistent with the actual situation.
[0113] S103: Explore the influence of information attraction degree and information aging speed on the propagation process, input the information attraction degree and information aging speed into the pre-established UAPR information propagation model based on simplex complex network, and output the predicted information propagation trend and law.
[0114] Specifically, the present invention is further described below by way of embodiments:
[0115] The present invention uses Python to simulate three types of synthetic networks (small-world networks, BA scale-free networks, BA scale-free simplicial complex networks) and four real simplicial complex networks to analyze the propagation characteristics of the UAPR information model. In order to avoid the randomness of the results, each simulation is repeated 50 times under the same initial conditions and averaged. Among them, the four real simplicial complex networks use four sets of face-to-face contact data sets to construct real simplicial complex social networks, which come from different social background places: elementary school (LyonSchool), high school (Thiers13), workplace (InVS15) and meeting (SFHH). In each data set, face-to-face interactions record data at a time interval of 20s. Thiers13, InVS15 and LyonSchool aggregate data in a time window of 10min, and SFHH aggregates data in a time window of 30min. If two nodes are in contact, an edge (first-order simplex) is generated, and if three nodes are in contact with each other, a triangular face (second-order simplex) is generated. The total number of occurrences of the second-order simplex is counted, and the 15% with the largest number of occurrences is retained to construct a real simplicial complex.
[0116] Study the influence of network structure on the information propagation process: In the process of information propagation, users are easily influenced by neighboring nodes, so different network structures will have different effects on information propagation. Compare the different information propagation results under WS small-world network (WS), BA scale-free network (SF) and BA scale-free simplicial complex network (SFSC). The total number of nodes in the three networks is set to 1000. In the WS small-world network, the number of neighbors of each node is set to 20, and the probability of reconnection is set to 0.1; in the BA scale-free network, the number of edges of each newly added node is set to 10; in the BA scale-free simplicial complex network, the number of edges of each newly added node is also set to 10. In order to ensure the rigor of the results, the first-order average degree k of the three networks is controlled to be around 20, and the same propagation parameters are set. Finally, the results are analyzed to summarize the relevant rules.
[0117] Study the influence of information attraction on the information dissemination process: In the process of information dissemination, if the information is more attractive to users, users will tend to pass the information to people around them. In order to explore the influence of information attraction on the information dissemination process, the information dissemination process is simulated on four real simplicial complexes, with different information attraction means m set, and other parameters set the same. Finally, the results are analyzed to summarize the relevant rules.
[0118] Study the impact of information aging speed on the information dissemination process: Network information is generated very quickly, and a large amount of information will be obtained in a short period of time, which makes it easy for users to quickly lose interest in a piece of information. The information aging speed is equivalent to the vitality of information. In order to explore its impact on the information dissemination process, the information dissemination process is simulated on four real simplicial complexes, and different information aging speeds α are set respectively. Other parameters are set the same. Finally, the results are analyzed to summarize the relevant laws.
[0119] Embodiment 2: In the second aspect, as Figure 6 As shown, in order to achieve the above-mentioned purpose, the present invention discloses a high-order network information dissemination system based on social force theory, comprising:
[0120] The data processing module 11 is used to obtain information related to social network users, input the information related to social network users into a pre-established high-order network model, and generate relationships between social network users through a simplicial complex in the high-order network model;
[0121] The model generation module 12 is used to obtain user influence, intimacy and herd effect according to the relationship between users of the social network, and generate information acceptance rate based on social force theory combined with user influence, intimacy and herd effect, and use the information attraction degree as the information propagation rate and the information aging speed as the information aging rate to generate a UAPR information propagation model based on a simple complex network;
[0122] The propagation prediction module 13 is used to explore the influence of the information attraction degree and the information aging speed on the propagation process, input the information attraction degree and the information aging speed into the pre-established UAPR information propagation model based on the simplex complex network, and output the predicted information propagation trend and law.
[0123] In conjunction with the second aspect, in some implementations of the second aspect, the system further includes: the high-order network model in the data processing module 11 includes two forms: a hypergraph and a simplicial complex, the hypergraph is composed of vertices and hyperedges, and the simplicial is called a simplex, wherein there are interactions between k+1 nodes in a k-order simplex k-simplex, and different simplices are further connected to form a simplicial complex;
[0124] Alternatively, the high-order network model in the data processing module 11 is generated by a BA scale-free simplicial complex network, and the generation steps are as follows:
[0125] In a common BA scale-free network, each time a new node is added, m existing nodes are selected according to the degree preference to generate a new edge, and then a second-order simplex is generated between any three nodes with probability q, where the probability q is related to the number of first-order simplexes associated with the nodes on average. <k>, the number of second-order simplexes with average node associations <k Δ The relationship between > is as follows:
[0126]
[0127] Where N is the total number of nodes.
[0128] In the UAPR information propagation model based on the simple complex network in the model generation module 12:
[0129] U represents the unknown person, A represents the information receiver, P represents the information disseminator, R represents the information immune person, β represents the information acceptance rate in the first-order simplex, β Δ represents the information acceptance rate in the second-order simplex, λ represents the information propagation rate, μ represents the information aging rate, ξ represents the information forgetting rate, and ε represents the information regeneration rate;
[0130] The dynamic propagation equations of the four states in the UAPR information propagation model based on the simple complex network in the model generation module 12 are established based on the micro-Markov MMCA method:
[0131] At any time t, any individual can only be in one of the four states. The density of node i in various states at time t is recorded as Use q A (t), q AΔ (t) represents the probability that the U state is not transformed into the A state in the first-order simplex and the second-order simplex, respectively, and the following formula can be obtained:
[0132]
[0133] Where v represents the set of neighbors of node i, a ij Represents the edge relationship between two nodes in a first-order simplex, a ijk Represents the edge relationship between three nodes in a second-order simplex;
[0134] The microscopic Markov state transition equation for each state is expressed as:
[0135]
[0136] The individual density of each state is expressed as follows:
[0137]
[0138] Here x i (t) represents the probability of different states of node i at time t. The first formula in equation (5) indicates that node i in the R state and U state at time t has a probability of changing to the U state at the next time step t+1.
[0139] The state transition rules of the UAPR information propagation model based on the simple complex network in the model generation module 12 are as follows:
[0140] At the initial moment, an infected node is randomly selected in the network and acts as the information disseminator P. Other nodes are in an unknown state U. In each time step, the information disseminator P transmits information to the surrounding unknown information U. Under the influence of social forces, the unknown information U is in the form of β, β Δ The probability of receiving relevant information is λ, and the information receiver A is transformed into information receiver A; under the attraction of information, information receiver A spreads information with probability λ and becomes information transmitter P, or knows the information but does not spread it with probability ξ and becomes information immune R; as time goes by, the information transmitter P becomes less attractive to users, and users lose their attention to the information, and they will be transformed into information immune R with probability μ; information immune R will eventually return to information unknown U with probability ε, ready to participate in a new round of information dissemination;
[0141] The information acceptance rate β in the first-order simplex and the information acceptance rate β in the second-order simplex in the model generation module 12 Δ as follows:
[0142]
[0143] The information propagation rate λ is expressed as:
[0144]
[0145] Among them, m is the mean of information attractiveness, and n is the standard deviation of information attractiveness;
[0146] Here, the larger the x is, the more attractive the information is to the user, so the corresponding propagation rate λ is also larger.
[0147] Information aging rate μ:
[0148] μ=1-e -αt #(10)
[0149] Among them, α is a constant greater than zero, indicating the information aging speed.
[0150] Based on the same inventive concept, the present invention also provides a computer device, which includes: one or more processors, and a memory for storing one or more computer programs; the program includes program instructions, and the processor is used to execute the program instructions stored in the memory. The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. It is the computing core and control core of the terminal, which is used to implement one or more instructions, specifically for loading and executing one or more instructions in a computer storage medium to implement the above method.
[0151] It needs to be further explained that, based on the same inventive concept, the present invention also provides a computer storage medium, on which a computer program is stored, and the computer program is executed by a processor to execute the above method. The storage medium can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electrical, magnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.
[0152] In the description of this specification, the description with reference to the terms "one embodiment", "example", "specific example", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present disclosure. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.
[0153] The above shows and describes the basic principles, main features and advantages of the present disclosure. Those skilled in the art should understand that the present disclosure is not limited by the above embodiments, and the above embodiments and descriptions are only for explaining the principles of the present disclosure. Without departing from the spirit and scope of the present disclosure, the present disclosure may have various changes and improvements, and these changes and improvements fall within the scope of the present disclosure to be protected.< / k> < / k> < / k> < / k>
Claims
1. A high-order network information dissemination method based on social force theory, characterized by: The method comprises the following steps: Obtaining relevant information about social network users, inputting the relevant information about social network users into a pre-established high-order network model, and generating relationships between social network users through a simplicial complex in the high-order network model; According to the relationship between users in social networks, the user influence, intimacy and herd effect are obtained, and the information acceptance rate is generated based on the social force theory combined with the user influence, intimacy and herd effect. The information attraction degree is used as the information propagation rate, and the information aging speed is used as the information aging rate to generate the UAPR information propagation model based on the simple complex network. The influence of information attraction degree and information aging speed on the propagation process is explored, and the information attraction degree and information aging speed are input into the pre-established UAPR information propagation model based on simplex complex network, and the predicted information propagation trend and law are output.
2. The high-order network information dissemination method based on social force theory according to claim 1 is characterized in that: The high-order network model includes two forms: hypergraph and simplicial complex. The hypergraph is composed of vertices and hyperedges, and the simplex is called a simplex. Among them, there are interactions between k+1 nodes in the k-order simplex k-simplex, and different simplices are further connected to form a simplicial complex.
3. The high-order network information dissemination method based on social force theory according to claim 2 is characterized in that: The high-order network model is generated by a BA scale-free simplicial complex network, and the generation steps are as follows: In a common BA scale-free network, each time a new node is added, m existing nodes are selected according to the degree preference to generate a new edge, and then a second-order simplex is generated between any three nodes with probability q, where the probability q is related to the number of first-order simplexes associated with the nodes on average. <k>, the number of second-order simplexes with average node associations <k Δ The relationship between > is as follows:< / k> Where N is the total number of nodes.
4. The high-order network information dissemination method based on social force theory according to claim 1 is characterized in that: In the UAPR information propagation model based on a simple complex network: U represents the unknown person, A represents the information receiver, P represents the information disseminator, R represents the information immune person, β represents the information acceptance rate in the first-order simplex, β Δ represents the information acceptance rate in the second-order simplex, λ represents the information propagation rate, μ represents the information aging rate, ξ represents the information forgetting rate, and ε represents the information regeneration rate.
5. The high-order network information dissemination method based on social force theory according to claim 4 is characterized in that: The dynamic propagation equations of the four states in the UAPR information propagation model based on the simplex complex network are established based on the microscopic Markov MMCA method: At any time t, any individual can only be in one of the four states. The density of node i in various states at time t is recorded as Use q A (t), q AΔ (t) represents the probability that the U state is not transformed into the A state in the first-order simplex and the second-order simplex, respectively, and the following formula can be obtained: Where v represents the set of neighbors of node i, a ij Represents the edge relationship between two nodes in a first-order simplex, a ijk Represents the edge relationship between three nodes in a second-order simplex; The microscopic Markov state transition equation for each state is expressed as: The individual density of each state is expressed as follows: Here x i (t) represents the probability of different states of node i at time t. The first formula in equation (5) indicates that node i in the R state and U state at time t has a probability of changing to the U state at the next time step t+1.
6. The high-order network information dissemination method based on social force theory according to claim 5 is characterized in that: The state transition rules of the UAPR information propagation model based on a simple complex network are as follows: At the initial moment, an infected node is randomly selected in the network and serves as the information disseminator P. Other nodes are in an unknown state U. In each time step, the information disseminator P transmits information to the surrounding unknown information U. Under the influence of social forces, the unknown information U changes with β, β Δ With the probability of receiving relevant information, the information receiver A will be transformed into information receiver A; under the attraction of information, information receiver A will spread information with probability λ and be transformed into information disseminator P, or will know the information but not spread it and be transformed into information immune R with probability ξ; as time goes by, the attractiveness of information to users of information disseminator P will gradually decrease, and the information disseminator P will be transformed into information immune R with probability μ; information immune R will eventually recover to information unknown U with probability ε, ready to participate in a new round of information dissemination.
7. The high-order network information dissemination method based on social force theory according to claim 4 is characterized in that: The information acceptance rate β in the first-order simplex and the information acceptance rate β in the second-order simplex Δ as follows: The information propagation rate λ is expressed as: Among them, m is the mean of the letter attraction degree, and n is the standard deviation of the letter attraction degree; The larger the x is, the more attractive the information is to the user, and the larger the corresponding diffusion rate λ is; Information aging rate μ: μ=1-e -αt #(10) Among them, α is a constant greater than zero, indicating the information aging speed.
8. A high-order network information dissemination system based on social force theory, characterized by: include: A data processing module is used to obtain information related to social network users, input the information related to social network users into a pre-established high-order network model, and generate relationships between social network users through a simplicial complex in the high-order network model; The model generation module is used to obtain user influence, intimacy and herd effect according to the relationship between social network users, and generate information acceptance rate based on social force theory combined with user influence, intimacy and herd effect, taking the information attraction degree as the information propagation rate and the information aging speed as the information aging rate, to generate a UAPR information propagation model based on a simple complex network; The propagation prediction module is used to explore the impact of information attraction and information aging speed on the propagation process. The information attraction and information aging speed are input into the pre-established UAPR information propagation model based on a simple complex network, and the predicted information propagation trends and laws are output.
9. The high-level network information dissemination system based on social force theory according to claim 8 is characterized in that: The high-order network model in the data processing module includes two forms: hypergraph and simplicial complex. The hypergraph is composed of vertices and hyperedges, and the simplex is called a simplex. Among them, there are interactions between k+1 nodes in the k-order simplex k-simplex, and different simplices are further connected to form a simplicial complex. Alternatively, the high-order network model in the data processing module is generated through the BA scale-free simplicial complex network, and the generation steps are as follows: In a common BA scale-free network, each time a new node is added, m existing nodes are selected according to the degree preference to generate a new edge, and then a second-order simplex is generated between any three nodes with probability q, where the probability q is related to the number of first-order simplexes associated with the nodes on average. <k>, the number of second-order simplexes with average node associations <k Δ The relationship between > is as follows:< / k> Where N is the total number of nodes; In the UAPR information propagation model based on a simple complex network in the model generation module: U represents the unknown person, A represents the information receiver, P represents the information disseminator, R represents the information immune person, β represents the information acceptance rate in the first-order simplex, β Δ represents the information acceptance rate in the second-order simplex, λ represents the information propagation rate, μ represents the information aging rate, ξ represents the information forgetting rate, and ε represents the information regeneration rate; The dynamic propagation equations of the four states in the UAPR information propagation model based on the simplex complex network in the model generation module are established based on the microscopic Markov MMCA method: At any time t, any individual can only be in one of the four states. The density of node i in various states at time t is recorded as Use q A (t), q AΔ (t) represents the probability that the U state is not transformed into the A state in the first-order simplex and the second-order simplex, respectively, and the following formula can be obtained: Where v represents the set of neighbors of node i, a ij Represents the edge relationship between two nodes in a first-order simplex, a ijk Represents the edge relationship between three nodes in a second-order simplex; The microscopic Markov state transition equation for each state is expressed as: The individual density of each state is expressed as follows: Here x i (t) represents the probability of different states of node i at time t. The first equation in equation (5) indicates that node i in R state and U state at time t has a probability of changing to U state at the next time step t+1; The state transition rules of the UAPR information propagation model based on a simple complex network in the model generation module are as follows: At the initial moment, an infected node is randomly selected in the network and serves as the information disseminator P. Other nodes are in an unknown state U. In each time step, the information disseminator P transmits information to the surrounding unknown information U. Under the influence of social forces, the unknown information U changes with β, β Δ The probability of receiving relevant information is λ, and the information receiver A is transformed into information receiver A; under the information attraction, information receiver A transmits information with probability λ and transforms into information transmitter P, or knows the information but does not transmit it with probability ξ and transforms into information immune R; as time goes by, the information transmitter P's attractiveness to users gradually decreases, and it will transform into information immune R with probability μ; information immune R will eventually return to information unknown U with probability ε, ready to participate in a new round of information transmission; Information acceptance rate β in the first-order simplex and information acceptance rate β in the second-order simplex in the model generation module Δ as follows: The information propagation rate λ is expressed as: Among them, m is the mean of information attractiveness, and n is the standard deviation of information attractiveness; The larger the x is, the more attractive the information is to the user, and the larger the corresponding diffusion rate λ is; Information aging rate μ: μ=1-e -αt #(10) Among them, α is a constant greater than zero, indicating the information aging speed.
10. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and capable of running on the processor, characterized in that: The memory stores a computer program that can be run on the processor. When the processor loads and executes the computer program, the high-order network information dissemination method based on social force theory described in any one of claims 1 to 7 is adopted.
Citation Information
Cited By
High-order network propagation process prediction method, device, equipment, medium and product
CN120562569A
