output
19942026
most citedSignatures of Majorana fermions in hybrid superconductor-semiconductor nanowire devices

4.2k citations

Showing 2013 · math.PRShow all

13 papers · 2 filters

math.PR2013★ 26 cited

The age of information in gossip networks

Jori Selen, Yoni Nazarathy, Lachlan L. H. Andrew +1

We introduce models of gossip based communication networks in which each node is simultaneously a sensor, a relay and a user of information. We model the status of ages of informat…

math.PR2013★ 1 cited

Degrees and distances in random and evolving Apollonian networks

István Kolossváry, Júlia Komjáthy, Lajos Vágó

This paper studies Random and Evolving Apollonian networks (RANs and EANs), in d dimension for any d>=2, i.e. dynamically evolving random d dimensional simplices looked as graphs i…

math.PR2013

Queues and risk processes with dependencies

E. S. Badila, O. J. Boxma, J. A. C. Resing

We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out…

math.PR2013★ 3 cited

Degree distribution of shortest path trees and bias of network sampling algorithms

Shankar Bhamidi, Jesse Goodman, Remco van der Hofstad +1

In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determi…

math.PR2013

State space collapse for critical multistage epidemics

Florian Simatos

We study a multistage epidemic model which generalizes the SIR model and where infected individuals go through K>0 stages of the epidemic before being removed. An infected individu…

math.PR2013

On the Sojourn Time Distribution in a Finite Population Markovian Processor Sharing Queue

Qiang Zhen, Johan S. H. van Leeuwaarden, Charles Knessl

We consider a finite population processor-sharing (PS) queue, with Markovian arrivals and an exponential server. Such a queue can model an interactive computer system consisting of…

math.PR2013

BRAVO for many-server QED systems with finite buffers

Daryl J. Daley, Johan S. H. van Leeuwaarden, Yoni Nazarathy

This paper demonstrates the occurrence of the feature called BRAVO (Balancing Reduces Asymptotic Variance of Output) for the departure process of a finite-buffer Markovian many-ser…

math.PR2013★ 1 cited

Delay performance in random-access grid networks

Alessandro Zocca, Sem C. Borst, Johan S. H. van Leeuwaarden +1

We examine the impact of torpid mixing and meta-stability issues on the delay performance in wireless random-access networks. Focusing on regular meshes as prototypical scenarios,…

math.PR2013★ 1 cited

Scaled control in the QED regime

A. J. E. M. Janssen, J. S. H. van Leeuwaarden, Jaron Sanders

We develop many-server asymptotics in the QED regime for models with admission control. The admission control, designed to reduce the incoming traffic in periods of congestion, sca…

math.PR2013★ 10 cited

Limit theorems for reflected Ornstein-Uhlenbeck processes

Gang Huang, Michel Mandjes, Peter Spreij

This paper studies one-dimensional Ornstein-Uhlenbeck processes, with the distinguishing feature that they are reflected on a single boundary (put at level 0) or two boundaries (pu…

math.PR2013

Asymptotics of the maximum of Brownian motion under Erlangian sampling

A. J. E. M. Janssen, J. S. H. van Leeuwaarden

Consider the all-time maximum of a Brownian motion with negative drift. Assume that this process is sampled at certain points in time, where the time between two consecutive points…

math.PR2013

First passage times to congested states of many-server systems in the Halfin-Whitt regime

Brian H. Fralix, Charles Knessl, Johan S. H. van Leeuwaarden

We consider the heavy-traffic approximation to the queueing system in the Halfin-Whitt regime, where both the number of servers and the arrival rate grow large (ta…

math.PR2013

Staffing many-server systems with admission control and retrials

A. J. E. M. Janssen, Johan S. H. van Leeuwaarden

In many-server systems it is crucial to staff the right number of servers so that targeted service levels are met. These staffing problems typically lead to constraint satisfaction…