<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Int J Public Health</journal-id>
<journal-title>International Journal of Public Health</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Int J Public Health</abbrev-journal-title>
<issn pub-type="epub">1661-8564</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1604887</article-id>
<article-id pub-id-type="doi">10.3389/ijph.2022.1604887</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Public Health Archive</subject>
<subj-group>
<subject>Original Article</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Exploring a Multi-Layer Coupled Network Propagation Model Based on Information Diffusion and Bounded Trust</article-title>
<alt-title alt-title-type="left-running-head">Ju et al.</alt-title>
<alt-title alt-title-type="right-running-head">Multi-Layer Coupled Network Propagation Model</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Ju</surname>
<given-names>Chunhua</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Chenyu</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Jiang</surname>
<given-names>Yihao</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Bao</surname>
<given-names>Fuguang</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1483348/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhou</surname>
<given-names>Huajian</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Xu</surname>
<given-names>Chonghuan</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1187492/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>School of Management Engineering and E-Commerce</institution>, <institution>Zhejiang Gongshang University</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>School of Business Administration</institution>, <institution>Zhejiang Gongshang University</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/943079/overview">Nino Kuenzli</ext-link>, Swiss Tropical and Public Health Institute (Swiss TPH), Switzerland</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Fuguang Bao, <email>baofuguang@126.com</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>18</day>
<month>07</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>67</volume>
<elocation-id>1604887</elocation-id>
<history>
<date date-type="received">
<day>03</day>
<month>03</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>03</day>
<month>06</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Ju, Wang, Jiang, Bao, Zhou and Xu.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Ju, Wang, Jiang, Bao, Zhou and Xu</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>
<bold>Objective:</bold> To explore the law of opinion dissemination and individual opinion evolution at the micro level, this paper analyzes the influence of variation and oyster on communication from the perspective of network structure.</p>
<p>
<bold>Methods:</bold> In this paper, we introduce the concepts of &#x201c;variation&#x201d; and &#x201c;oyster&#x201d;, build a multi-layer coupled network environment combined with the ISOVR model, and conduct simulation experiments of network information dissemination based on the bounded trust model.</p>
<p>
<bold>Results:</bold> The experimental results reveal that the extent and scope of variation&#x2019;s spread in the network are more dependent on the trust of nodes themselves, and decreasing the trust of nodes significantly reduces the rate and peak value of variation. Changing the silence coefficient of variation does not effectively change the direction of rumor propagation, which indicates that rumor has a strong propagation ability after mutation.</p>
<p>
<bold>Conclusion:</bold> The insights of this paper on the dissemination of public opinions include: 1) pay attention to people with high trust levels, such as opinion leaders; 2) clarify the misinformation in time to prevent further spread of rumors.</p>
</abstract>
<kwd-group>
<kwd>rumor spreading</kwd>
<kwd>variation</kwd>
<kwd>coupled network</kwd>
<kwd>oyster</kwd>
<kwd>opinion interaction</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>With the rapid development of mobile networks and various media, the speed and scope of information dissemination have been greatly improved. When some unexpected events occur, all kinds of randomly fabricated and maliciously distorted news are widely spread [<xref ref-type="bibr" rid="B1">1</xref>]. New requirements have been put forward on how to effectively guide and control public opinions by governments and other public network opinion organizations. This paper analyses the characteristics of rumor spreading, extending its background to the coupled network, including layers of the online Internet, such as the intermediate transition layer and offline entity layer, and proposes a multi-layer coupled network based on information diffusion and bounded trust. The purpose is to obtain the rules of rumor spreading through different topological structures, to help the government control rumor spreading, and guide public opinions.</p>
<p>In terms of news dissemination, social media has increased the likelihood of one&#x2019;s exposure to news events [<xref ref-type="bibr" rid="B2">2</xref>], also making the News Find Me effect more pronounced. However, the News Find Me effect causes people to receive information in a way that favors passive reception [<xref ref-type="bibr" rid="B3">3</xref>] and has no positive effect on the proper understanding of information [<xref ref-type="bibr" rid="B4">4</xref>]. Research on rumor spreading based on the infectious disease model began in the 1970s [<xref ref-type="bibr" rid="B5">5</xref>&#x2013;<xref ref-type="bibr" rid="B10">10</xref>]. With further research, researchers have verified the fact that a larger trust parameter, forgetting rate, and time delay affect the speed of rumor spreading [<xref ref-type="bibr" rid="B11">11</xref>&#x2013;<xref ref-type="bibr" rid="B13">13</xref>]. Du et al. [<xref ref-type="bibr" rid="B14">14</xref>] concluded that public education and timely correction of media errors were crucial factors of propagation. From the perspective of the heterogeneity of public risk perception, the lower the heterogeneity of public risk perception, the greater the impact on public opinions [<xref ref-type="bibr" rid="B15">15</xref>].</p>
<p>Researchers have used the viewpoint dynamics model to describe rumor propagation and changes in perspectives. Zha et al. [<xref ref-type="bibr" rid="B16">16</xref>] constructed a consensus-reaching model with a personalized feedback mechanism to propose acceptable opinions when the bounded confidence level is either known or unknown. Xiao et al. [<xref ref-type="bibr" rid="B17">17</xref>] verified that changes in individual opinions were not only influenced by interactions between adjacent nodes, but also by the natural renewal of individuals. Based on previous studies, Vasca et al. [<xref ref-type="bibr" rid="B18">18</xref>] constructed a bounded trust HK model with time heterogeneity to describe changes in group perspectives. Zhu et al. [<xref ref-type="bibr" rid="B19">19</xref>] divided people into opinion leaders and followers, and found that opinion leaders played a vital role in opinion convergence and initial opinion value. Then they added a trust incentive mechanism for uncorrected information and false information [<xref ref-type="bibr" rid="B20">20</xref>] and finally found that it was the copycat phenomenon that contributed to false advertising activities. Ju et al. [<xref ref-type="bibr" rid="B21">21</xref>] studied social relationship prediction by integrating personality traits and asymmetric interactions in a social network. The simulation experiment found that the discrete behavior would attract agents who trusted it and made them express extreme views.</p>
<p>More and more researchers have introduced the double-layer or multi-layer coupled network rumor spreading model. Zhang et al. [<xref ref-type="bibr" rid="B22">22</xref>] divided nodes into high influence layer and low influence layer, and designed two strategies of information closure and information elimination in rumor spreading. Barnard et al. [<xref ref-type="bibr" rid="B23">23</xref>] analyzed the evolution of infectious diseases by combining the association between individuals in the double static-dynamic layer network with time, type, and structural heterogeneity. Wang et al. [<xref ref-type="bibr" rid="B24">24</xref>] analyzed the impact of the social reinforcement effect, users&#x2019; perceived value, and other factors on rumor spreading from the perspective of user asymmetry in the network environment. Liu et al. [<xref ref-type="bibr" rid="B25">25</xref>] analyzed the local stability of the disease-free equilibrium point of the system according to the transformation law between different states in the model. Chen [<xref ref-type="bibr" rid="B26">26</xref>] constructed a multi-layer (WeChat layer-Weibo layer-control layer) coupled network model of public opinion communication control. Through simulation experiments, Zhu et al. [<xref ref-type="bibr" rid="B27">27</xref>] found that knowledge spreads fastest in the scale-free homogeneous hybrid double-layer coupled network. The communication frequency between online and offline knowledge was relatively close, the spread range was larger and the spread speed was faster.</p>
<p>In recent years, with deepening research on rumor propagation, scholars have analyzed the rules of rumor propagation from different perspectives [<xref ref-type="bibr" rid="B28">28</xref>&#x2013;<xref ref-type="bibr" rid="B30">30</xref>], resulting in categories for the types and nature of rumor propagation, dissemination groups, network structure, and the polarization degree of individual opinions, etc. However, few studies have examined the mechanism of rumor spreading online and offline. Thus, this paper constructs a three-layer coupled network. The main contributions of this paper are as follows.<list list-type="simple">
<list-item>
<p>(1) An improved multi-layer coupled network structure is proposed to analyze the interaction of nodes both online and offline.</p>
</list-item>
<list-item>
<p>(2) The phenomena of &#x201c;variation&#x201d; and &#x201c;oyster&#x201d; are introduced and innovatively described from the perspective of viewpoint interaction.</p>
</list-item>
<list-item>
<p>(3) Experiments on multi-layer coupled network communication incorporating information diffusion and bounded trust are carried out, and the evolution of public opinion dissemination is analyzed from both macro and micro perspectives.</p>
</list-item>
</list>
</p>
</sec>
<sec sec-type="methods" id="s2">
<title>Methods</title>
<p>The main work of this paper is as follows: Firstly, referring to Ju et al. [<xref ref-type="bibr" rid="B31">31</xref>], we propose an ISVOR model with concepts of &#x201c;variation&#x201d; and &#x201c;oyster&#x201d;. According to the model, we divide people into three groups: I (Ignorant), S (Spreader), and V (Variation). Secondly, considering the situation of online and offline interactions in the social network era, a multi-layer coupled network of online Internet layer, intermediate transition layer, and offline entity layer is conducted. Thirdly, based on the model of online rumor spreading with variation and oyster phenomenon, information diffusion and bounded trust are introduced to explore distorted dissemination of information and the short period of stopping dissemination in the life cycle of a rumor. <xref ref-type="fig" rid="F1">Figure 1</xref> is a three-layer coupled network with random online and offline coupling.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Three-layer coupled network with random online and offline coupling (Public opinion research, China, 2021-2022).</p>
</caption>
<graphic xlink:href="ijph-67-1604887-g001.tif"/>
</fig>
<p>For the online Internet layer and offline entity layer, the improved Amend-Linear Threshold (A-LT) model is used to represent the diffusion and elimination of rumors, and the J-A bounded trust model is used to describe the interactions between individuals. The intermediate transition layer of the three-layer coupled network in this paper adopts the random synchronization of the inter-layer state with the social reinforcement effect. The structure of the three-layer coupled network will be described in detail in <xref ref-type="sec" rid="s2-4">
<italic>Three-Layer Coupled Network Structure</italic>
</xref> section.</p>
<sec id="s2-1">
<title>Characteristics of Individual Influence</title>
<p>The heterogeneity attribute of the node itself can promote or inhibit the spread of rumors [<xref ref-type="bibr" rid="B32">32</xref>]. This paper mainly considers the interaction between nodes and adjacent nodes. We use Degree Centrality and Eigen Centrality to describe the influence of structural dimensions of nodes in the propagation. And we set <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> to describe that a node <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:math>
</inline-formula> in a network is connected to <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.<list list-type="simple">
<list-item>
<p>1) Degree Centrality. The greater the degree of a node is, the greater the influence of this point will be. We use the following equation [<xref ref-type="bibr" rid="B33">33</xref>] to describe the degree of centrality of node <inline-formula id="inf4">
<mml:math id="m4">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> :</p>
</list-item>
</list>
<disp-formula id="e1">
<mml:math id="m5">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>2) Eigen Centrality. And the influence of nodes is distributed to all nodes in the network so that nodes with high centrality contribute more [<xref ref-type="bibr" rid="B34">34</xref>]. We use <inline-formula id="inf5">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> to indicate the level of importance by the following equations:</p>
</list-item>
</list>
<disp-formula id="e2">
<mml:math id="m7">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mtext>&#xa0;&#xa0;</mml:mtext>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where <inline-formula id="inf6">
<mml:math id="m8">
<mml:mi>C</mml:mi>
</mml:math>
</inline-formula> is a constant, <inline-formula id="inf7">
<mml:math id="m9">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>. We can use the following equation to describe the steady state:<disp-formula id="e3">
<mml:math id="m10">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>where x is the eigenvector corresponding to the eigen values of matrix <inline-formula id="inf8">
<mml:math id="m11">
<mml:mi>A</mml:mi>
</mml:math>
</inline-formula>.<list list-type="simple">
<list-item>
<p>3) Assuming that <inline-formula id="inf9">
<mml:math id="m12">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the attribute influence of different characters, <italic>S, V, O,</italic> and <italic>R</italic> represent the set of the spreader, the variation, the oyster, and the recovery.</p>
</list-item>
</list>
<disp-formula id="e4">
<mml:math id="m13">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>O</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>This paper uses the structural dimension influence and attribute influence to determine the individual influence of node i in Internet Topology, denoted as <inline-formula id="inf10">
<mml:math id="m14">
<mml:mrow>
<mml:mtext>i</mml:mtext>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and represented by the following formula:<disp-formula id="e5">
<mml:math id="m15">
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>E</mml:mi>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>In the online Internet layer, the probability of the node <inline-formula id="inf11">
<mml:math id="m16">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> being offline is denoted as <inline-formula id="inf12">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>&#xa0;o</mml:mtext>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. When <inline-formula id="inf13">
<mml:math id="m18">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>&#xa0;o</mml:mtext>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, the node <inline-formula id="inf14">
<mml:math id="m19">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> has a 90% probability of being offline, meaning it is far away from rumor spreading in the network. Furthermore, it is not affected by other nodes in the network layer and does not participate in the information transmission.</p>
</sec>
<sec id="s2-2">
<title>Activation and Extinction of Rumor Diffusion</title>
<p>In the improved linear threshold (A-LT) model, the nodes in the network are divided into three categories: ignorant nodes (I) that are not exposed to rumors or infected by rumors, carriers (C) that are infected with rumors and have the ability to spread rumors, and recoveries (R) that no longer spread rumors. This paper assumes that when the node energy received by the unknown node reaches the wake-up threshold, the node will be activated and become a carrier and spread the rumor to neighboring nodes. At the same time, when the energy of adjacent nodes of the activated carrier is lower than a certain value, the impact of rumors begins to disappear and the node state changes into an immune state. The value here is defined as the Extinguishment threshold.</p>
<p>In the micro process of diffusion, rumor carriers can be subdivided into the spreader (S), variation (V), and the oyster (O), and the three groups of individuals have different influences. After a period of silence, some oysters will become immune to the rumor through rational thinking, and some of them will turn to the state of &#x201c;spreading rumor&#x201d;. They ignore the variation of rumors in the propagation and the influence of unstable factors of variation on the transmission chain. The state changes of users in the online Internet layer and offline entity layer are shown in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Activation and extinction process of rumor diffusion (Public opinion research, China, 2021-2022).</p>
</caption>
<graphic xlink:href="ijph-67-1604887-g002.tif"/>
</fig>
<p>The total number of users in each layer is set as <inline-formula id="inf15">
<mml:math id="m20">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula>, and at a certain time <inline-formula id="inf16">
<mml:math id="m21">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>, the relative number of N in different states during the activation of rumors, respectively represents the density of the ignorant <inline-formula id="inf17">
<mml:math id="m22">
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, rumor carriers <inline-formula id="inf18">
<mml:math id="m23">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, spreaders <inline-formula id="inf19">
<mml:math id="m24">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, variations <inline-formula id="inf20">
<mml:math id="m25">
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, the oyster <inline-formula id="inf21">
<mml:math id="m26">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and the recovery <inline-formula id="inf22">
<mml:math id="m27">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. They all satisfy <inline-formula id="inf23">
<mml:math id="m28">
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf24">
<mml:math id="m29">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>In this model, the arousal threshold <inline-formula id="inf25">
<mml:math id="m30">
<mml:mi>&#x3d5;</mml:mi>
</mml:math>
</inline-formula> describes that the ignorant user adjusts the rumor acceptance level in combination with the surrounding environment and self-state. The larger the <inline-formula id="inf26">
<mml:math id="m31">
<mml:mi>&#x3d5;</mml:mi>
</mml:math>
</inline-formula> of node <inline-formula id="inf27">
<mml:math id="m32">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>, the less likely the rumor intrusion will be. Therefore, it can be assumed that the probability of an ignorant person in the network turning into the rumor-spreading state at time t&#x2b;1 is as follows:<disp-formula id="e6">
<mml:math id="m33">
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mn>1</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>&#x3d5;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3d5;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>where <inline-formula id="inf28">
<mml:math id="m34">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the sum of the number of all rumor carriers in the adjacent nodes of node <inline-formula id="inf29">
<mml:math id="m35">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> at time <inline-formula id="inf30">
<mml:math id="m36">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>, and <inline-formula id="inf31">
<mml:math id="m37">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the sum of all rumor carriers in adjacent nodes of node <inline-formula id="inf32">
<mml:math id="m38">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>. Without loss of generality, we assume that the wake-up threshold <inline-formula id="inf33">
<mml:math id="m39">
<mml:mi>&#x3d5;</mml:mi>
</mml:math>
</inline-formula> of all users obeys a general distribution, denoting <inline-formula id="inf34">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3d5;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>This model uses the blanking threshold <inline-formula id="inf35">
<mml:math id="m41">
<mml:mi>&#x3c6;</mml:mi>
</mml:math>
</inline-formula>. The larger the <inline-formula id="inf36">
<mml:math id="m42">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> of node <inline-formula id="inf37">
<mml:math id="m43">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>, the better it can distinguish right from wrong, and the easier it is to identify rumors. We assume that the probability of the ignorant transforming into the recovery in the network at time <inline-formula id="inf38">
<mml:math id="m44">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> is as follows:<disp-formula id="e7">
<mml:math id="m45">
<mml:mrow>
<mml:mi>&#x3d1;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mn>1</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
</p>
<p>We assume that the extinguishing threshold <inline-formula id="inf39">
<mml:math id="m46">
<mml:mi>&#x3c6;</mml:mi>
</mml:math>
</inline-formula> of all users obeys a normal distribution, denoting <inline-formula id="inf40">
<mml:math id="m47">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>We use <inline-formula id="inf41">
<mml:math id="m48">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> to represent the sum of the influences of all activated nodes in the adjacent nodes of the node <inline-formula id="inf42">
<mml:math id="m49">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>. The <inline-formula id="inf43">
<mml:math id="m50">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>S</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the sum of the influences of all ordinary spreaders. The <inline-formula id="inf44">
<mml:math id="m51">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>V</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the sum of the influences of the change. The <inline-formula id="inf45">
<mml:math id="m52">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>O</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the sum of the influences of the oyster. A random constant <inline-formula id="inf46">
<mml:math id="m53">
<mml:mi>r</mml:mi>
</mml:math>
</inline-formula> is generated between <inline-formula id="inf47">
<mml:math id="m54">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and the state <inline-formula id="inf48">
<mml:math id="m55">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of node <inline-formula id="inf49">
<mml:math id="m56">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at the next moment is expressed by the following formula:<disp-formula id="e8">
<mml:math id="m57">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mi>S</mml:mi>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>S</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mi>V</mml:mi>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>S</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mi>O</mml:mi>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
</sec>
<sec id="s2-3">
<title>Variation and Oyster in Rumor Spreading</title>
<p>There will be the phenomenon of silence and variation in group communication. We call these people oysters and variations. Different from ordinary rumor spreaders, the content spread by Variations has changed significantly with the change in how news and specific information are disseminated, and there is a tendency for constant change. Oysters receive rumors but do not take the initiative to spread rumors. They are either in a thinking state or adopt a wait-and-see attitude.</p>
<p>We assume that the initial value <inline-formula id="inf50">
<mml:math id="m58">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of the node that has just entered the propagation state is in <inline-formula id="inf51">
<mml:math id="m59">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, is subject to the random distribution. We stipulate that when the opinion value is in <inline-formula id="inf52">
<mml:math id="m60">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> or <inline-formula id="inf53">
<mml:math id="m61">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, it means that the node is in the state of ordinary spreader; when the opinion value is in <inline-formula id="inf54">
<mml:math id="m62">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> or <inline-formula id="inf55">
<mml:math id="m63">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, it means that the node is in the state of variation; when the opinion value is in <inline-formula id="inf56">
<mml:math id="m64">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf57">
<mml:math id="m65">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, it means that the node is an oyster at the moment. Among them, <inline-formula id="inf58">
<mml:math id="m66">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf59">
<mml:math id="m67">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> are the silence intervals between the variation and the spreader, and <inline-formula id="inf60">
<mml:math id="m68">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf61">
<mml:math id="m69">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf62">
<mml:math id="m70">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf63">
<mml:math id="m71">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the silent coefficients of the variation and the spreader.</p>
<p>Referring to the JA model of Jager et al. [<xref ref-type="bibr" rid="B35">35</xref>], the rules of opinion update are as follows: when the difference between two opinion values is within the allowed interval <inline-formula id="inf64">
<mml:math id="m72">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, mutual influences and the change of opinion values will occur, which is expressed by the following equations:<disp-formula id="e9">
<mml:math id="m73">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>where the <inline-formula id="inf65">
<mml:math id="m74">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the average value of the sum of opinion values around the node.</p>
<p>When the difference of opinion values is out of the interval <inline-formula id="inf66">
<mml:math id="m75">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, it means that the opinions among nodes are different and inconsistent and there will be an exclusion between nodes, meaning the difference of opinion values will further expand, as shown in the following formula:<disp-formula id="e10">
<mml:math id="m76">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<p>When the opinion values of other intervals are different, there is no willingness to communicate between nodes, so the opinion values of nodes will not change. Meanwhile, we stipulate that once the opinion value interval of nodes is in <inline-formula id="inf67">
<mml:math id="m77">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, the opinion value will not reduce in the interaction progress, nor will it be reversed to an ordinary communicator.</p>
</sec>
<sec id="s2-4">
<title>Three-Layer Coupled Network Structure</title>
<p>In the intermediate cognitive transition layer, the social reinforcement effect is redefined as [<xref ref-type="bibr" rid="B36">36</xref>]: nodes in the network layer are influenced by multiple neighboring nodes. The probability of random synchronization from the intermediate cognitive transition layer to the offline entity layer in the online Internet layer [<xref ref-type="bibr" rid="B37">37</xref>] is: <disp-formula id="e11">
<mml:math id="m78">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>&#x03C9;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>&#x3be;</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>where <inline-formula id="inf68">
<mml:math id="m79">
<mml:mi>&#x3be;</mml:mi>
</mml:math>
</inline-formula> represents the random state synchronization parameter, and <inline-formula id="inf69">
<mml:math id="m80">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula> represents the number of connected users in the same type. <inline-formula id="inf70">
<mml:math id="m81">
<mml:mi>&#x3b2;</mml:mi>
</mml:math>
</inline-formula> represents the social reinforcement parameter, which represents external factors received by the node, including the influence of regulators (such as the media). We set <inline-formula id="inf71">
<mml:math id="m82">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. When the generated random number satisfies the random synchronization probability of social reinforcement, the state of the online internet layer will be synchronized to the offline state.</p>
<p>The connection mode of nodes at different layers adopts the combination of the following three modes [<xref ref-type="bibr" rid="B38">38</xref>, <xref ref-type="bibr" rid="B39">39</xref>]: 1) assortative links between layers; 2) disassortative links between layers, which is the opposite of assortative links between layers; and 3) random links between layers.</p>
<p>For the topological structure of social networks, the activation and elimination of rumor diffusion, and allowing for the variations and oysters in the process, this paper makes the following provisions: 1) the topology of all networks is static; 2) there is no after-effects in the online internet layer and the offline entity layer; 3) the node relationship between the online internet layer and the offline entity layer is bidirectional; and 4) the nodes between the online Internet layer and the offline entity layer are one-on-one. <xref ref-type="fig" rid="F3">Figure 3</xref> is the experimental flow chart of this paper.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Experimental flow chart (Public opinion research, China, 2021-2022).</p>
</caption>
<graphic xlink:href="ijph-67-1604887-g003.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="results" id="s3">
<title>Result</title>
<p>In this section, we use the Monte Carlo method to simulate on the Python platform. In order to verify the scientificity and reliability of the above model, this paper selected the &#x201c;Liu Xuezhou Incident&#x201d;, which was fermented in the campus forum as a case study, verified the science of the three-layer coupled network communication model based on case data, and conducted simulation experiments.</p>
<p>Brief description of the incident: &#x201c;Liu Xuezhou Incident&#x201d; was a public opinion event that occurred at the end of 2021. The origin of the incident is as follows: On 6 December 2021, Liu Xuezhou posted a video of a family search on the Internet, which aroused the attention of the general public. On 16 December, the elderly members of the family found Liu Xuezhou&#x2019;s biological parents through the vaccine book of that year, and the two sides recognized each other through DNA comparison. However, on 17 January 2022, Liu Xuezhou posted an article on a social media platform claiming that they were abandoned by their biological parents. The dispute started because they had hoped that their biological parents could provide a place for them to live. The media also published one-sided and suggestive headline articles to mislead netizens. In the early morning of 24 January, Liu Xuezhou committed suicide after posting a long article. This paper used the content of all users in the &#x23;LiuXueZhou incident topic from 6 December 2021, to 31 January 2022, which resulted in 2078 user nodes after filtering out irrelevant data. We defined user interactions in terms of re-Tweets (on the social media platform Twitter) and comments on published content. We finally achieved the following user interaction network diagram based on the interaction between users, shown in <xref ref-type="fig" rid="F4">Figure 4A</xref>. Meanwhile, based on the user data we trawled, the trend graph of the population was obtained through the calculation of the above model, as shown in <xref ref-type="fig" rid="F4">Figure 4B</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Comparison of real data and simulation data (Public opinion research, China, 2021-2022). <bold>(A)</bold> shows the user interaction network diagram presented according to the actual campus forum user; <bold>(B)</bold> shows the trend graph of the population change obtained according to the proposed user data and model; <bold>(C)</bold> shows the population change trend graph obtained according to the parameters mentioned in the text.</p>
</caption>
<graphic xlink:href="ijph-67-1604887-g004.tif"/>
</fig>
<p>According to the <xref ref-type="fig" rid="F4">Figures 4A,B</xref>, this topic can be abstracted as a BA scale-free network, which we simplified to a scale-free network with <inline-formula id="inf72">
<mml:math id="m83">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>2000</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>5</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>10</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> to facilitate subsequent calculations. Based on the above data, the paper sets each initial parameter as follows. The offline probability of the online internet layer is <inline-formula id="inf73">
<mml:math id="m84">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>&#x3bf;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.97</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. The average value of the rumor awakening threshold is <inline-formula id="inf74">
<mml:math id="m85">
<mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, namely variance <inline-formula id="inf75">
<mml:math id="m86">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. The average value of the rumor elimination threshold is <inline-formula id="inf76">
<mml:math id="m87">
<mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, namely variance <inline-formula id="inf77">
<mml:math id="m88">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.15</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. The random synchronization parameter of social reinforcement is <inline-formula id="inf78">
<mml:math id="m89">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>&#x3be;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and the social reinforcement factor is <inline-formula id="inf79">
<mml:math id="m90">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>&#x3b7;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. The attribute influences of the spreader, the variation, and the oyster are <inline-formula id="inf80">
<mml:math id="m91">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf81">
<mml:math id="m92">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>V</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1.5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf82">
<mml:math id="m93">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>O</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. The immune appears at <inline-formula id="inf83">
<mml:math id="m94">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>15</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. The individual&#x2019;s bounded trust degree is <inline-formula id="inf84">
<mml:math id="m95">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and the assimilation distance of the bounded trust view is <inline-formula id="inf85">
<mml:math id="m96">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and the exclusion distance is <inline-formula id="inf86">
<mml:math id="m97">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1.5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. The silence coefficients of spreaders and variations are <inline-formula id="inf87">
<mml:math id="m98">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x3d; -0.4, <inline-formula id="inf88">
<mml:math id="m99">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x3d; &#x2212;0.2, <inline-formula id="inf89">
<mml:math id="m100">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x3d; 0.2 and <inline-formula id="inf90">
<mml:math id="m101">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x3d; 0.3. In the case of the above parameters, we plotted the trend of population change, as shown in <xref ref-type="fig" rid="F4">Figure 4C</xref>. Through comparative analysis, the population change trend obtained by the above parameters is consistent with the population change trend in the actual situation. Therefore, the three-layer coupled network structure proposed in this paper is consistent with the actual situation, and the above parameter settings are used in the subsequent simulation experiments of this paper.</p>
<p>The order of the experiment is the change of the proportion of each character, followed by the change of the random social reinforcement effect. We then examined the influence of variation and oyster attributes, the change of trust degree of nodes, and the change and variation of communicator silence coefficient. The rule of rumor spreading is analyzed through the parameter changes of influencing factors. The experimental results are shown in <xref ref-type="fig" rid="F5">Figures 5</xref>, <xref ref-type="fig" rid="F6">6</xref>:</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Simulation experiment result graph 1 (Public opinion research, China, 2021-2022). <bold>(A,B)</bold> show the time-varying curves of the proportion of the ignorant, communicator, mutants, oysters, and the immunity in the online internet layer and offline physical layer. <bold>(C&#x2013;H)</bold> shows changes in the proportion of each character in the online internet layer and offline entity layer over time when the attribute influences of the mutant ArV are 1.5, 2.0, and 2.5, respectively. <bold>(I&#x2013;N)</bold> shows the change of the proportion of each character in the online internet layer and offline entity layer over time when the attribute influences of oysters ArO are 0.25, 0.5, and 0.75, respectively.</p>
</caption>
<graphic xlink:href="ijph-67-1604887-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Simulation experiment result graph 2 (Public opinion research, China, 2021-2022). <bold>(A&#x2013;F)</bold> shows changes in the proportion of each character in the online internet layer and offline entity layer over time when the communicator's silence coefficient &#x03c1;1 is &#x2212;0.45, &#x2212;0.4 and &#x2212;0.35, respectively. <bold>(G&#x2013;L)</bold> shows the changes of the proportion of each character in the online internet layer and offline entity layer over time when the variation&#x2019;s silent coefficient &#x03c1;3 is 0.15, 0.2 and 0.25, respectively.</p>
</caption>
<graphic xlink:href="ijph-67-1604887-g006.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F5">Figures 5A,B</xref> shows the time-varying curves of the proportion of the ignorant, communicator, mutants, oysters, and the immunity in the online internet layer and offline physical layer. <xref ref-type="fig" rid="F5">Figures 5C&#x2013;H</xref> shows changes in the proportion of each character in the online internet layer and offline entity layer over time when the attribute influences of the mutant <inline-formula id="inf91">
<mml:math id="m102">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>V</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are 1.5, 2.0, and 2.5, respectively. <xref ref-type="fig" rid="F5">Figures 5I&#x2013;N</xref> shows the change of the proportion of each character in the online internet layer and offline entity layer over time when the attribute influences of oysters <inline-formula id="inf92">
<mml:math id="m103">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>O</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are 0.25, 0.5, and 0.75, respectively.</p>
<p>
<xref ref-type="fig" rid="F6">Figures 6A&#x2013;F</xref> shows changes in the proportion of each character in the online internet layer and offline entity layer over time when the communicator&#x2019;s silence coefficient <inline-formula id="inf93">
<mml:math id="m104">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is &#x2212;0.45, &#x2212;0.4 and &#x2212;0.35, respectively. <xref ref-type="fig" rid="F6">Figures 6G&#x2013;L</xref> shows the changes of the proportion of each character in the online internet layer and offline entity layer over time when the variation&#x2019;s silent coefficient <inline-formula id="inf94">
<mml:math id="m105">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is 0.15, 0.2 and 0.25, respectively.</p>
<p>Based on a comprehensive comparative analysis, the following conclusion can be drawn: 1) each character in the offline physical layer changes in the same way as that in the online internet layer; 2) compared with the situation without random social reinforcement, the ignorant people in the offline physical layer are more likely to be infected by rumors and keep up with online events due to the superimposed influence of rumor carriers in the online internet layer; 3) when the attribute influence of mutants increases, the growth rate of silent mutants decreases, and the <inline-formula id="inf95">
<mml:math id="m106">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> of silent mutants also drops slightly, but it is not significantly affected; 4) with the increase of the attribute influence of the silent, the proportion of communicators in the online internet layer has no obvious change, while the proportion of mutants is constantly increasing; 5) with the increase of the degree of bounded trust, the proportion of communicators in the online internet layer and the offline physical layer grows flat, while the proportion of mutants grows faster and the proportion of silent ones increases as well. Finally, the <inline-formula id="inf96">
<mml:math id="m107">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> decreases slightly, but it is not significantly affected; 6) changing the silence coefficient of communicators is less effective than changing the silence coefficient of mutants.</p>
</sec>
<sec sec-type="discussion" id="s4">
<title>Discussion</title>
<p>In this paper, we draw on an ISOVR model of Jiang et al. [<xref ref-type="bibr" rid="B31">31</xref>] and construct a multi-coupled network to analyze the online and offline spread of rumors. Meanwhile, we introduce the bounded trust model and social reinforcement effect for further study. The simulation results show that increasing the immunity rate and silence rate of the variation can effectively reduce the rate of rumor diffusion. The high random social reinforcement effect will promote the spread of rumors in the offline entity layer. The offline probability of nodes within a certain range will effectively control the spread of rumors in the online internet layer. In addition, the degree and scope of variation diffusion in the network depend more on the trust degree of the node itself. Increasing the trust degree of nodes can significantly promote the growth rate and peak value of the variation. Therefore, it is necessary to pay attention to the cultivation of influential groups that can play a positive role in the spread of rumors. Changing the silence coefficient of variation cannot control the rumor diffusion, which shows the powerful influence of rumor variation. Therefore, relevant departments should release true information in a timely way to eliminate rumors and prevent further variation and distortion of rumors.</p>
<sec id="s4-1">
<title>Conclusion</title>
<p>This paper studies the variations and oysters in network communication and puts forward a new transmission mechanism and introduces the phenomenon of stagnation and information mutation in the network. The model has a wide range of application scenarios in the future, including personalized recommendation [<xref ref-type="bibr" rid="B40">40</xref>&#x2013;<xref ref-type="bibr" rid="B43">43</xref>], data processing [<xref ref-type="bibr" rid="B44">44</xref>&#x2013;<xref ref-type="bibr" rid="B46">46</xref>], sustainable tourism [<xref ref-type="bibr" rid="B47">47</xref>, <xref ref-type="bibr" rid="B48">48</xref>], knowledge dissemination [<xref ref-type="bibr" rid="B49">49</xref>] and so on. At the same time, there are still some limitations, for example, although the parameters of this paper were obtained after the simulation of actual cases, it is not considered in the later analysis that the parameters will change dynamically according to the development of actual events [<xref ref-type="bibr" rid="B50">50</xref>]. As mentioned in this study, it is necessary to strengthen the cultivation of groups that have a positive impact on the spread of rumors. However, this paper does not cover how to identify and cultivate such groups, nor how to guide the dissemination and control of public opinion based on the feedback between groups [<xref ref-type="bibr" rid="B51">51</xref>]. In follow-up research, we will further analyze the influence of increasing intervention measures and inter-group feedback on the dissemination of false mutation information in the process of public opinion dissemination. We might also consider combining the optimal control model, taking the control cost of public opinion dissemination as the objective function to dynamically adjust the impact of the intervention strategy on information dissemination.</p>
</sec>
</sec>
</body>
<back>
<sec id="s5">
<title>Author Contributions</title>
<p>All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.</p>
</sec>
<sec id="s6">
<title>Funding</title>
<p>This research was funded by Zhejiang Provincial Key Project of Philosophy and Social Sciences (Grant No. 20NDJC10Z), Natural Science Foundation of Zhejiang Province (Nos LQ20G010002 and LY20G010001), Soft Science Research Program of Zhejiang Province (no. 2021C25010), the project of China (Hangzhou) Cross-border E-commerce College (No. 2021KXYJ06), the Philosophy and Social Science Foundation of Zhejiang Province (No. 21NDJC083YB), and Contemporary Business and Trade Research Center of Zhejiang Gongshang University (Nos XT202103 and XT202105).</p>
</sec>
<sec sec-type="COI-statement" id="s7">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>X</given-names>
</name>
</person-group>. <article-title>Brief Analyses on Allport&#x27;s the Psychology of Rumor</article-title>. <source>Sci Soc Psychol</source> (<year>2014</year>) <volume>2014</volume>(<issue>Z1</issue>):<fpage>44</fpage>&#x2013;<lpage>8</lpage>. </citation>
</ref>
<ref id="B2">
<label>2.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Park</surname>
<given-names>CS</given-names>
</name>
<name>
<surname>Kaye</surname>
<given-names>BK</given-names>
</name>
</person-group>. <article-title>What&#x27;s This? Incidental Exposure to News on Social Media, News-Finds-Me Perception, News Efficacy, and News Consumption</article-title>. <source>Mass Commun Soc</source> (<year>2020</year>) <volume>23</volume>(<issue>2</issue>):<fpage>157</fpage>&#x2013;<lpage>80</lpage>. <pub-id pub-id-type="doi">10.1080/15205436.2019.1702216</pub-id> </citation>
</ref>
<ref id="B3">
<label>3.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gil de Z&#xfa;&#xf1;iga</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Weeks</surname>
<given-names>B</given-names>
</name>
<name>
<surname>Ard&#xe8;vol-Abreu</surname>
<given-names>A</given-names>
</name>
</person-group>. <article-title>Effects of the News-Finds-Me Perception in Communication: Social media Use Implications for News Seeking and Learning about Politics</article-title>. <source>J Comput-mediat Comm</source> (<year>2017</year>) <volume>22</volume>(<issue>3</issue>):<fpage>105</fpage>&#x2013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1111/jcc4.12185</pub-id> </citation>
</ref>
<ref id="B4">
<label>4.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Segado-Boj</surname>
<given-names>F</given-names>
</name>
<name>
<surname>D&#xed;az-Campo</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Navarro-Asencio</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Remacha-Gonz&#xe1;lez</surname>
<given-names>L</given-names>
</name>
</person-group>. <article-title>Influence of News-Finds-Me Perception on Accuracy, Factuality and Relevance Assessment. Case Study of News Item on Climate Change</article-title>. <source>Revista mediterr&#xe1;nea de comunicaci&#xf3;n</source> (<year>2020</year>) <volume>11</volume>(<issue>2</issue>):<fpage>85</fpage>&#x2013;<lpage>103</lpage>. <pub-id pub-id-type="doi">10.14198/medcom2020.11.2.12</pub-id> </citation>
</ref>
<ref id="B5">
<label>5.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Allport</surname>
<given-names>GW</given-names>
</name>
<name>
<surname>Postman</surname>
<given-names>L</given-names>
</name>
</person-group>. <article-title>An Analysis of Rumor</article-title>. <source>Public Opin Q</source> (<year>1946</year>) <volume>10</volume>(<issue>4</issue>):<fpage>501</fpage>&#x2013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1086/265813</pub-id> </citation>
</ref>
<ref id="B6">
<label>6.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Daley</surname>
<given-names>DJ</given-names>
</name>
<name>
<surname>Kendall</surname>
<given-names>DG</given-names>
</name>
</person-group>. <article-title>Stochastic Rumours</article-title>. <source>IMA J Appl Math</source> (<year>1965</year>) <volume>1</volume>(<issue>1</issue>):<fpage>42</fpage>&#x2013;<lpage>55</lpage>. <pub-id pub-id-type="doi">10.1093/imamat/1.1.42</pub-id> </citation>
</ref>
<ref id="B7">
<label>7.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sudbury</surname>
<given-names>A</given-names>
</name>
</person-group>. <article-title>The Proportion of the Population Never Hearing a Rumour</article-title>. <source>J Appl Probab</source> (<year>1985</year>) <volume>22</volume>(<issue>2</issue>):<fpage>443</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.2307/3213787</pub-id> </citation>
</ref>
<ref id="B8">
<label>8.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zanette</surname>
<given-names>DH</given-names>
</name>
</person-group>. <article-title>Dynamics of Rumor Propagation on Small-World Networks</article-title>. <source>Phys Rev E Stat Nonlin Soft Matter Phys</source> (<year>2002</year>) <volume>65</volume>(<issue>4</issue>):<fpage>041908</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.65.041908</pub-id> </citation>
</ref>
<ref id="B9">
<label>9.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Moreno</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Nekovee</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Pacheco</surname>
<given-names>AF</given-names>
</name>
</person-group>. <article-title>Dynamics of Rumor Spreading in Complex Networks</article-title>. <source>Phys Rev E Stat Nonlin Soft Matter Phys</source> (<year>2004</year>) <volume>69</volume>(<issue>6</issue>):<fpage>066130</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.69.066130</pub-id> </citation>
</ref>
<ref id="B10">
<label>10.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>L</given-names>
</name>
</person-group>. <article-title>The Propagation and Inhibition of Rumor in Online Social Network</article-title>. <source>Chin J Phys</source> (<year>2012</year>) <volume>61</volume>(<issue>23</issue>):<fpage>544</fpage>&#x2013;<lpage>50</lpage>. <pub-id pub-id-type="doi">10.7498/aps.61.238701</pub-id> </citation>
</ref>
<ref id="B11">
<label>11.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Y-Q</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>X-Y</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>Y-L</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X-A</given-names>
</name>
</person-group>. <article-title>Rumor Spreading Model with Trust Mechanism in Complex Social Networks</article-title>. <source>Commun Theor Phys</source> (<year>2013</year>) <volume>59</volume>(<issue>4</issue>):<fpage>510</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1088/0253-6102/59/4/21</pub-id> </citation>
</ref>
<ref id="B12">
<label>12.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nekovee</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Moreno</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Bianconi</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Marsili</surname>
<given-names>M</given-names>
</name>
</person-group>. <article-title>Theory of Rumour Spreading in Complex Social Networks</article-title>. <source>Physica A: Stat Mech its Appl</source> (<year>2007</year>) <volume>374</volume>(<issue>1</issue>):<fpage>457</fpage>&#x2013;<lpage>70</lpage>. <pub-id pub-id-type="doi">10.1016/j.physa.2006.07.017</pub-id> </citation>
</ref>
<ref id="B13">
<label>13.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z</given-names>
</name>
</person-group>. <article-title>SETQR Propagation Model for Social Networks</article-title>. <source>IEEE Access</source> (<year>2019</year>) <volume>7</volume>:<fpage>127533</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1109/access.2019.2939150</pub-id> </citation>
</ref>
<ref id="B14">
<label>14.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Du</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>How Do Social media and Individual Behaviors Affect Epidemic Transmission and Control?</article-title> <source>Sci Total Environ</source> (<year>2021</year>) <volume>761</volume>:<fpage>144114</fpage>. <pub-id pub-id-type="doi">10.1016/j.scitotenv.2020.144114</pub-id> </citation>
</ref>
<ref id="B15">
<label>15.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Su</surname>
<given-names>YY</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>YM</given-names>
</name>
<name>
<surname>He</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>CC</given-names>
</name>
</person-group>. <article-title>Research on Network Public Opinion Propagation Model of Emergency under Cross-Evolution of Risk Perception</article-title>. <source>Inf Sci</source> (<year>2020</year>) <volume>40</volume>(<issue>12</issue>):<fpage>100</fpage>&#x2013;<lpage>13</lpage>. </citation>
</ref>
<ref id="B16">
<label>16.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zha</surname>
<given-names>Q</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Chiclana</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Herrera-Viedma</surname>
<given-names>E</given-names>
</name>
</person-group>. <article-title>A Personalized Feedback Mechanism Based on Bounded Confidence Learning to Support Consensus Reaching in Group Decision Making</article-title>. <source>IEEE Trans Syst Man, Cybernetics: Syst</source> (<year>2019</year>) <volume>51</volume>(<issue>6</issue>):<fpage>3900</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1109/TSMC.2019.2945922</pub-id> </citation>
</ref>
<ref id="B17">
<label>17.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xiao</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>J</given-names>
</name>
</person-group>. <article-title>Modeling and Simulation of Opinion Natural Reversal Dynamics with Opinion Leader Based on HK Bounded Confidence Model</article-title>. <source>Complexity</source> (<year>2020</year>) <volume>2020</volume>:<fpage>7360302</fpage>. <pub-id pub-id-type="doi">10.1155/2020/7360302</pub-id> </citation>
</ref>
<ref id="B18">
<label>18.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Vasca</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Bernardo</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Iervolino</surname>
<given-names>R</given-names>
</name>
</person-group>. <article-title>Practical Consensus in Bounded Confidence Opinion Dynamics</article-title>. <source>Automatica</source> (<year>2021</year>) <volume>129</volume>:<fpage>109683</fpage>. <pub-id pub-id-type="doi">10.1016/j.automatica.2021.109683</pub-id> </citation>
</ref>
<ref id="B19">
<label>19.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Meng</surname>
<given-names>J</given-names>
</name>
</person-group>. <article-title>The Evolution of Leaders and Followers&#x2019; Opinion in Multi-Layer Networks Based on Bounded Confidence Model</article-title>. <source>Inf Sci</source> (<year>2019</year>) <volume>37</volume>(<issue>06</issue>):<fpage>30</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.13833/j.issn.1007-7634.2019.06.005</pub-id> </citation>
</ref>
<ref id="B20">
<label>20.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Douven</surname>
<given-names>I</given-names>
</name>
<name>
<surname>Hegselmann</surname>
<given-names>R</given-names>
</name>
</person-group>. <article-title>Mis- and Disinformation in a Bounded Confidence Model</article-title>. <source>Artif Intelligence</source> (<year>2021</year>) <volume>291</volume>:<fpage>103415</fpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2020.103415</pub-id> </citation>
</ref>
<ref id="B21">
<label>21.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ju</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Bao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>T</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Y</given-names>
</name>
</person-group>. <article-title>Social Relationship Prediction Integrating Personality Traits and Asymmetric Interactions</article-title>. <source>Front Psychol</source> (<year>2022</year>) <volume>13</volume>:<fpage>778722</fpage>. <pub-id pub-id-type="doi">10.3389/fpsyg.2022.778722</pub-id> </citation>
</ref>
<ref id="B22">
<label>22.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>D</given-names>
</name>
</person-group>. <article-title>Layered SIRS Model of Information Spread in Complex Networks</article-title>. <source>Appl Mathematics Comput</source> (<year>2021</year>) <volume>411</volume>:<fpage>126524</fpage>. <pub-id pub-id-type="doi">10.1016/j.amc.2021.126524</pub-id> </citation>
</ref>
<ref id="B23">
<label>23.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barnard</surname>
<given-names>RC</given-names>
</name>
<name>
<surname>Kiss</surname>
<given-names>IZ</given-names>
</name>
<name>
<surname>Berthouze</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Miller</surname>
<given-names>JC</given-names>
</name>
</person-group>. <article-title>Edge-Based Compartmental Modelling of an SIR Epidemic on a Dual-Layer Static-Dynamic Multiplex Network with Tunable Clustering</article-title>. <source>Bull Math Biol</source> (<year>2018</year>) <volume>80</volume>(<issue>10</issue>):<fpage>2698</fpage>&#x2013;<lpage>733</lpage>. <pub-id pub-id-type="doi">10.1007/s11538-018-0484-5</pub-id> </citation>
</ref>
<ref id="B24">
<label>24.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>JK</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>XH</given-names>
</name>
<name>
<surname>Bai</surname>
<given-names>L</given-names>
</name>
</person-group>. <article-title>Dissemination and Control Model of Public Opinion in Online Social Networks Based on Users&#x2019; Relative Weight</article-title>. <source>Syst Engineering-Theory Pract</source> (<year>2019</year>) <volume>39</volume>(<issue>6</issue>):<fpage>1565</fpage>&#x2013;<lpage>79</lpage>. </citation>
</ref>
<ref id="B25">
<label>25.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>N</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>P</given-names>
</name>
</person-group>. <article-title>Stability Analysis for a Fractional-Order SIR Model Based on Two-Layer Coupled Complex Networks</article-title>. <source>Mathematics Pract Theor</source> (<year>2020</year>) <volume>50</volume>(<issue>20</issue>):<fpage>117</fpage>&#x2013;<lpage>23</lpage>. </citation>
</ref>
<ref id="B26">
<label>26.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shuai</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>Research on Dissemination and Control of Public Opinion Based on Multilayer Coupled Network</article-title>. <source>J Syst Simulation</source> (<year>2020</year>) <volume>32</volume>(<issue>12</issue>):<fpage>2353</fpage>. </citation>
</ref>
<ref id="B27">
<label>27.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hongmiao</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Zhen</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Jiajin</surname>
<given-names>Q</given-names>
</name>
</person-group>. <article-title>Research on Knowledge Spreading Dynamics on Online and Offline Double-Layer Coupled Network</article-title>. <source>Syst Engineering-Theory Pract</source> (<year>2020</year>) <volume>40</volume>(<issue>02</issue>):<fpage>403</fpage>&#x2013;<lpage>14</lpage>. </citation>
</ref>
<ref id="B28">
<label>28.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Kou</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y</given-names>
</name>
</person-group>. <article-title>Understanding Influence Power of Opinion Leaders in E-Commerce Networks: An Opinion Dynamics Theory Perspective</article-title>. <source>Inf Sci</source> (<year>2018</year>) <volume>426</volume>:<fpage>131</fpage>&#x2013;<lpage>47</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2017.10.031</pub-id> </citation>
</ref>
<ref id="B29">
<label>29.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>R-D</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>Q</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>H-T</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J-G</given-names>
</name>
</person-group>. <article-title>Network Reconstruction of Social Networks Based on the Public Information</article-title>. <source>Chaos: Interdiscip J Nonlinear Sci</source> (<year>2021</year>) <volume>31</volume>(<issue>3</issue>):<fpage>033123</fpage>. <pub-id pub-id-type="doi">10.1063/5.0038816</pub-id> </citation>
</ref>
<ref id="B30">
<label>30.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nguyen</surname>
<given-names>VX</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>B</given-names>
</name>
</person-group>. <article-title>Bias in Social Interactions and Emergence of Extremism in Complex Social Networks</article-title>. <source>Chaos: Interdiscip J Nonlinear Sci</source> (<year>2020</year>) <volume>30</volume>(<issue>10</issue>):<fpage>103110</fpage>. <pub-id pub-id-type="doi">10.1063/5.0009943</pub-id> </citation>
</ref>
<ref id="B31">
<label>31.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ju</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Bao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Zou</surname>
<given-names>B</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>Online Rumor Diffusion Model Based on Variation and Silence Phenomenon in the Context of COVID-19</article-title>. <source>Front Public Health</source> (<year>2021</year>) <volume>9</volume>:<fpage>788475</fpage>. <pub-id pub-id-type="doi">10.3389/fpubh.2021.788475</pub-id> </citation>
</ref>
<ref id="B32">
<label>32.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Sun</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>J</given-names>
</name>
</person-group>. <article-title>A Survey of Models and Algorithms for Social Influence Analysis</article-title>. In: <source>Social Network Data Analytics</source>. <publisher-loc>Boston, MA</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2011</year>). p. <fpage>177</fpage>&#x2013;<lpage>214</lpage>. <pub-id pub-id-type="doi">10.1007/978-1-4419-8462-3_7</pub-id> </citation>
</ref>
<ref id="B33">
<label>33.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Wasserman</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Faust</surname>
<given-names>K</given-names>
</name>
</person-group>. <source>Social Network Analysis: Methods and Applications</source>. <publisher-loc>Cambridge, UK</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name> (<year>1994</year>). </citation>
</ref>
<ref id="B34">
<label>34.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J</given-names>
</name>
</person-group>. <article-title>Research of International Social Network Analysis in Frontier Domains in Visualized Information</article-title>. <source>Document, Inf Knowledge</source> (<year>2011</year>) <volume>32</volume>(<issue>1</issue>):<fpage>88</fpage>&#x2013;<lpage>94</lpage>. <comment>(in Chinese)</comment>. </citation>
</ref>
<ref id="B35">
<label>35.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jager</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Amblard</surname>
<given-names>Fd. r.</given-names>
</name>
</person-group> <article-title>Uniformity, Bipolarization and Pluriformity Captured as Generic Stylized Behavior with an Agent-Based Simulation Model of Attitude Change</article-title>. <source>Comput Math Organiz Theor</source> (<year>2005</year>) <volume>10</volume>(<issue>4</issue>):<fpage>295</fpage>&#x2013;<lpage>303</lpage>. <pub-id pub-id-type="doi">10.1007/s10588-005-6282-2</pub-id> </citation>
</ref>
<ref id="B36">
<label>36.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Yin</surname>
<given-names>B</given-names>
</name>
</person-group>. <article-title>Continuous Opinion Dynamics on an Adaptive Coupled Random Network</article-title>. <source>Adv Complex Syst</source> (<year>2014</year>) <volume>17</volume>:<fpage>03n041450012</fpage>. <pub-id pub-id-type="doi">10.1142/s021952591450012x</pub-id> </citation>
</ref>
<ref id="B37">
<label>37.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>YM</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>CS</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>WG</given-names>
</name>
</person-group>. <article-title>Research on Interest Attenuation and Social Reinforcement Mechanism for Rumor Spreading in Online Social Networks</article-title>. <source>J China Soc Scientific Tech Inf</source> (<year>2015</year>) <volume>34</volume>:<fpage>833</fpage>&#x2013;<lpage>44</lpage>. </citation>
</ref>
<ref id="B38">
<label>38.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Qian</surname>
<given-names>J</given-names>
</name>
</person-group>. <article-title>Robustness of Interdependent Networks with Different Link Patterns against Cascading Failures</article-title>. <source>Physica A: Stat Mech its Appl</source> (<year>2014</year>) <volume>393</volume>:<fpage>535</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.1016/j.physa.2013.08.031</pub-id> </citation>
</ref>
<ref id="B39">
<label>39.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X</given-names>
</name>
</person-group>. <article-title>Research on the Enterprise Public Opinion Spreading Model and Control Strategy in Two-Layer Social Networks</article-title>. <source>J Management Sci</source> (<year>2019</year>) <volume>32</volume>(<issue>1</issue>):<fpage>28</fpage>&#x2013;<lpage>41</lpage>. </citation>
</ref>
<ref id="B40">
<label>40.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>A Novel Recommendation Method Based on Social Network Using Matrix Factorization Technique</article-title>. <source>Inf Process Manag</source> (<year>2018</year>) <volume>54</volume>(<issue>3</issue>):<fpage>463</fpage>&#x2013;<lpage>74</lpage>. <pub-id pub-id-type="doi">10.1016/j.ipm.2018.02.005</pub-id> </citation>
</ref>
<ref id="B41">
<label>41.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>AS</given-names>
</name>
<name>
<surname>Liao</surname>
<given-names>SS</given-names>
</name>
</person-group>. <article-title>A Privacy-Preserving Recommendation Method Based on Multi-Objective Optimisation for mobile Users</article-title>. <source>Int J Bio-Inspired Comput</source> (<year>2020</year>) <volume>16</volume>(<issue>1</issue>):<fpage>23</fpage>&#x2013;<lpage>32</lpage>. <pub-id pub-id-type="doi">10.1504/ijbic.2020.108995</pub-id> </citation>
</ref>
<ref id="B42">
<label>42.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>AS</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>K</given-names>
</name>
</person-group>. <article-title>A Novel POI Recommendation Method Based on Trust Relationship and Spatial-Temporal Factors</article-title>. <source>Electron Commerce Res Appl</source> (<year>2021</year>) <volume>48</volume>:<fpage>101060</fpage>. <pub-id pub-id-type="doi">10.1016/j.elerap.2021.101060</pub-id> </citation>
</ref>
<ref id="B43">
<label>43.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Mei</surname>
<given-names>X</given-names>
</name>
</person-group>. <article-title>Exploring an Efficient POI Recommendation Model Based on User Characteristics and Spatial-Temporal Factors</article-title>. <source>Mathematics</source> (<year>2021</year>) <volume>9</volume>(<issue>21</issue>):<fpage>2673</fpage>. <pub-id pub-id-type="doi">10.3390/math9212673</pub-id> </citation>
</ref>
<ref id="B44">
<label>44.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Ju</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Bao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y</given-names>
</name>
</person-group>. <article-title>Sharing Reward Program Based on Face Consciousness in Social Media</article-title>. <source>Psychol Res Behav Manag</source> (<year>2022</year>) <volume>15</volume>:<fpage>1147</fpage>&#x2013;<lpage>1166</lpage>. <pub-id pub-id-type="doi">10.2147/PRBM.S362920</pub-id> </citation>
</ref>
<ref id="B45">
<label>45.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Mao</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>An Improved Evaluation Methodology for Mining Association Rules</article-title>. <source>Axioms</source> (<year>2021</year>) <volume>11</volume>(<issue>1</issue>):<fpage>17</fpage>. <pub-id pub-id-type="doi">10.3390/axioms11010017</pub-id> </citation>
</ref>
<ref id="B46">
<label>46.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>A Topic-Rank Recommendation Model Based on Microblog Topic Relevance &#x26; User Preference Analysis</article-title>. <source>Hum-Cent Comput Inf Sci</source> (<year>2022</year>) <volume>12</volume>:<fpage>10</fpage>. <pub-id pub-id-type="doi">10.22967/HCIS.2022.12.010</pub-id> </citation>
</ref>
<ref id="B47">
<label>47.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xiang</surname>
<given-names>K</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J</given-names>
</name>
</person-group>. <article-title>Understanding the Relationship between Tourists&#x27; Consumption Behavior and Their Consumption Substitution Willingness under Unusual Environment</article-title>. <source>Psychol Res Behav Management</source> (<year>2021</year>) <volume>14</volume>:<fpage>483</fpage>&#x2013;<lpage>500</lpage>. <pub-id pub-id-type="doi">10.2147/PRBM.S303239</pub-id> </citation>
</ref>
<ref id="B48">
<label>48.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>W</given-names>
</name>
</person-group>. <article-title>Understanding the Adoption of Mobile Social Payment? From the Cognitive Behavioral Perspective</article-title>. <source>Int J Mobile Commun</source> (<year>2022</year>) <volume>20</volume>(<issue>4</issue>):<fpage>483</fpage>&#x2013;<lpage>506</lpage>. <pub-id pub-id-type="doi">10.1504/IJMC.2022.10036150</pub-id> </citation>
</ref>
<ref id="B49">
<label>49.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Hao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Cai</surname>
<given-names>Z</given-names>
</name>
</person-group>. <article-title>An Efficient Approach to Sharing Edge Knowledge in 5G-Enabled Industrial Internet of Things</article-title>. <source>IEEE Trans Ind Inf</source> (<year>2022</year>) <volume>2022</volume>:<fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/TII.2022.3170470</pub-id> </citation>
</ref>
<ref id="B50">
<label>50.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Min</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Hao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>An Efficient Feedback Control Mechanism for Positive/negative Information Spread in Online Social Networks</article-title>. <source>IEEE Trans Cybernetics</source> (<year>2020</year>) <volume>52</volume>(<issue>99</issue>):<fpage>87</fpage>&#x2013;<lpage>100</lpage>. <pub-id pub-id-type="doi">10.1109/TCYB.2020.2977322</pub-id> </citation>
</ref>
<ref id="B51">
<label>51.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Hao</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Min</surname>
<given-names>G</given-names>
</name>
<etal/>
</person-group> <article-title>Dynamic Control of Fraud Information Spreading in mobile Social Networks</article-title>. <source>IEEE Trans Syst Man, Cybernetics: Syst</source> (<year>2019</year>) <volume>51</volume>(<issue>6</issue>):<fpage>3725</fpage>&#x2013;<lpage>38</lpage>. <pub-id pub-id-type="doi">10.1109/TSMC.2019.2930908</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>