Emily Reed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Emily Reed has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Guilherme Ramos
Department of Computer Science and Engineering, Instituto Superior Tcnico, University of Lisbon, Lisbon, Portugal
3 shared publications Guilherme Ramos
Department of Computer Science and Engineering, Instituto Superior Técnico, University of Lisbon and Instituto de Telecomunicações, Lisbon, Portugal
2 shared publications- Paul Bogdan
Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, USA
2 shared publications - Sergio Pequito
Department of Electrical and Computer Engineering, Instituto Superior Tcnico, University of Lisbon, Lisbon, Portugal
2 shared publications Arian Ashourvan
Department of Psychology, University of Kansas, Lawrence, KS, USA
1 shared publication- Md Abu Noman Kausar
Texas Tech University,Department of Electrical and Computer Engineering,Lubbock,TX,USA,79409
1 shared publication
Latest Publications
- Open Access
- 25 May 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Stabilizing fractional dynamical networks suppresses epileptic seizures
Medically uncontrolled epileptic seizures affect nearly 15 million people worldwide, resulting in enormous economic and psychological burdens. Treatment of medically refractory epilepsy is essential for patients to achieve remission, improve psychological functioning, and enhance social and vocational outcomes. Here, we show a state-of-the-art method that stabilizes fractional dynamical networks modeled from intracranial EEG data, effectively suppressing seizure activity in 34 out of 35 total spontaneous episodes from patients at the University of Pennsylvania and the Mayo Clinic. We perform a multi-scale analysis and show that the fractal behavior and stability properties of these data distinguish between four epileptic states: interictal, pre-ictal, ictal, and post-ictal. Furthermore, the simulated controlled signals exhibit substantial amplitude reduction (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} $$49\%$$ average). These findings highlight the potential of fractional dynamics to characterize seizure-related brain states and demonstrate its capability to suppress epileptic activity.- 25 May 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessStabilizing fractional dynamical networks suppresses epileptic seizures
Medically uncontrolled epileptic seizures affect nearly 15 million people worldwide, resulting in enormous economic and psychological burdens. Treatment of medically refractory epilepsy is essential for patients to achieve remission, improve psychological functioning, and enhance social and vocational outcomes. Here, we show a state-of-the-art method that stabilizes fractional dynamical networks modeled from intracranial EEG data, effectively suppressing seizure activity in 34 out of 35 total spontaneous episodes from patients at the University of Pennsylvania and the Mayo Clinic. We perform a multi-scale analysis and show that the fractal behavior and stability properties of these data distinguish between four epileptic states: interictal, pre-ictal, ictal, and post-ictal. Furthermore, the simulated controlled signals exhibit substantial amplitude reduction (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} $$49\%$$ average). These findings highlight the potential of fractional dynamics to characterize seizure-related brain states and demonstrate its capability to suppress epileptic activity. - Open Access
- 25 March 2026
- Published by Elsevier in European Journal of Control
- Vol. 89
Statistical resilience: A parameter-free approach to ethical consensus
- 25 March 2026
- Published by Elsevier in European Journal of Control
- Vol. 89
Open AccessStatistical resilience: A parameter-free approach to ethical consensus
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1323-1328
Self-Similar Biomarker for Identifying Epileptogenic Zone in Patients with Medically Refractory Epilepsy
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1323-1328
Self-Similar Biomarker for Identifying Epileptogenic Zone in Patients with Medically Refractory Epilepsy
- Open Access
- 9 November 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-13
The role of long-term power-law memory in controlling large-scale dynamical networks
Controlling large-scale dynamical networks is crucial to understand and, ultimately, craft the evolution of complex behavior. While broadly speaking we understand how to control Markov dynamical networks, where the current state is only a function of its previous state, we lack a general understanding of how to control dynamical networks whose current state depends on states in the distant past (i.e. long-term memory). Therefore, we require a different way to analyze and control the more prevalent long-term memory dynamical networks. Herein, we propose a new approach to control dynamical networks exhibiting long-term power-law memory dependencies. Our newly proposed method enables us to find the minimum number of driven nodes (i.e. the state vertices in the network that are connected to one and only one input) and their placement to control a long-term power-law memory dynamical network given a specific time-horizon, which we define as the ‘time-to-control’. Remarkably, we provide evidence that long-term power-law memory dynamical networks require considerably fewer driven nodes to steer the network’s state to a desired goal for any given time-to-control as compared with Markov dynamical networks. Finally, our method can be used as a tool to determine the existence of long-term memory dynamics in networks.
- 9 November 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-13
Open AccessThe role of long-term power-law memory in controlling large-scale dynamical networks
Controlling large-scale dynamical networks is crucial to understand and, ultimately, craft the evolution of complex behavior. While broadly speaking we understand how to control Markov dynamical networks, where the current state is only a function of its previous state, we lack a general understanding of how to control dynamical networks whose current state depends on states in the distant past (i.e. long-term memory). Therefore, we require a different way to analyze and control the more prevalent long-term memory dynamical networks. Herein, we propose a new approach to control dynamical networks exhibiting long-term power-law memory dependencies. Our newly proposed method enables us to find the minimum number of driven nodes (i.e. the state vertices in the network that are connected to one and only one input) and their placement to control a long-term power-law memory dynamical network given a specific time-horizon, which we define as the ‘time-to-control’. Remarkably, we provide evidence that long-term power-law memory dynamical networks require considerably fewer driven nodes to steer the network’s state to a desired goal for any given time-to-control as compared with Markov dynamical networks. Finally, our method can be used as a tool to determine the existence of long-term memory dynamics in networks.
- 27 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (5) , 3099-3106
A Scalable Distributed Dynamical Systems Approach to Learn the Strongly Connected Components and Diameter of Networks
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role in a variety of discrete optimization problems, and subsequently, machine learning and control theory problems. On the one hand, SCCs are used in solving the 2-satisfiability problem, which has applications in clustering, scheduling, and visualization. On the other hand, the diameter has applications in network learning and discovery problems enabling efficient internet routing and searches, as well as identifying faults in the power grid. In this paper, we leverage consensus-based principles to find the SCCs in a scalable and distributed fashion with a computational complexity of $\mathcal {O}(Dd_{\rm{in-degree}}^{\max })$ , where $D$ is the (finite) diameter of the network and $d_{\rm{in-degree}}^{\max }$ is the maximum in-degree of the network. Additionally, we prove that our algorithm terminates in $D+1$ iterations, which allows us to retrieve the diameter of the network. We illustrate the performance of our algorithm on several random networks, including Erdö-Rényi, Barabási-Albert, and Watts-Strogatz networks.
- 27 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (5) , 3099-3106
A Scalable Distributed Dynamical Systems Approach to Learn the Strongly Connected Components and Diameter of Networks
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role in a variety of discrete optimization problems, and subsequently, machine learning and control theory problems. On the one hand, SCCs are used in solving the 2-satisfiability problem, which has applications in clustering, scheduling, and visualization. On the other hand, the diameter has applications in network learning and discovery problems enabling efficient internet routing and searches, as well as identifying faults in the power grid. In this paper, we leverage consensus-based principles to find the SCCs in a scalable and distributed fashion with a computational complexity of $\mathcal {O}(Dd_{\rm{in-degree}}^{\max })$ , where $D$ is the (finite) diameter of the network and $d_{\rm{in-degree}}^{\max }$ is the maximum in-degree of the network. Additionally, we prove that our algorithm terminates in $D+1$ iterations, which allows us to retrieve the diameter of the network. We illustrate the performance of our algorithm on several random networks, including Erdö-Rényi, Barabási-Albert, and Watts-Strogatz networks.
- 6 July 2022
- Published by Elsevier in Annual Reviews in Control
- Vol. 54, 386-408
Fractional cyber-neural systems — A brief survey
- 6 July 2022
- Published by Elsevier in Annual Reviews in Control
- Vol. 54, 386-408
Fractional cyber-neural systems — A brief survey