Остановите войну!
for scientists:
default search action
Desmond J. Higham
- > Home > Persons > Desmond J. Higham
Publications
- 2024
- [j96]Francesca Arrigo, Desmond J. Higham, Vanni Noferini, Ryan Wood:
Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs. SIAM J. Matrix Anal. Appl. 45(1): 397-418 (2024) - 2023
- [j95]Henry-Louis de Kergorlay, Desmond J. Higham:
Connectivity of Random Geometric Hypergraphs. Entropy 25(11): 1555 (2023) - [j94]Francesco Tudisco, Desmond J. Higham:
Core-Periphery Detection in Hypergraphs. SIAM J. Math. Data Sci. 5(1): 1-21 (2023) - [i31]Peter Grindrod, Desmond John Higham, Henry-Louis de Kergorlay:
Estimating Network Dimension When the Spectrum Struggles. CoRR abs/2306.14266 (2023) - [i26]Henry-Louis de Kergorlay, Desmond J. Higham:
Connectivity of Random Geometric Hypergraphs. CoRR abs/2309.09305 (2023) - [i24]Catherine F. Higham, Desmond J. Higham, Peter Grindrod:
Diffusion Models for Generative Artificial Intelligence: An Introduction for Applied Mathematicians. CoRR abs/2312.14977 (2023) - 2022
- [j92]Desmond John Higham, Henry-Louis de Kergorlay:
Mean Field Analysis of Hypergraph Contagion Models. SIAM J. Appl. Math. 82(6): 1987-2007 (2022) - [c8]Catherine F. Higham, Desmond J. Higham, Francesco Tudisco:
Core-periphery Partitioning and Quantum Annealing. KDD 2022: 565-573 - [i23]Catherine F. Higham, Desmond J. Higham, Francesco Tudisco:
Testing a QUBO Formulation of Core-periphery Partitioning on a Quantum Annealer. CoRR abs/2201.01543 (2022) - [i22]Francesco Tudisco, Desmond J. Higham:
Core-periphery detection in hypergraphs. CoRR abs/2202.12769 (2022) - 2021
- [j91]Desmond J. Higham, Nicholas J. Higham, Srikara Pranesh:
Random Matrices Generating Large Growth in LU Factorization with Pivoting. SIAM J. Matrix Anal. Appl. 42(1): 185-201 (2021) - [j90]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
A Theory for Backtrack-Downweighted Walks. SIAM J. Matrix Anal. Appl. 42(3): 1229-1247 (2021) - [i20]Francesco Tudisco, Desmond J. Higham:
Node and Edge Eigenvector Centrality for Hypergraphs. CoRR abs/2101.06215 (2021) - [i19]Austin R. Benson, David F. Gleich, Desmond J. Higham:
Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data. CoRR abs/2103.05031 (2021) - [i18]Desmond John Higham, Henry-Louis de Kergorlay:
Epidemics on Hypergraphs: Spectral Thresholds for Extinction. CoRR abs/2103.07319 (2021) - 2020
- [i13]Henry-Louis de Kergorlay, Desmond John Higham:
Consistency of Anchor-based Spectral Clustering. CoRR abs/2006.13984 (2020) - [i11]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
A Theory for Backtrack-Downweighted Walks. CoRR abs/2012.02999 (2020) - 2019
- [j89]Francesco Tudisco, Desmond J. Higham:
A fast and robust kernel optimization method for core-periphery detection in directed and weighted graphs. Appl. Netw. Sci. 4(1): 75 (2019) - [j87]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
Non-backtracking PageRank. J. Sci. Comput. 80(3): 1419-1437 (2019) - [j85]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
Non-Backtracking Alternating Walks. SIAM J. Appl. Math. 79(3): 781-801 (2019) - [j84]Catherine F. Higham, Desmond J. Higham:
Deep Learning: An Introduction for Applied Mathematicians. SIAM Rev. 61(4): 860-891 (2019) - [j83]Francesco Tudisco, Desmond J. Higham:
A Nonlinear Spectral Method for Core-Periphery Detection in Networks. SIAM J. Math. Data Sci. 1(2): 269-292 (2019) - [i10]Pierre Blanchard, Desmond J. Higham, Nicholas J. Higham:
Accurate Computation of the Log-Sum-Exp and Softmax Functions. CoRR abs/1909.03469 (2019) - [i9]Francesca Arrigo, Desmond J. Higham, Francesco Tudisco:
A framework for second order eigenvector centralities and clustering coefficients. CoRR abs/1910.12711 (2019) - 2018
- [j82]Francesca Arrigo, Peter Grindrod, Desmond J. Higham, Vanni Noferini:
Non-backtracking walk centrality for directed networks. J. Complex Networks 6(1): 54-78 (2018) - [j80]Peter Grindrod, Desmond J. Higham, Vanni Noferini:
The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis. SIAM J. Matrix Anal. Appl. 39(1): 310-341 (2018) - [i8]Catherine F. Higham, Desmond J. Higham:
Deep Learning: An Introduction for Applied Mathematicians. CoRR abs/1801.05894 (2018) - [i7]Francesco Tudisco, Desmond J. Higham:
A Nonlinear Spectral Method for Core-Periphery Detection in Networks. CoRR abs/1804.09820 (2018) - 2017
- [j79]Francesca Arrigo, Desmond J. Higham:
Sparse matrix computations for dynamic network centrality. Appl. Netw. Sci. 2: 17 (2017) - [j78]Caterina Fenu, Desmond J. Higham:
Block Matrix Formulations for Evolving Networks. SIAM J. Matrix Anal. Appl. 38(2): 343-360 (2017) - 2016
- [j76]Michele Benzi, Desmond J. Higham:
Commentary on Dehmer and Mowshowitz. Complex. 21(S1): 19 (2016) - [j75]Mary Aprahamian, Desmond J. Higham, Nicholas J. Higham:
Matching exponential-based and resolvent-based centrality measures. J. Complex Networks 4(2): 157-176 (2016) - [c6]Francesca Arrigo, Desmond J. Higham:
Preserving Sparsity in Dynamic Network Computations. COMPLEX NETWORKS 2016: 147-157 - 2015
- [i4]Caterina Fenu, Desmond J. Higham:
Block Matrix Formulations for Evolving Networks. CoRR abs/1511.07305 (2015) - 2014
- [i3]Desmond J. Higham, Peter Grindrod, Alexander V. Mantzaris, Amanda Otley, Peter Laflin:
Anticipating Activity in Social Media Spikes. CoRR abs/1406.2017 (2014) - [i2]Peter Grindrod, Desmond J. Higham, Robert S. MacKay:
Opportunities at the Mathematics/Future Cities Interface. CoRR abs/1409.1831 (2014) - 2013
- [j59]Alexander V. Mantzaris, Danielle S. Bassett, Nicholas F. Wymbs, Ernesto Estrada, Mason A. Porter, Peter J. Mucha, Scott T. Grafton, Desmond J. Higham:
Dynamic network centrality summarizes learning in the human brain. J. Complex Networks 1(1): 83-92 (2013) - [j56]Peter Grindrod, Desmond J. Higham:
A Matrix Iteration for Dynamic Network Summaries. SIAM Rev. 55(1): 118-128 (2013) - [j52]Peter Laflin, Alexander V. Mantzaris, Fiona Ainley, Amanda Otley, Peter Grindrod, Desmond J. Higham:
Discovering and validating influence in a dynamic online social network. Soc. Netw. Anal. Min. 3(4): 1311-1323 (2013) - [i1]Peter Grindrod, Desmond J. Higham:
Dynamical Systems to Monitor Complex Networks in Continuous Time. CoRR abs/1305.7430 (2013) - 2012
- [j51]Peter Grindrod, Desmond J. Higham, Mark C. Parsons:
Bistability through Triadic Closure. Internet Math. 8(4): 402-423 (2012) - [c5]Peter Laflin, Alexander V. Mantzaris, Fiona Ainley, Amanda Otley, Peter Grindrod, Desmond J. Higham:
Dynamic Targeting in an Online Social Medium. SocInfo 2012: 82-95 - [c4]Peter Laflin, Fiona Ainley, Amanda Otley, Alexander V. Mantzaris, Desmond J. Higham:
Demonstration of Dynamic Targeting in an Online Social Medium. SocInfo 2012: 539-542 - 2010
- [j41]Ernesto Estrada, Desmond J. Higham:
Network Properties Revealed through Matrix Functions. SIAM Rev. 52(4): 696-714 (2010) - [p2]Ernesto Estrada, Maria Fox, Desmond J. Higham, Gian-Luca Oppo:
Complex Networks: An Invitation. Network Science 2010: 1-11 - [e1]Ernesto Estrada, Maria Fox, Desmond J. Higham, Gian-Luca Oppo:
Network Science - Complexity in Nature and Technology. Springer 2010, ISBN 978-1-84996-395-4 [contents] - 2005
- [b2]Desmond J. Higham, Nicholas J. Higham:
Matlab guide, Second Edition. SIAM 2005, ISBN 978-0-89871-578-1, pp. I-XXIII, 1-382 - 2000
- [b1]Desmond J. Higham, Nicholas J. Higham:
Matlab guide. SIAM 2000, ISBN 978-0-89871-469-2, pp. I-XXII, 1-283 - 1998
- [j7]Desmond J. Higham, Nicholas J. Higham:
Structured Backward Error and Condition of Generalized Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 20(2): 493-512 (1998) - 1992
- [j5]Desmond J. Higham, Nicholas J. Higham:
Backward Error and Condition of Structured Linear Systems. SIAM J. Matrix Anal. Appl. 13(1): 162-175 (1992)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint