Zobrazeno 1 - 10
of 187
pro vyhledávání: '"Norros, Ilkka"'
A method for compression of large graphs and matrices to a block structure is further developed. Szemer\'edi's regularity lemma is used as a generic motivation of the significance of stochastic block models. Another ingredient of the method is Rissan
Externí odkaz:
http://arxiv.org/abs/1711.08629
A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the method is Ri
Externí odkaz:
http://arxiv.org/abs/1704.07114
This paper is focused on a class of spatial birth and death process of the Euclidean space where the birth rate is constant and the death rate of a given point is the shot noise created at its location by the other points of the current configuration
Externí odkaz:
http://arxiv.org/abs/1408.6888
Publikováno v:
IEEE Infocom 2013 - 32nd IEEE International Conference on Computer Communications (2013)
We propose a new model for peer-to-peer networking which takes the network bottlenecks into account beyond the access. This model can cope with key features of P2P networking like degree or locality constraints together with the fact that distant pee
Externí odkaz:
http://arxiv.org/abs/1304.6489
Publikováno v:
In Accident Analysis and Prevention January 2019 122:181-188
We propose a new model for peer-to-peer networking which takes the network bottlenecks into account beyond the access. This model allows one to cope with key features of P2P networking like degree or locality constraints or the fact that distant peer
Externí odkaz:
http://arxiv.org/abs/1108.4129
P2P systems provide a scalable solution for distributing large files in a network. The file is split into many chunks, and peers contact other peers to collect missing chunks to eventually complete the entire file. The so-called `rare chunk' phenomen
Externí odkaz:
http://arxiv.org/abs/1107.3166
Publikováno v:
Queueing Systems (2011) 67: 183
We consider five different peer-to-peer file sharing systems with two chunks, with the aim of finding chunk selection algorithms that have provably stable performance with any input rate and assuming non-altruistic peers who leave the system immediat
Externí odkaz:
http://arxiv.org/abs/0910.5577
Publikováno v:
Annals of Applied Probability 2009, Vol. 19, No. 4, 1385-1403
With $M(t):=\sup_{s\in[0,t]}A(s)-s$ denoting the running maximum of a fractional Brownian motion $A(\cdot)$ with negative drift, this paper studies the rate of convergence of $\mathbb {P}(M(t)>x)$ to $\mathbb{P}(M>x)$. We define two metrics that meas
Externí odkaz:
http://arxiv.org/abs/0908.4472
We study the size of the largest clique $\omega(G(n,\alpha))$ in a random graph $G(n,\alpha)$ on $n$ vertices which has power-law degree distribution with exponent $\alpha$. We show that for `flat' degree sequences with $\alpha>2$ whp the largest cli
Externí odkaz:
http://arxiv.org/abs/0905.0561