45 citations · 69 across the 25 of their papers we have counts for
5 papers · 1 filter
Counting cliques and cycles in scale-free inhomogeneous random graphs
A. J. E. M. Janssen, Johan S. H. van Leeuwaarden, Seva Shneer
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models,…
The variance of the average depth of a pure birth process converges to 7
Ken R. Duffy, Gianfelice Meli, Seva Shneer
If trees are constructed from a pure birth process and one defines the depth of a leaf to be the number of edges to its root, it is known that the variance in the depth of a random…
Stability and moment bounds under utility-maximising service allocations: finite and infinite networks
Seva Shneer, Alexander Stolyar
We study networks of interacting queues governed by utility-maximising service-rate allocations in both discrete and continuous time. For {\em finite} networks we establish stabili…
Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks
Seva Shneer, Alexander Stolyar
We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interf…
Limit theorems and structural properties of the Cat-and-Mouse Markov chain
Timofei Prasolov, Sergey Foss, Seva Shneer
We revisit the so-called Cat-and-Mouse Markov chain, studied earlier by Litvak and Robert (2012). This is a 2-dimensional Markov chain on the lattice , where the firs…