Zobrazeno 1 - 10
of 637
pro vyhledávání: '"Random Growth Model"'
Autor:
Jiang, Yuhan
The multispecies asymmetric simple exclusion process (mASEP) is a Markov chain in which particles of different species hop along a one-dimensional lattice. This paper studies the doubly asymmetric simple exclusion process $\mathrm{DASEP}(n,p,q)$ in w
Externí odkaz:
http://arxiv.org/abs/2312.09427
Publikováno v:
In Theoretical Computer Science 9 January 2023 940 Part A:36-51
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distributio
Externí odkaz:
http://arxiv.org/abs/2008.03831
Autor:
Higgs, Frankie
We consider a model of planar random aggregation from the ALE$(0,\eta)$ family where particles are attached preferentially in areas of low harmonic measure. We find that the model undergoes a phase transition in negative $\eta$, where for sufficientl
Externí odkaz:
http://arxiv.org/abs/2003.13632
Autor:
Turnbull, Shane, Turner, Amanda
Publikováno v:
Electron. Commun. Probab. 25 (2020), no. 26, 1-14
We consider a variation of the Hastings-Levitov model HL(0) for random growth in which the growing cluster consists of two competing regions. We allow the size of successive particles to depend both on the region in which the particle is attached, an
Externí odkaz:
http://arxiv.org/abs/1907.03717
Publikováno v:
Communications in Mathematical Physics 371 (2019), 285-329
We consider a family of growth models defined using conformal maps in which the local growth rate is determined by $|\Phi_n'|^{-\eta}$, where $\Phi_n$ is the aggregate map for $n$ particles. We establish a scaling limit result in which strong feedbac
Externí odkaz:
http://arxiv.org/abs/1804.08462
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
EPJ ST 223 (2014) 2593-2610
We propose a model to create synthetic networks that may also serve as a narrative of a certain kind of infrastructure network evolution. It consists of an initialization phase with the network extending tree-like for minimum cost and a growth phase
Externí odkaz:
http://arxiv.org/abs/1602.02562
Publikováno v:
COMPLEX NETWORKS 2020-9th International Conference on Complex Networks and their Applications
COMPLEX NETWORKS 2020-9th International Conference on Complex Networks and their Applications, Dec 2020, Madrid / Virtual, Spain
Studies in Computational Intelligence ISBN: 9783030653507
COMPLEX NETWORKS (2)
Theoretical Computer Science
Theoretical Computer Science, 2023, 940 (Part A), pp.36-51. ⟨10.1016/j.tcs.2022.10.036⟩
COMPLEX NETWORKS 2020-9th International Conference on Complex Networks and their Applications, Dec 2020, Madrid / Virtual, Spain
Studies in Computational Intelligence ISBN: 9783030653507
COMPLEX NETWORKS (2)
Theoretical Computer Science
Theoretical Computer Science, 2023, 940 (Part A), pp.36-51. ⟨10.1016/j.tcs.2022.10.036⟩
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distributio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8cada5292789fd796dedd7d47a4c526
https://doi.org/10.1016/j.tcs.2022.10.036
https://doi.org/10.1016/j.tcs.2022.10.036