Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Torres, Leo"'
Autor:
Klein, Brennan, LaRock, Timothy, McCabe, Stefan, Torres, Leo, Friedland, Lisa, Kos, Maciej, Privitera, Filippo, Lake, Brennan, Kraemer, Moritz U. G., Brownstein, John S., Gonzalez, Richard, Lazer, David, Eliassi-Rad, Tina, Scarpino, Samuel V., Vespignani, Alessandro, Chinazzi, Matteo
The COVID-19 pandemic offers an unprecedented natural experiment providing insights into the emergence of collective behavioral changes of both exogenous (government mandated) and endogenous (spontaneous reaction to infection risks) origin. Here, we
Externí odkaz:
http://arxiv.org/abs/2212.08873
Autor:
Torres, Leo
We completely characterize the conditions under which a complex unitary number is an eigenvalue of the non-backtracking matrix of an undirected graph. Further, we provide a closed formula to compute its geometric multiplicity and describe an algorith
Externí odkaz:
http://arxiv.org/abs/2205.02004
Publikováno v:
Discrete Mathematics, 346(10):113536 (2023)
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural properties o
Externí odkaz:
http://arxiv.org/abs/2203.10824
Autor:
Torres, Leo
Consider a finite undirected unweighted graph G and add a new node to it arbitrarily connecting it to pre-existing nodes. We study the behavior of the Perron eigenvalue of the non-backtracking matrix of G before and after such a node addition. We pro
Externí odkaz:
http://arxiv.org/abs/2111.09037
Autor:
McCabe, Stefan, Torres, Leo, LaRock, Timothy, Haque, Syed Arefinul, Yang, Chia-Hung, Hartle, Harrison, Klein, Brennan
Publikováno v:
Journal of Open Source Software, 2021
Over the last two decades, alongside the increased availability of large network datasets, we have witnessed the rapid rise of network science. For many systems, however, the data we have access to is not a direct description of the underlying networ
Externí odkaz:
http://arxiv.org/abs/2010.16019
Autor:
Torres, Leo
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the eigenvalues of
Externí odkaz:
http://arxiv.org/abs/2007.13611
Complex systems thinking is applied to a wide variety of domains, from neuroscience to computer science and economics. The wide variety of implementations has resulted in two key challenges: the progenation of many domain-specific strategies that are
Externí odkaz:
http://arxiv.org/abs/2006.02870
The non-backtracking matrix and its eigenvalues have many applications in network science and graph mining, such as node and edge centrality, community detection, length spectrum theory, graph distance, and epidemic and percolation thresholds. Moreov
Externí odkaz:
http://arxiv.org/abs/2002.12309
Publikováno v:
In Discrete Mathematics October 2023 346(10)
Graph embedding seeks to build a low-dimensional representation of a graph G. This low-dimensional representation is then used for various downstream tasks. One popular approach is Laplacian Eigenmaps, which constructs a graph embedding based on the
Externí odkaz:
http://arxiv.org/abs/1905.09763