Giovanni Luca Torrisi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Giovanni Luca Torrisi has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Emilio Leonardi
Politecnico di Torino, Italy
4 shared publications - Nicolas Privault
Nanyang Technological University
4 shared publications - Ayalvadi Ganesh
Microsoft Research
3 shared publications - Ian Flint
School of Agriculture, Food and Ecosystem Sciences The University of Melbourne Parkville Victoria Australia
3 shared publications - Ken. R. Duffy
Northeastern University
3 shared publications Charles Bordenave
Department of Electrical Engineering and Computer Science University of California Berkeley
2 shared publications
Latest Publications
- 22 November 2018
- Published by Springer Nature in Potential Analysis
- Vol. 52 (2) , 223-243
Bounds in Total Variation Distance for Discrete-time Processes on the Sequence Space
- 22 November 2018
- Published by Springer Nature in Potential Analysis
- Vol. 52 (2) , 223-243
Bounds in Total Variation Distance for Discrete-time Processes on the Sequence Space
- Open Access
Modeling LRU caches with Shot Noise request processes
In this paper we analyze Least Recently Used (LRU) caches operating under the Shot Noise requests Model (SNM). The SNM was recently proposed to better capture the main characteristics of today Video on Demand (VoD) traffic. We investigate the validity of Che's approximation through an asymptotic analysis of the cache eviction time. In particular, we provide a large deviation principle, a law of large numbers and a central limit theorem for the cache eviction time, as the cache size grows large. Finally, we derive upper and lower bounds for the "hit" probability in tandem networks of caches under Che's approximation.
Open AccessModeling LRU caches with Shot Noise request processes
In this paper we analyze Least Recently Used (LRU) caches operating under the Shot Noise requests Model (SNM). The SNM was recently proposed to better capture the main characteristics of today Video on Demand (VoD) traffic. We investigate the validity of Che's approximation through an asymptotic analysis of the cache eviction time. In particular, we provide a large deviation principle, a law of large numbers and a central limit theorem for the cache eviction time, as the cache size grows large. Finally, we derive upper and lower bounds for the "hit" probability in tandem networks of caches under Che's approximation.
- Open Access
Generalized threshold-based epidemics in random graphs: the power of extreme values
Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in the context of random graphs, where it can serve as a simple model for a wide variety of cascades, such as the spreading of ideas, trends, viral contents, etc. over large social networks. In particular, it has been shown that in $G(n,p)$ the final active set can exhibit a phase transition for a sub-linear number of seeds. In this paper, we propose a unique framework to study similar sub-linear phase transitions for a much broader class of graph models and epidemic processes. Specifically, we consider i) a generalized version of bootstrap percolation in $G(n,p)$ with random activation thresholds and random node-to-node influences; ii) different random graph models, including graphs with given degree sequence and graphs with community structure (block model). The common thread of our work is to show the surprising sensitivity of the critical seed set size to extreme values of distributions, which makes some systems dramatically vulnerable to large-scale outbreaks. We validate our results running simulation on both synthetic and real graphs.Open AccessGeneralized threshold-based epidemics in random graphs: the power of extreme values
Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in the context of random graphs, where it can serve as a simple model for a wide variety of cascades, such as the spreading of ideas, trends, viral contents, etc. over large social networks. In particular, it has been shown that in $G(n,p)$ the final active set can exhibit a phase transition for a sub-linear number of seeds. In this paper, we propose a unique framework to study similar sub-linear phase transitions for a much broader class of graph models and epidemic processes. Specifically, we consider i) a generalized version of bootstrap percolation in $G(n,p)$ with random activation thresholds and random node-to-node influences; ii) different random graph models, including graphs with given degree sequence and graphs with community structure (block model). The common thread of our work is to show the surprising sensitivity of the critical seed set size to extreme values of distributions, which makes some systems dramatically vulnerable to large-scale outbreaks. We validate our results running simulation on both synthetic and real graphs. - Open Access
Stochastic dynamics of determinantal processes by integration by parts
We derive an integration by parts formula for functionals of determinantal processes on compact sets, completing the arguments of [4]. This is used to show the existence of a configuration-valued diffusion process which is non-colliding and admits the distribution of the determinantal process as reversible law. In particular, this approach allows us to build a concrete example of the associated diffusion process, providing an illustration of the results of [4] and [30].
Open AccessStochastic dynamics of determinantal processes by integration by parts
We derive an integration by parts formula for functionals of determinantal processes on compact sets, completing the arguments of [4]. This is used to show the existence of a configuration-valued diffusion process which is non-colliding and admits the distribution of the determinantal process as reversible law. In particular, this approach allows us to build a concrete example of the associated diffusion process, providing an illustration of the results of [4] and [30].
- 1 September 2015
- Published by Louisiana State University Libraries in Communications on Stochastic Analysis
- Vol. 9 (3) , 5
Stochastic dynamics of determinantal processes by integration by parts
- 1 September 2015
- Published by Louisiana State University Libraries in Communications on Stochastic Analysis
- Vol. 9 (3) , 5
Stochastic dynamics of determinantal processes by integration by parts
- 11 March 2015
- Published by Springer Nature in Potential Analysis
- Vol. 43 (2) , 289-311
Gaussian Estimates for the Solutions of Some One-dimensional Stochastic Equations
- 11 March 2015
- Published by Springer Nature in Potential Analysis
- Vol. 43 (2) , 289-311
Gaussian Estimates for the Solutions of Some One-dimensional Stochastic Equations
- Open Access
Large deviations of the interference in the Ginibre network model
Under different assumptions on the distribution of the fading random variables, we derive large deviation estimates for the tail of the interference in a wireless network model whose nodes are placed, over a bounded region of the plane, according to the $\beta$-Ginibre process, $0<\beta\leq 1$. The family of $\beta$-Ginibre processes is formed by determinantal point processes, with different degree of repulsiveness, which converge in law to a homogeneous Poisson process, as $\beta \to 0$. In this sense the Poisson network model may be considered as the limiting uncorrelated case of the $\beta$-Ginibre network model. Our results indicate the existence of two different regimes. When the fading random variables are bounded or Weibull superexponential, large values of the interference are typically originated by the sum of several equivalent interfering contributions due to nodes in the vicinity of the receiver. In this case, the tail of the interference has, on the log-scale, the same asymptotic behavior for any value of $0<\beta\le 1$, but it differs (again on a log-scale) from the asymptotic behavior of the tail of the interference in the Poisson network model. When the fading random variables are exponential or subexponential, instead, large values of the interference are typically originated by a single dominating interferer node and, on the log-scale, the asymptotic behavior of the tail of the interference is essentially insensitive to the distribution of the nodes. As a consequence, on the log-scale, the asymptotic behavior of the tail of the interference in any $\beta$-Ginibre network model, $0<\beta\le 1$, is the same as in the Poisson network model.Open AccessLarge deviations of the interference in the Ginibre network model
Under different assumptions on the distribution of the fading random variables, we derive large deviation estimates for the tail of the interference in a wireless network model whose nodes are placed, over a bounded region of the plane, according to the $\beta$-Ginibre process, $0<\beta\leq 1$. The family of $\beta$-Ginibre processes is formed by determinantal point processes, with different degree of repulsiveness, which converge in law to a homogeneous Poisson process, as $\beta \to 0$. In this sense the Poisson network model may be considered as the limiting uncorrelated case of the $\beta$-Ginibre network model. Our results indicate the existence of two different regimes. When the fading random variables are bounded or Weibull superexponential, large values of the interference are typically originated by the sum of several equivalent interfering contributions due to nodes in the vicinity of the receiver. In this case, the tail of the interference has, on the log-scale, the same asymptotic behavior for any value of $0<\beta\le 1$, but it differs (again on a log-scale) from the asymptotic behavior of the tail of the interference in the Poisson network model. When the fading random variables are exponential or subexponential, instead, large values of the interference are typically originated by a single dominating interferer node and, on the log-scale, the asymptotic behavior of the tail of the interference is essentially insensitive to the distribution of the nodes. As a consequence, on the log-scale, the asymptotic behavior of the tail of the interference in any $\beta$-Ginibre network model, $0<\beta\le 1$, is the same as in the Poisson network model. - 25 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (12) , 8386-8401
Asymptotic Properties of Sequential Streaming Leveraging Users' Cooperation
We consider a communication system in which a given digital content has to be delivered sequentially at constant rate to a set of users who asynchronously request it according to a Poisson process. Users can retrieve data: 1) from one or more sources that statically store the entire content; and 2) from users who have previously requested the content, and contribute (for limited time) a random amount of upload bandwidth to the system. We propose a stochastic fluid framework that allows characterizing the aggregate streaming rate necessary at the sources to satisfy all active requests. In particular, we establish the conditions under which the system becomes asymptotically scalable as the number of users grows. Our theoretical results apply to increasingly popular video-on-demand systems exploiting users' cooperation.
- 25 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (12) , 8386-8401
Asymptotic Properties of Sequential Streaming Leveraging Users' Cooperation
We consider a communication system in which a given digital content has to be delivered sequentially at constant rate to a set of users who asynchronously request it according to a Poisson process. Users can retrieve data: 1) from one or more sources that statically store the entire content; and 2) from users who have previously requested the content, and contribute (for limited time) a random amount of upload bandwidth to the system. We propose a stochastic fluid framework that allows characterizing the aggregate streaming rate necessary at the sources to satisfy all active requests. In particular, we establish the conditions under which the system becomes asymptotically scalable as the number of users grows. Our theoretical results apply to increasingly popular video-on-demand systems exploiting users' cooperation.
- 1 September 2011
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 48 (03) , 688-698
Sample Path Large Deviations of Poisson Shot Noise with Heavy-Tailed Semiexponential Distributions
It is shown that the sample paths of Poisson shot noise with heavy-tailed semiexponential distributions satisfy a large deviation principle with a rate function that is insensitive to the shot shape. This demonstrates that, on the scale of large deviations, paths to rare events do not depend on the shot shape.
- 1 September 2011
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 48 (03) , 688-698
Sample Path Large Deviations of Poisson Shot Noise with Heavy-Tailed Semiexponential Distributions
It is shown that the sample paths of Poisson shot noise with heavy-tailed semiexponential distributions satisfy a large deviation principle with a rate function that is insensitive to the shot shape. This demonstrates that, on the scale of large deviations, paths to rare events do not depend on the shot shape.
- 1 March 2011
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 48 (01) , 238-257
Sample Path Large Deviations for Order Statistics
We consider the sample paths of the order statistics of independent and identically distributed random variables with common distribution function F. If F is strictly increasing but possibly having discontinuities, we prove that the sample paths of the order statistics satisfy the large deviation principle in the Skorokhod M 1 topology. Sanov's theorem is deduced in the Skorokhod M'1 topology as a corollary to this result. A number of illustrative examples are presented, including applications to the sample paths of trimmed means and Hill plots.
- 1 March 2011
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 48 (01) , 238-257
Sample Path Large Deviations for Order Statistics
We consider the sample paths of the order statistics of independent and identically distributed random variables with common distribution function F. If F is strictly increasing but possibly having discontinuities, we prove that the sample paths of the order statistics satisfy the large deviation principle in the Skorokhod M 1 topology. Sanov's theorem is deduced in the Skorokhod M'1 topology as a corollary to this result. A number of illustrative examples are presented, including applications to the sample paths of trimmed means and Hill plots.