Zobrazeno 1 - 10
of 101
pro vyhledávání: '"ZANETTI, LUCA"'
Autor:
Olesker-Taylor, Sam, Zanetti, Luca
We present a theoretical analysis of the Elo rating system, a popular method for ranking skills of players in an online setting. In particular, we study Elo under the Bradley--Terry--Luce model and, using techniques from Markov chain theory, show tha
Externí odkaz:
http://arxiv.org/abs/2406.05869
Autor:
Olesker-Taylor, Sam, Zanetti, Luca
In the Fastest Mixing Markov Chain problem, we are given a graph $G = (V, E)$ and desire the discrete-time Markov chain with smallest mixing time $\tau$ subject to having equilibrium distribution uniform on $V$ and non-zero transition probabilities o
Externí odkaz:
http://arxiv.org/abs/2111.05816
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution in time t
Externí odkaz:
http://arxiv.org/abs/2006.10589
Autor:
Zanetti, Luca
Graphs occurring in the real world usually exhibit a high level of order and organisation: higher concentration of edges within the same group of vertices, and lower concentration among different groups. A common way to analyse these graphs is to par
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.761085
Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance of spectral clustering algorit
Externí odkaz:
http://arxiv.org/abs/1908.02096
Autor:
Sauerwald, Thomas, Zanetti, Luca
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion properties which
Externí odkaz:
http://arxiv.org/abs/1903.01342
We study spectral approaches for the MAX-2-LIN(k) problem, in which we are given a system of $m$ linear equations of the form $x_i - x_j \equiv c_{ij}\mod k$, and required to find an assignment to the $n$ variables $\{x_i\}$ that maximises the total
Externí odkaz:
http://arxiv.org/abs/1811.10909
Autor:
Sun, He, Zanetti, Luca
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design
Externí odkaz:
http://arxiv.org/abs/1711.01262
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.