English
Related papers

Related papers: Scale-free random branching tree in supercritical …

200 papers

Key traits of unicellular species, like cell size, often follow scale-free or self-similar distributions, hinting at the possibility of an underlying critical process. However, linking such empirical scaling laws to the critical regime of…

Populations and Evolution · Quantitative Biology 2020-05-20 Jenny Held , Tom Lorimer , Francesco Pomati , Ruedi Stoop , Carlo Albert

The error threshold transition in a stochastic (i.e. finite population) version of the quasispecies model of molecular evolution is studied using finite-size scaling. For the single-sharp-peak replication landscape, the deterministic model…

Statistical Mechanics · Physics 2009-10-31 P. R. A. Campos , J. F. Fontanari

This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal…

Probability · Mathematics 2007-05-23 Alois Panholzer , Helmut Prodinger

In this paper, a simply rule that generates scale-free networks with very large clustering coefficient and very small average distance is presented. These networks are called {\bf Multistage Random Growing Networks}(MRGN) as the adding…

Computational Physics · Physics 2009-11-11 Jian-Guo Liu , Yan-Zhong Dang , Zhong-tuo Wang

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…

Populations and Evolution · Quantitative Biology 2025-10-16 Tobias Dieselhorst , Johannes Berg

Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree…

Physics and Society · Physics 2015-07-07 Débora Torres , Matías A. Di Muro , Cristian E. La Rocca , Lidia A. Braunstein

Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been…

Disordered Systems and Neural Networks · Physics 2014-02-17 Massimo Ostilli

We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time $n=1,2,\dots$, right before stepping, the walker adds a random number (possibly…

Probability · Mathematics 2023-11-10 János Engländer , Giulio Iacobelli , Rodrigo Ribeiro

We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…

Probability · Mathematics 2019-04-17 Josh Rosenberg

We investigate random graphs on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point carries an independent random mark and given marks and…

Probability · Mathematics 2022-05-02 Peter Gracar , Markus Heydenreich , Christian Mönch , Peter Mörters

In our previous work, we introduced the random $k$-cut number for rooted graphs. In this paper, we show that the distribution of the $k$-cut number in complete binary trees of size $n$, after rescaling, is asymptotically a periodic function…

Probability · Mathematics 2020-04-21 Xing Shi Cai , Cecilia Holmgren

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…

Probability · Mathematics 2010-11-09 Herve Guiol , Fabio P. Machado , Rinaldo B. Schinazi

By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…

Probability · Mathematics 2022-04-12 Tianyi Bai , Yijun Wan

We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the…

Disordered Systems and Neural Networks · Physics 2009-11-07 Reuven Cohen , Daniel ben-Avraham , Shlomo Havlin

In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…

Probability · Mathematics 2022-04-07 Ayan Bhattacharya

We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…

Probability · Mathematics 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…

Probability · Mathematics 2025-08-06 Benedikt Jahnel , Lukas Lüchtrath , Christian Mönch

Extreme events can come either from point processes, when the size or energy of the events is above a certain threshold, or from time series, when the intensity of a signal surpasses a threshold value. We are particularly concerned by the…

Statistical Mechanics · Physics 2017-07-26 Alvaro Corral

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

Probability · Mathematics 2014-04-16 Wei Su

We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…

Probability · Mathematics 2022-07-28 Tom Hutchcroft