Related papers: The limiting shape of a full mailbox
This paper focuses on the problem of modeling the correspondence pattern for ordinary people. Suppose that letters arrive at a rate $\lambda$ and are answered at a rate $\mu$. Furthermore, we assume that, for a constant $T$, a letter is…
We study the analytical properties of a one-side order book model in which the flows of limit and market orders are Poisson processes and the distribution of lifetimes of cancelled orders is exponential. Although simplistic, the model…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
We consider one dimensional tight binding models on $\ell^2(\mathbb Z)$ whose spatial structure is encoded by a Sturmian sequence $(\xi_n)_n\in \{a,b\}^\mathbb Z$. An example is the Kohmoto Hamiltonian, which is given by the discrete…
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
The boundary modified contact process models an epidemic spreading in one dimension with two infection parameters, $\lambda_i$ and $\lambda_e$. Starting from a finite infected set, each edge of $\mathbb{Z}$ transmits the infection at rate…
Let $\Lambda$ be the limit set of an infinite conformal iterated function system and let $F$ denote the set of fixed points of the maps. We prove that the box dimension of $\Lambda$ exists if and only if \[ \overline{\dim}_{\mathrm B} F\leq…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
We study a sender-receiver model in which the receiver can commit to a decision rule before the sender determines the information policy. The decision rule can depend on the information structure chosen by the sender and the realized…
The bulk-edge correspondence in topological phases is extended to systems with the generalized chiral symmetry, where the conventional chiral symmetry is broken. In such systems, we find that the edge state exhibits an unconventional…
In a recent letter, Barabasi claims that the dynamics of a number of human activities are scale-free [1]. He specifically reports that the probability distribution of time intervals tau between consecutive e-mails sent by a single user and…
We consider a Brownian particle with diffusion coefficient $D$ in a $d$-dimensional ball of radius $R$ with reflecting boundaries. We study the maximum $M_x(t)$ of the trajectory of the particle along the $x$-direction at time $t$. In the…
We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…
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,…
We study the limit shape of the boundary of the leaky sandpile model on isoradial graphs. These graphs are equipped with conductances and masses introduced by Boutillier, de Tili\`ere and Raschel, which are defined with the help of the…
We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…
At the continuous level, we consider two types of tumor growth models: the cell density model, which is based on the fluid mechanical construction, is more favorable for scientific interpretation and numerical simulations; and the free…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…
We study reaction-diffusion particle systems with several interaction mechanisms. As the number of particles tends to infinity, the system admits a mean-field limit describing the bulk behaviour. We focus on determining the propagation…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…