English
Related papers

Related papers: Majority dynamics on finite trees

200 papers

We consider the Moran process with two populations competing under an iterated Prisoners' Dilemma in the presence of mutation, and concentrate on the case where there are multiple Evolutionarily Stable Strategies. We perform a complete…

Dynamical Systems · Mathematics 2015-12-23 Lee DeVille , Meghan Galiardi

We study quantitative large-time averages for Hamilton--Jacobi equations in a dynamic random environment that is stationary ergodic and has unit-range dependence in time. Our motivation comes from stochastic growth models related to the…

Analysis of PDEs · Mathematics 2026-05-22 Xiaoqin Guo , Wenjia Jing , Hung Vinh Tran , Yuming Paul Zhang

This paper is devoted to the analysis of the problem of stabilization of fractional (in time) partial differential equations. We consider the following equation $$ \partial^{\alpha,\eta}_{t} u(t)=\mathcal{A}u(t)-\frac{\eta}{\Gamma…

Analysis of PDEs · Mathematics 2019-02-08 Kaïs Ammari , Fathi Hassine , Luc Robbiano

We consider a one-dimensional stationary stochastic process $x(\tau)$ of duration $T$. We study the probability density function (PDF) $P(t_{\rm m}|T)$ of the time $t_{\rm m}$ at which $x(\tau)$ reaches its global maximum. By using a path…

Statistical Mechanics · Physics 2021-10-15 Francesco Mori , Satya N. Majumdar , Gregory Schehr

Owing to their inherently interpretable structure, decision trees are commonly used in applications where interpretability is essential. Recent work has focused on improving various aspects of decision trees, including their predictive…

Machine Learning · Statistics 2023-05-30 Dimitris Bertsimas , Vassilis Digalakis

We report on a time regularity result for stochastic evolutionary PDEs with monotone coefficients. If the diffusion coefficient is bounded in time without additional space regularity we obtain a fractional Sobolev type time regularity of…

Analysis of PDEs · Mathematics 2015-10-07 Dominic Breit , Martina Hofmanova

We consider 3-Majority, a probabilistic consensus dynamics on a complete graph with $n$ vertices, each vertex starting with one of $k$ initial opinions. At each discrete time step, a vertex $u$ is chosen uniformly at random. The selected…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-16 Colin Cooper , Frederik Mallmann-Trenn , Tomasz Radzik , Nobutaka Shimizu , Takeharu Shiraga

In this paper, we claim the availability of deterministic noises for stabilization of the origins of dynamical systems, provided that the noises have unbounded variations. To achieve the result, we first consider the system representations…

Systems and Control · Computer Science 2022-09-20 Yuki Nishimura

Consider a species whose population density solves the steady diffusive logistic equation in a heterogeneous environment modeled with the help of a spatially non constant coefficient standing for a resources distribution in a given box. We…

Analysis of PDEs · Mathematics 2018-07-25 Idriss Mazari , Grégoire Nadin , Yannick Privat

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…

Statistical Mechanics · Physics 2007-05-23 L. Pal

In this paper, we formalize design patterns, commonly used in the self-stabilizing area, to obtain general statements regarding both correctness and time complexity guarantees. Precisely, we study a general class of algorithms designed for…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-08 Karine Altisen , Stéphane Devismes , Anaïs Durand

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

Combinatorics · Mathematics 2013-05-21 Xueliang Li , Yiyang Li , Yongtang Shi

We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…

Probability · Mathematics 2015-11-09 Varun Jog , Po-Ling Loh

The central result about fast rotating-flow structures is the Taylor-Proudman theorem (TPT) which connects various aspects of the dynamics. Taylor's geometrical proof of TPT is reproduced and extended substantially, with Lie's theory for…

Analysis of PDEs · Mathematics 2020-09-01 Jian-Zhou Zhu

Consider $n=\ell+m$ individuals, where $\ell\le m$, with $\ell$ individuals holding an opinion $A$ and $m$ holding an opinion $B$. Suppose that the individuals communicate via an undirected network $G$, and in each time step, each…

Combinatorics · Mathematics 2021-05-28 Ashwin Sah , Mehtaab Sawhney

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…

Group Theory · Mathematics 2020-09-23 Michael Larsen

Continuous-time random walks (CTRWs) with drift and position-dependent jumps provide a general framework for describing a wide range of natural and engineered systems. We analyze the stochastic differential equation associated with this…

Statistical Mechanics · Physics 2026-03-25 Marco Bianucci , Mauro Bologna , Riccardo Mannella

We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that…

Dynamical Systems · Mathematics 2024-03-08 Dawid Bucki

Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected…

Probability · Mathematics 2018-04-06 Eric Foxall , Tom Hutchcroft , Matthew Junge

Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…

Probability · Mathematics 2021-01-29 Noah Forman
‹ Prev 1 3 4 5 6 7 10 Next ›