Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Boyd, Zachary M."'
Influence propagation in social networks is a central problem in modern social network analysis, with important societal applications in politics and advertising. A large body of work has focused on cascading models, viral marketing, and finite-horiz
Externí odkaz:
http://arxiv.org/abs/2407.00213
Many empirical networks originate from correlational data, arising in domains as diverse as psychology, neuroscience, genomics, microbiology, finance, and climate science. Specialized algorithms and theory have been developed in different application
Externí odkaz:
http://arxiv.org/abs/2311.09536
Autor:
Boyd, Zachary M., Callor, Nick, Gledhill, Taylor, Jenkins, Abigail, Snellman, Robert, Webb, Benjamin Z., Wonnacott, Raelynn
Publikováno v:
Applied Network Science, 2023
Genealogical networks (i.e. family trees) are of growing interest, with the largest known data sets now including well over one billion individuals. Interest in family history also supports an 8.5 billion dollar industry whose size is projected to do
Externí odkaz:
http://arxiv.org/abs/2301.11965
We provide a rearrangement based algorithm for fast detection of subgraphs of $k$ vertices with long escape times for directed or undirected networks. Complementing other notions of densest subgraphs and graph cuts, our method is based on the mean hi
Externí odkaz:
http://arxiv.org/abs/2212.12839
Motivated by the COVID-19 pandemic, this paper explores the supply chain viability of medical equipment, an industry whose supply chain was put under a crucial test during the pandemic. This paper includes an empirical network-level analysis of suppl
Externí odkaz:
http://arxiv.org/abs/2104.14046
Autor:
Boyd, Zachary M., Fraiman, Nicolas, Marzuola, Jeremy L., Mucha, Peter J., Osting, Braxton, Weare, Jonathan
Publikováno v:
SIAM Journal on Mathematics of Data Science, Vol. 3, pp. 467-493 (2021)
The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning. Increasingly, there is interest in using asymmetric structur
Externí odkaz:
http://arxiv.org/abs/2006.14482
Autor:
Lavassani, Kayvan Miri1 Kayvan@Lavassani.ca, Boyd, Zachary M.2, Movahedi, Bahar1, Vasquez, Jason2
Publikováno v:
International Journal of Production Research. Dec2023, Vol. 61 Issue 24, p8468-8492. 25p.
Autor:
McGowan, Amanda L., Sayed, Farah, Boyd, Zachary M., Jovanova, Mia, Kang, Yoona, Speer, Megan E., Cosme, Danielle, Mucha, Peter J., Ochsner, Kevin N., Bassett, Dani S., Falk, Emily B., Lydon-Staley, David M.
Publikováno v:
In Biological Psychiatry 15 April 2023 93(8):681-689
Networks, which represent agents and interactions between them, arise in myriad applications throughout the sciences, engineering, and even the humanities. To understand large-scale structure in a network, a common task is to cluster a network's node
Externí odkaz:
http://arxiv.org/abs/1806.02485
Previous work has shown that the one-dimensional (1D) inviscid compressible flow (Euler) equations admit a wide variety of scale-invariant solutions (including the famous Noh, Sedov, and Guderley shock solutions) when the included equation of state (
Externí odkaz:
http://arxiv.org/abs/1712.08236