Alec Kirkley
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
Research Subjects
Alec Kirkley has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Federico Battiston
Luiss University of Rome
5 shared publications - Mark E. J. Newman
Center for the Study of Complex Systems, University of Michigan, Ann Arbor, USA
4 shared publications - Gourab Ghoshal
Department of Physics and Astronomy, University of Rochester, Rochester, USA
3 shared publications Helcio Felippe
Department of Network and Data Science Central European University 1100 Vienna Austria
3 shared publications- Maximilian Jerdee
Department of Physics, University of Michigan, Ann Arbor, MI 48109, USA
3 shared publications - Baiyue He
Institute of Data Science, University of Hong Kong, Hong Kong, China
2 shared publications
Latest Publications
- Open Access
- 5 June 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (23) , eaec5619
Information theory for hypergraph similarity
Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network comparison are limited to pairwise interactions only. Here, we construct a general information theoretic framework for hypergraph similarity, capturing meaningful correspondence among higher-order interactions while correcting for spurious correlations. Our method operationalizes any notion of structural overlap among hypergraphs as a principled normalized mutual information measure, allowing us to derive a hierarchy of increasingly granular formulations of similarity among hypergraphs within and across orders of interactions and at multiple scales. We validate these measures through extensive experiments on synthetic hypergraphs and apply the framework to reveal meaningful patterns in a variety of empirical higher-order networks. Our work provides foundational tools for the principled comparison of higher-order networks, shedding light on the structural organization of networked systems with nondyadic interactions.
- 5 June 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (23) , eaec5619
Open AccessInformation theory for hypergraph similarity
Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network comparison are limited to pairwise interactions only. Here, we construct a general information theoretic framework for hypergraph similarity, capturing meaningful correspondence among higher-order interactions while correcting for spurious correlations. Our method operationalizes any notion of structural overlap among hypergraphs as a principled normalized mutual information measure, allowing us to derive a hierarchy of increasingly granular formulations of similarity among hypergraphs within and across orders of interactions and at multiple scales. We validate these measures through extensive experiments on synthetic hypergraphs and apply the framework to reveal meaningful patterns in a variety of empirical higher-order networks. Our work provides foundational tools for the principled comparison of higher-order networks, shedding light on the structural organization of networked systems with nondyadic interactions.
- Open Access
- 23 February 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Belief propagation for finite networks using a symmetry-breaking source node
Belief propagation (BP) is an efficient message-passing algorithm widely used for inference in graphical models and for solving various problems in statistical physics. However, BP often yields inaccurate estimates of order parameters and their susceptibilities in finite systems, particularly in sparse networks with few loops. Here, we show for both percolation and Ising models that fixing the state of a single well-connected “source” node to break global symmetry substantially improves inference accuracy and captures finite-size effects across a broad range of networks, especially treelike ones, at no additional computational cost.
- 23 February 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessBelief propagation for finite networks using a symmetry-breaking source node
Belief propagation (BP) is an efficient message-passing algorithm widely used for inference in graphical models and for solving various problems in statistical physics. However, BP often yields inaccurate estimates of order parameters and their susceptibilities in finite systems, particularly in sparse networks with few loops. Here, we show for both percolation and Ising models that fixing the state of a single well-connected “source” node to break global symmetry substantially improves inference accuracy and captures finite-size effects across a broad range of networks, especially treelike ones, at no additional computational cost.
- Open Access
Structural reducibility of hypergraphs
Higher-order interactions provide a nuanced understanding of the relational structure of complex systems beyond traditional pairwise interactions. However, higher-order network analyses also incur more cumbersome interpretations and greater computational demands than their pairwise counterparts. Here we present an information-theoretic framework for determining the extent to which a hypergraph representation of a networked system is structurally redundant, and for identifying its most critical higher orders of interaction that allow us to remove these redundancies while preserving essential higher-order structure.
Open AccessStructural reducibility of hypergraphs
Higher-order interactions provide a nuanced understanding of the relational structure of complex systems beyond traditional pairwise interactions. However, higher-order network analyses also incur more cumbersome interpretations and greater computational demands than their pairwise counterparts. Here we present an information-theoretic framework for determining the extent to which a hypergraph representation of a networked system is structurally redundant, and for identifying its most critical higher orders of interaction that allow us to remove these redundancies while preserving essential higher-order structure.
- Open Access
- 20 December 2025
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Estimation of partial rankings from sparse, noisy comparisons
Ranking items from pairwise comparisons is common in domains ranging from sports to consumer preferences. Statistical inference-based methods, such as the Bradley–Terry model, have emerged as flexible and powerful tools to tackle ranking in empirical data. However, in situations with limited and/or noisy comparisons, it is often challenging to confidently distinguish item performance based on evidence available in the data. Most ranking methods nevertheless force a complete ordering, suggesting a meaningful distinction when there is none. Here, we introduce a principled nonparametric Bayesian framework for learning partial rankings—rankings with ties—that infers distinctions between items only when supported by the evidence. We develop a fast agglomerative algorithm for Maximum a Posteriori (MAP) inference under this framework and evaluate its performance on a range of synthetic and real-world datasets, finding that it often yields a more parsimonious and reliable summary of the data than traditional ranking approaches, particularly in sparse observational settings.
- 20 December 2025
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Open AccessEstimation of partial rankings from sparse, noisy comparisons
Ranking items from pairwise comparisons is common in domains ranging from sports to consumer preferences. Statistical inference-based methods, such as the Bradley–Terry model, have emerged as flexible and powerful tools to tackle ranking in empirical data. However, in situations with limited and/or noisy comparisons, it is often challenging to confidently distinguish item performance based on evidence available in the data. Most ranking methods nevertheless force a complete ordering, suggesting a meaningful distinction when there is none. Here, we introduce a principled nonparametric Bayesian framework for learning partial rankings—rankings with ties—that infers distinctions between items only when supported by the evidence. We develop a fast agglomerative algorithm for Maximum a Posteriori (MAP) inference under this framework and evaluate its performance on a range of synthetic and real-world datasets, finding that it often yields a more parsimonious and reliable summary of the data than traditional ranking approaches, particularly in sparse observational settings.
- 12 December 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (24) , 247401
Structural Reducibility of Hypergraphs
Higher-order interactions provide a nuanced understanding of the relational structure of complex systems beyond traditional pairwise interactions. However, higher-order network analyses also incur more cumbersome interpretations and greater computational demands than their pairwise counterparts. Here, we present an information-theoretic framework for determining the extent to which a hypergraph representation of a networked system is structurally redundant and for identifying its most critical higher orders of interaction that allow us to remove these redundancies while preserving essential higher-order structure.
- 12 December 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (24) , 247401
Structural Reducibility of Hypergraphs
Higher-order interactions provide a nuanced understanding of the relational structure of complex systems beyond traditional pairwise interactions. However, higher-order network analyses also incur more cumbersome interpretations and greater computational demands than their pairwise counterparts. Here, we present an information-theoretic framework for determining the extent to which a hypergraph representation of a networked system is structurally redundant and for identifying its most critical higher orders of interaction that allow us to remove these redundancies while preserving essential higher-order structure.
- 24 November 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (5) , L052304
Transfer entropy for finite data
Transfer entropy is a widely used measure for quantifying directed information flows in complex systems. While the challenges of estimating transfer entropy for continuous data are well known, it has two major shortcomings for data of finite cardinality: it exhibits a substantial positive bias for sparse bin counts, and it has no clear means to assess statistical significance. By computing information content in finite data streams without explicitly considering symbols as instances of random variables, we derive a transfer entropy measure which is asymptotically equivalent to the standard plug-in estimator but remedies these issues for time series of small size and/or high cardinality, permitting a fully nonparametric assessment of statistical significance without simulation.
- 24 November 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (5) , L052304
Transfer entropy for finite data
Transfer entropy is a widely used measure for quantifying directed information flows in complex systems. While the challenges of estimating transfer entropy for continuous data are well known, it has two major shortcomings for data of finite cardinality: it exhibits a substantial positive bias for sparse bin counts, and it has no clear means to assess statistical significance. By computing information content in finite data streams without explicitly considering symbols as instances of random variables, we derive a transfer entropy measure which is asymptotically equivalent to the standard plug-in estimator but remedies these issues for time series of small size and/or high cardinality, permitting a fully nonparametric assessment of statistical significance without simulation.
- Open Access
Information theory for hypergraph similarity
Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network comparison are limited to pairwise interactions only. Here we construct a general information theoretic framework for hypergraph similarity, capturing meaningful correspondence among higher-order interactions while correcting for spurious correlations. Our method operationalizes any notion of structural overlap among hypergraphs as a principled normalized mutual information measure, allowing us to derive a hierarchy of increasingly granular formulations of similarity among hypergraphs within and across orders of interactions, and at multiple scales. We validate these measures through extensive experiments on synthetic hypergraphs and apply the framework to reveal meaningful patterns in a variety of empirical higher-order networks. Our work provides foundational tools for the principled comparison of higher-order networks, shedding light on the structural organization of networked systems with non-dyadic interactions.
Open AccessInformation theory for hypergraph similarity
Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network comparison are limited to pairwise interactions only. Here we construct a general information theoretic framework for hypergraph similarity, capturing meaningful correspondence among higher-order interactions while correcting for spurious correlations. Our method operationalizes any notion of structural overlap among hypergraphs as a principled normalized mutual information measure, allowing us to derive a hierarchy of increasingly granular formulations of similarity among hypergraphs within and across orders of interactions, and at multiple scales. We validate these measures through extensive experiments on synthetic hypergraphs and apply the framework to reveal meaningful patterns in a variety of empirical higher-order networks. Our work provides foundational tools for the principled comparison of higher-order networks, shedding light on the structural organization of networked systems with non-dyadic interactions.
- Open Access
Belief propagation for finite networks using a symmetry-breaking source node
Belief Propagation (BP) is an efficient message-passing algorithm widely used for inference in graphical models and for solving various problems in statistical physics. However, BP often yields inaccurate estimates of order parameters and their susceptibilities in finite systems, particularly in sparse networks with few loops. Here, we show for both percolation and Ising models that fixing the state of a single well-connected "source" node to break global symmetry substantially improves inference accuracy and captures finite-size effects across a broad range of networks, especially tree-like ones, at no additional computational cost.
Open AccessBelief propagation for finite networks using a symmetry-breaking source node
Belief Propagation (BP) is an efficient message-passing algorithm widely used for inference in graphical models and for solving various problems in statistical physics. However, BP often yields inaccurate estimates of order parameters and their susceptibilities in finite systems, particularly in sparse networks with few loops. Here, we show for both percolation and Ising models that fixing the state of a single well-connected "source" node to break global symmetry substantially improves inference accuracy and captures finite-size effects across a broad range of networks, especially tree-like ones, at no additional computational cost.
- Open Access
- 23 July 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (111)
HINA: A Learning Analytics Tool for Heterogenous Interaction Network Analysis in Python
- 23 July 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (111)
Open AccessHINA: A Learning Analytics Tool for Heterogenous Interaction Network Analysis in Python
- Open Access
- 11 July 2025
- Published by American Physical Society (APS) in Physical Review X
- Vol. 15 (3)
Fast Nonparametric Inference of Network Backbones for Weighted Graph Sparsification
Network backbones provide useful sparse representations of weighted networks by keeping only their most important links, permitting a range of computational speedups and simplifying network visualizations. A key limitation of existing network backboning methods is that they either require the specification of a free parameter (e.g., significance level) that determines the number of edges to keep in the backbone or impose specific restrictions on the topology of the backbone (e.g., that it is a spanning tree). Here we develop a completely nonparametric framework for inferring the backbone of a weighted network that overcomes these limitations and automatically selects the optimal set of edges to retain using the minimum description length principle. We develop objective functions for global and local network backboning which evaluate the importance of an edge in the context of the whole network and individual node neighborhoods, respectively, and are generalizable to any weight distribution under Bayesian model specifications that fix the average edge weight either exactly or in expectation. We then construct an efficient and provably optimal greedy algorithm to identify the backbone minimizing our objectives, whose run-time complexity is log-linear in the number of edges. We demonstrate our methods by comparing them with existing methods in a range of tasks on real and synthetic networks, finding that both the global and local backboning methods can preserve network connectivity, weight heterogeneity, and spreading dynamics while removing a substantial fraction of edges.
- 11 July 2025
- Published by American Physical Society (APS) in Physical Review X
- Vol. 15 (3)
Open AccessFast Nonparametric Inference of Network Backbones for Weighted Graph Sparsification
Network backbones provide useful sparse representations of weighted networks by keeping only their most important links, permitting a range of computational speedups and simplifying network visualizations. A key limitation of existing network backboning methods is that they either require the specification of a free parameter (e.g., significance level) that determines the number of edges to keep in the backbone or impose specific restrictions on the topology of the backbone (e.g., that it is a spanning tree). Here we develop a completely nonparametric framework for inferring the backbone of a weighted network that overcomes these limitations and automatically selects the optimal set of edges to retain using the minimum description length principle. We develop objective functions for global and local network backboning which evaluate the importance of an edge in the context of the whole network and individual node neighborhoods, respectively, and are generalizable to any weight distribution under Bayesian model specifications that fix the average edge weight either exactly or in expectation. We then construct an efficient and provably optimal greedy algorithm to identify the backbone minimizing our objectives, whose run-time complexity is log-linear in the number of edges. We demonstrate our methods by comparing them with existing methods in a range of tasks on real and synthetic networks, finding that both the global and local backboning methods can preserve network connectivity, weight heterogeneity, and spreading dynamics while removing a substantial fraction of edges.