相关论文: The Maki-Thompson rumor model on infinite Cayley t…

The rapid spread of rumors in social media is mainly caused by individual retweets. This paper applies uncertainty time series analysis (UTSA) to analyze a rumor retweeting behavior on Weibo. First, the rumor forwarding is modeled using…

We consider an epidemic model of SIR type set on a homogeneous tree and investigate the spreading properties of the epidemic as a function of the degree of the tree, the intrinsic basic reproduction number and the strength of the…

The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…

We introduce here a multi-type bootstrap percolation model, which we call T-Bootstrap Percolation (T-BP), and apply it to study information propagation in social networks. In this model, a social network is represented by a graph G whose…

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…

Consider informative selection of a sample from a finite population. Responses are realized as independent and identically distributed (i.i.d.) random variables with a probability density function (p.d.f.) f, referred to as the…

We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…

In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…

Without having direct access to the information that is being exchanged, traces of information flow can be obtained by looking at temporal sequences of user interactions. These sequences can be represented as causality trees whose…

Widespread interest in the diffusion of information through social networks has produced a large number of Social Dynamics models. A majority of them use theoretical hypothesis to explain their diffusion mechanisms while the few empirically…

Phylogenetic trees represent the evolutionary relationships between extant lineages, where extinct or non-sampled lineages are omitted. Extending the work of Stadler and collaborators, this paper focuses on the branch lengths in…

As a refinement of the Swampland Distance Conjecture, we propose that a quantum gravitational theory in an infinite distance limit of its moduli space either decompactifies, or reduces to an asymptotically tensionless, weakly coupled string…

We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…

We give new formulas on the total number of born particles in the stable birth-and-assassination process, and prove that it has an heavy-tailed distribution. We also establish that this process is a scaling limit of a process of rumor…

A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…

We study the diffusion of a true and a false message (the rumor) in a social network. Upon hearing a message, individuals may believe it, disbelieve it, or debunk it through costly verification. Whenever the truth survives in steady state,…

We extend the result of Fannes, Nachtergaele, and Werner on long-range order in the AKLT model on Cayley trees to include various trees and tree-like graphs that obey certain conditions. Our examples split into three cases: Cayley-like…

Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an…

Shared information is a measure of mutual dependence among multiple jointly distributed random variables with finite alphabets. For a Markov chain on a tree with a given joint distribution, we give a new proof of an explicit…