|
Rumor Spread In Social Network
Rumor is an important form of social communications, and the spread of rumors plays a significant role in a variety of human affairs. There are two approaches to investigate the rumor spreading process: the microscopic models and the macroscopic models. The macroscopic models propose a macro view about this process are mainly based on the widely used Daley-Kendall and Maki-Thompson models. Particularly, we can view rumor spread as a stochastic process in social networks. While the microscopic models are more interested more on the micro interactions between individuals. Rumor propagation Models In the last few years, there has been a growing interest in rumor propagation in Online social networks problems where different approaches have been proposed to investigate it. By carefully scrutinizing the existing literature, we categorize the works into macroscopic and microscopic approaches. Macroscopic models The first category is mainly based on the Epidemic models Daley, D.J., a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rumor
A rumor (American English), or rumour (British English; see spelling differences; derived from Latin:rumorem - noise), is "a tall tale of explanations of events circulating from person to person and pertaining to an object, event, or issue in public concern." In the social sciences, a rumor involves a form of a statement whose veracity is not quickly or ever confirmed. In addition, some scholars have identified rumor as a subset of propaganda. Sociology, psychology, and communication studies have widely varying definitions of rumor. Rumors are also often discussed with regard to misinformation and disinformation (the former often seen as simply false and the latter seen as deliberately false, though usually from a government source given to the media or a foreign government). Early work French and German social science research on rumor locates the modern scholarly definition of it to the pioneering work of the German William Stern in 1902. Stern experimented on rumor invol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Communication
Communication (from la, communicare, meaning "to share" or "to be in relation with") is usually defined as the transmission of information. The term may also refer to the message communicated through such transmissions or the field of inquiry studying them. There are many disagreements about its precise definition. John Peters argues that the difficulty of defining communication emerges from the fact that communication is both a Universality (philosophy), universal phenomenon and a Communication studies, specific discipline of institutional academic study. One definitional strategy involves limiting what can be included in the category of communication (for example, requiring a "conscious intent" to persuade). By this logic, one possible definition of communication is the act of developing Semantics, meaning among Subject (philosophy), entities or Organization, groups through the use of sufficiently mutually understood signs, symbols, and Semiosis, semiotic conventions. An im ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic Process
In probability theory and related fields, a stochastic () or random process is a mathematical object usually defined as a family of random variables. Stochastic processes are widely used as mathematical models of systems and phenomena that appear to vary in a random manner. Examples include the growth of a bacterial population, an electrical current fluctuating due to thermal noise, or the movement of a gas molecule. Stochastic processes have applications in many disciplines such as biology, chemistry, ecology, neuroscience, physics, image processing, signal processing, control theory, information theory, computer science, cryptography and telecommunications. Furthermore, seemingly random changes in financial markets have motivated the extensive use of stochastic processes in finance. Applications and the study of phenomena have in turn inspired the proposal of new stochastic processes. Examples of such stochastic processes include the Wiener process or Brownian motion process, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compartmental Models In Epidemiology
Compartmental models are a very general modelling technique. They are often applied to the mathematical modelling of infectious diseases. The population is assigned to compartments with labels – for example, S, I, or R, (Susceptible, Infectious, or Recovered). People may progress between compartments. The order of the labels usually shows the flow patterns between the compartments; for example SEIS means susceptible, exposed, infectious, then susceptible again. The origin of such models is the early 20th century, with important works being that of Ross in 1916, Ross and Hudson in 1917, Kermack and McKendrick in 1927 and Kendall in 1956. The Reed-Frost model was also a significant and widely-overlooked ancestor of modern epidemiological modelling approaches. The models are most often run with ordinary differential equations (which are deterministic), but can also be used with a stochastic (random) framework, which is more realistic but much more complicated to analyze. Models ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjacency Matrix
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected (i.e. all of its edges are bidirectional), the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory. The adjacency matrix of a graph should be distinguished from its incidence matrix, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not, and its degree matrix, which contains information about the degree of each vertex. Definition For a simple graph with vertex set , the adjacency matrix is a square matrix such that its element is one when there is an edge from vertex to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree (graph Theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex v is denoted \deg(v) or \deg v. The maximum degree of a graph G, denoted by \Delta(G), and the minimum degree of a graph, denoted by \delta(G), are the maximum and minimum of its vertices' degrees. In the multigraph shown on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, every vertex has the same degree, and so we can speak of ''the'' degree of the graph. A complete graph (denoted K_n, where n is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum possible degree, n-1. In a signed graph, the number of positive edges connected to the vertex v is called positive deg(v) and the number of connected negative edges is entitled negative deg(v). Handshaking lemma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clustering Coefficient
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterised by a relatively high density of ties; this likelihood tends to be greater than the average probability of a tie randomly established between two nodes (Holland and Leinhardt, 1971; Watts and Strogatz, 1998). Two versions of this measure exist: the global and the local. The global version was designed to give an overall indication of the clustering in the network, whereas the local gives an indication of the embeddedness of single nodes. Local clustering coefficient The local clustering coefficient of a vertex (node) in a graph quantifies how close its neighbours are to being a clique (complete graph). Duncan J. Watts and Steven Strogatz introduced the measure in 1998 to determine whether a graph is a small-world network ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Small-world Network
A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps. Specifically, a small-world network is defined to be a network where the typical distance ''L'' between two randomly chosen nodes (the number of steps required) grows proportionally to the logarithm of the number of nodes ''N'' in the network, that is: :L \propto \log N while the global clustering coefficient is not small. In the context of a social network, this results in the small world phenomenon of strangers being linked by a short chain of acquaintances. Many empirical graphs show the small-world effect, including social networks, wikis such as Wikipedia, gene networks, and even the underlying architecture of the Internet. It is the inspiration for many network-on-chip architectures in contempo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Independent Cascades
Independent or Independents may refer to: Arts, entertainment, and media Artist groups * Independents (artist group), a group of modernist painters based in the New Hope, Pennsylvania, area of the United States during the early 1930s * Independents (Oporto artist group), a Portuguese artist group historically linked to abstract art and to Fernando Lanhas, the central figure of Portuguese abstractionism Music Groups, labels, and genres * Independent music, a number of genres associated with independent labels * Independent record label, a record label not associated with a major label * Independent Albums, American albums chart Albums * ''Independent'' (Ai album), 2012 * ''Independent'' (Faze album), 2006 * ''Independent'' (Sacred Reich album), 1993 Songs * "Independent" (song), a 2007 song by Webbie * "Independent", a 2002 song by Ayumi Hamasaki from '' H'' News and media organizations * ''The Independent'', a British online newspaper. * ''The Malta Independent'', a Maltese ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Degree (graph Theory)")
