Related papers: Return to the Poissonian City
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
A stochastic flow network is a directed graph with incoming edges (inputs) and outgoing edges (outputs), tokens enter through the input edges, travel stochastically in the network, and can exit the network through the output edges. Each…
We study the performance of wireless links for a class of Poisson networks, in which packets arrive at the transmitters following Bernoulli processes. By combining stochastic geometry with queueing theory, two fundamental measures are…
Directed acyclic graphs are widely used to describe the causal effects among random variables, and the inference of those causal effects has become an popular topic in statistics and machine learning, and has wide applications in…
In this work we show that in a microfluidic network and in low Reynolds numbers a system can be irreversible because of hysteresis effects.The network, which is employed in our simulations, is taken from recent experiments. The network…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arrivals of packets in each flow follow a Poisson process.…
This study introduces an algorithm that generates undirected graphs with three main characteristics of real-world networks: scale-freeness, short distances between nodes (small-world phenomenon), and large clustering coefficients. The main…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
A stationary stochastic geometric model is proposed for analyzing the data compression method used in one-bit compressed sensing. The data set is an unconstrained stationary set, for instance all of $\mathbb{R}^n$ or a stationary Poisson…
We represent transport between different regions of a fluid domain by flow networks, constructed from the discrete representation of the Perron-Frobenius or transfer operator associated to the fluid advection dynamics. The procedure is…
We study a coarsening process of one-dimensional cell complexes. We show that if cell boundaries move with velocities proportional to the difference in size of neighboring cells, then the average cell size grows at a prescribed exponential…
The Origin-Destination~(OD) networks provide an estimation of the flow of people from every region to others in the city, which is an important research topic in transportation, urban simulation, etc. Given structural regional urban…
We prove existence and uniqueness of solutions to a transport equation modelling vehicular traffic in which the velocity field depends non-locally on the downstream traffic density via a discontinuous anisotropic kernel. The result is…
Spatial Poisson point processes on finite-dimensional Euclidean space provide fundamental mathematical tools for modeling random spatial point patterns. In this paper, we introduce and analyze several Poisson-type spatial point processes.…
We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost surely contains infinitely many copies of…
In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service…
The geodesic structure is very closely related to the trace of the Laplace operator, involved in the calculation of the expectation value of the energy momentum tensor in Universes with non trivial topology. The purpose of this work is to…