Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Johnson, Tobias"'
Bak, Tang, and Wiesenfeld introduced self-organized criticality with the example of a growing sandpile that reaches then sustains a critical density. They presented the abelian sandpile as a potential model. About a decade later, Dickman, Mu\~noz, Ve
Externí odkaz:
http://arxiv.org/abs/2411.02541
Bak, Tang, and Wiesenfeld developed their theory of self-organized criticality in the late 1980s to explain why many real-life processes exhibit signs of critical behavior despite the absence of a tuning parameter. A decade later, Dickman, Mu\~noz, V
Externí odkaz:
http://arxiv.org/abs/2406.01731
Autor:
Johnson, Tobias, Lindell, Carl
The elderly social care IT company Phoniro is developing solutions for deploying software using docker technologies. To secure quality in their deploy pipelines Phoniro would like to do automatic selenium testing within Docker containers. The project
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-43032
Autor:
Johnson, Tobias, Peköz, Erol
Publikováno v:
Stochastic Process. Appl., 152 1-31, 2022
Generalized gamma distributions arise as limits in many settings involving random graphs, walks, trees, and branching processes. Pek\"oz, R\"ollin, and Ross (2016, arXiv:1309.4183 [math.PR]) exploited characterizing distributional fixed point equatio
Externí odkaz:
http://arxiv.org/abs/2108.02101
Publikováno v:
Electron. J. Probab. 27: 1-19 (2022)
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in discrete time, ar
Externí odkaz:
http://arxiv.org/abs/2104.12797
Autor:
Johnson, Tobias
Publikováno v:
Combin. Probab. Comput., 31(2):184-367, 2022
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 event that a G
Externí odkaz:
http://arxiv.org/abs/2007.13864
Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively, and annih
Externí odkaz:
http://arxiv.org/abs/2005.06018
Autor:
Johnson, Tobias, Rolla, Leonardo T.
Publikováno v:
Electronic Communications in Probability, v. 24, n. 29 1-9, 2019
The frog model is an interacting particle system on a graph. Active particles perform independent simple random walks, while sleeping particles remain inert until visited by an active particle. Some number of sleeping particles are placed at each sit
Externí odkaz:
http://arxiv.org/abs/1809.03082
Publikováno v:
Random Structures Algorithms, 56(3):796--837, 2020
Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees rooted at $
Externí odkaz:
http://arxiv.org/abs/1808.03019
Publikováno v:
Forum of Mathematics, Sigma 7 (2019) e41
The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $\mu$ on the full $d$-ary tree of height $n$. If $\mu= \Omega( d^2)$, all of the vertices are visited in t
Externí odkaz:
http://arxiv.org/abs/1802.03428