中文
相关论文

相关论文: Domination Between Trees and Application to an Exp…

200 篇论文

The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…

概率论 · 数学 2021-01-15 Harry Crane , Min Xu

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

组合数学 · 数学 2019-10-07 Tricia Muldoon Brown

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…

计算机科学与博弈论 · 计算机科学 2014-10-10 Adam Clearwater , Clemens Puppe , Arkadii Slinko

Mast fruiting represents a synchronous population behaviour which can spread on large landscape areas. This reproductive pattern is generally perceived as a synchronous periodic production of large seed crops and has a significant practical…

定量方法 · 定量生物学 2016-02-12 Ciprian Palaghianu , Marian Dragoi

Savannas are characterized by a discontinuous tree layer superimposed on a continuous layer of grass. Identifying the mechanisms that facilitate this tree-grass coexistence has remained a persistent challenge in ecology and is known as the…

种群与进化 · 定量生物学 2014-01-30 Flora S. Bacelar , Justin M. Calabrese , Emílio Hernández-García

We propose a stochastic model for evolution. Births and deaths of species occur with constant probabilities. Each new species is associated with a fitness sampled from the uniform distribution on [0,1]. Every time there is a death event…

概率论 · 数学 2010-11-09 Herve Guiol , Fabio P. Machado , Rinaldo B. Schinazi

A set $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total domination number of $G$ is the minimum cardinality of any total dominating set of $G$ and is denoted…

Given a simple, finite, nonempty graph $G=(V(G),E(G))$, a vertex subset $D\subseteq V(G)$ is said to be a dominating set if every vertex $v\in V(G)-D$ is adjacent to a vertex in $D$. The independent domination number $\gamma_i(G)$ is the…

组合数学 · 数学 2025-11-24 Andrew Pham

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

概率论 · 数学 2017-09-28 Romain Abraham , Aymen Bouaziz , Jean-François Delmas

Eliciting preferences from human judgements is inherently imprecise, yet most decision analysis methods force a single priority vector from pairwise comparisons, discarding the information embedded in inconsistencies. We instead leverage…

综合经济学 · 经济学 2026-02-27 Salvatore Greco , Sajid Siraj , Michele Lundy

We present results on a stochastic forest fire model, where the influence of the neighbour trees is treated in a more realistic way than usual and the definition of neighbourhood can be tuned by an additional parameter. This model exhibits…

元胞自动机与格子气 · 物理学 2015-05-13 Klaus Lichtenegger , Wilhelm Schappacher

Max-stability is the property that taking a maximum between two inputs results in a maximum between two outputs. We study max-stability with respect to first-order stochastic dominance, the most fundamental notion of stochastic dominance in…

数理金融 · 定量金融 2025-07-29 Christopher Chambers , Alan Miller , Ruodu Wang , Qinyu Wu

Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…

概率论 · 数学 2022-08-05 Tobias Johnson

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…

概率论 · 数学 2009-12-29 Alain-Sol Sznitman

By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…

统计力学 · 物理学 2007-05-23 L. Pal

Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\subseteq V(G)$ that can observe all vertices of $G$…

组合数学 · 数学 2022-09-09 Sarah E. Anderson , Kirsti Kuenzel , Houston Schuerger

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,…

概率论 · 数学 2016-08-26 Camille Pagnard

For most organisms with viscous population structure, spatially localized growth drives the invasive advance of a favorable mutation. We model a two-allele competition where recurrent mutation introduces a genotype with a rate of local…

种群与进化 · 定量生物学 2007-05-23 Lauren O'Malley , James Basham , Joseph A. Yasi , G. Korniss , Andrew Allstadt , Tom Caraco

In recent years, stochastic dominance for independent and identically distributed (iid) infinite-mean random variables has received considerable attention. The literature has identified several classes of distributions of nonnegative random…

概率论 · 数学 2026-04-28 Keyi Zeng , Zhenfeng Zou , Yuting Su , Taizhong Hu

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…

概率论 · 数学 2008-07-31 Steffen Dereich , Peter Morters