Dhagash Mehta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dhagash Mehta has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Jonathan D. Hauenstein
University of Notre Dame
9 shared publications - David J. Wales
University of Cambridge
5 shared publications Matthew Niemerg
4 shared publications- Daniel Kenneth Molzahn
Georgia Institute of Technology, Atlanta, GA, USA
3 shared publications - Tianran Chen
Department of Mathematics Michigan State University East Lansing MI USA
3 shared publications - Carlos M. Reyes
Universidad del Bio-Bio
2 shared publications
Latest Publications
- Open Access
- 7 September 2017
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 19 (37) , 25498-25508
Properties of kinetic transition networks for atomic clusters and glassy solids
A database of minima and transition states corresponds to a network where the minima represent nodes and the transition states correspond to edges between the pairs of minima they connect via steepest-descent paths. Here we construct networks for small clusters bound by the Morse potential for a selection of physically relevant parameters, in two and three dimensions. The properties of these unweighted and undirected networks are analysed to examine two features: whether they are small-world, where the shortest path between nodes involves only a small number or edges; and whether they are scale-free, having a degree distribution that follows a power law. Small-world character is present, but statistical tests show that a power law is not a good fit, so the networks are not scale-free. These results for clusters are compared with the corresponding properties for the molecular and atomic structural glass formers ortho-terphenyl and binary Lennard-Jones. These glassy systems do not show small-world properties, suggesting that such behaviour is linked to the structure-seeking landscapes of the Morse clusters.
- 7 September 2017
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 19 (37) , 25498-25508
Open AccessProperties of kinetic transition networks for atomic clusters and glassy solids
A database of minima and transition states corresponds to a network where the minima represent nodes and the transition states correspond to edges between the pairs of minima they connect via steepest-descent paths. Here we construct networks for small clusters bound by the Morse potential for a selection of physically relevant parameters, in two and three dimensions. The properties of these unweighted and undirected networks are analysed to examine two features: whether they are small-world, where the shortest path between nodes involves only a small number or edges; and whether they are scale-free, having a degree distribution that follows a power law. Small-world character is present, but statistical tests show that a power law is not a good fit, so the networks are not scale-free. These results for clusters are compared with the corresponding properties for the molecular and atomic structural glass formers ortho-terphenyl and binary Lennard-Jones. These glassy systems do not show small-world properties, suggesting that such behaviour is linked to the structure-seeking landscapes of the Morse clusters.
- Open Access
Properties of Kinetic Transition Networks for Atomic Clusters and Glassy Solids
A database of minima and transition states corresponds to a network where the minima represent nodes and the transition states correspond to edges between the pairs of minima they connect via steepest-descent paths. Here we construct networks for small clusters bound by the Morse potential for a selection of physically relevant parameters, in two and three dimensions. The properties of these unweighted and undirected networks are analysed to examine two features: whether they are small-world, where the shortest path between nodes involves only a small number or edges; and whether they are scale-free, having a degree distribution that follows a power law. Small-world character is present, but statistical tests show that a power law is not a good fit, so the networks are not scale-free. These results for clusters are compared with the corresponding properties for the molecular and atomic structural glass formers ortho-terphenyl and binary Lennard-Jones. These glassy systems do not show small-world properties, suggesting that such behaviour is linked to the structure-seeking landscapes of the Morse clusters.
Open AccessProperties of Kinetic Transition Networks for Atomic Clusters and Glassy Solids
A database of minima and transition states corresponds to a network where the minima represent nodes and the transition states correspond to edges between the pairs of minima they connect via steepest-descent paths. Here we construct networks for small clusters bound by the Morse potential for a selection of physically relevant parameters, in two and three dimensions. The properties of these unweighted and undirected networks are analysed to examine two features: whether they are small-world, where the shortest path between nodes involves only a small number or edges; and whether they are scale-free, having a degree distribution that follows a power law. Small-world character is present, but statistical tests show that a power law is not a good fit, so the networks are not scale-free. These results for clusters are compared with the corresponding properties for the molecular and atomic structural glass formers ortho-terphenyl and binary Lennard-Jones. These glassy systems do not show small-world properties, suggesting that such behaviour is linked to the structure-seeking landscapes of the Morse clusters.
- Open Access
- 6 July 2016
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 117 (2) , 028301
Kinetic Transition Networks for the Thomson Problem and Smale’s Seventh Problem
The Thomson problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here, we show that the energy landscape of the Thomson problem for particles with , 135, 138, 141, 144, 147, and 150 is single funneled, characteristic of a structure-seeking organization where the global minimum is easily accessible. Algorithmically, constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale’s 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analyzing the kinetic transition networks, we show that a randomly chosen minimum is, in fact, always “close” to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks.- 6 July 2016
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 117 (2) , 028301
Open AccessKinetic Transition Networks for the Thomson Problem and Smale’s Seventh Problem
The Thomson problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here, we show that the energy landscape of the Thomson problem for particles with , 135, 138, 141, 144, 147, and 150 is single funneled, characteristic of a structure-seeking organization where the global minimum is easily accessible. Algorithmically, constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale’s 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analyzing the kinetic transition networks, we show that a randomly chosen minimum is, in fact, always “close” to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks. - Open Access
Kinetic Transition Networks for the Thomson Problem and Smale's 7th Problem
The Thomson Problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here we show that the energy landscape of the Thomson Problem for $N$ particles with $N=132, 135, 138, 141, 144, 147$ and $150$ is single funnelled, characteristic of a structure-seeking organisation where the global minimum is easily accessible. Algorithmically constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale's 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analysing the kinetic transition networks, we show that a randomly chosen minimum is in fact always `close' to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks.Open AccessKinetic Transition Networks for the Thomson Problem and Smale's 7th Problem
The Thomson Problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here we show that the energy landscape of the Thomson Problem for $N$ particles with $N=132, 135, 138, 141, 144, 147$ and $150$ is single funnelled, characteristic of a structure-seeking organisation where the global minimum is easily accessible. Algorithmically constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale's 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analysing the kinetic transition networks, we show that a randomly chosen minimum is in fact always `close' to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks. - Open Access
Investigating the Maximum Number of Real Solutions to the Power Flow Equations: Analysis of Lossless Four-Bus Systems
The power flow equations model the steady-state relationship between the power injections and voltage phasors in an electric power system. By separating the real and imaginary components of the voltage phasors, the power flow equations can be formulated as a system of quadratic polynomials. Only the real solutions to these polynomial equations are physically meaningful. This paper focuses on the maximum number of real solutions to the power flow equations. An upper bound on the number of real power flow solutions commonly used in the literature is the maximum number of complex solutions. There exist two- and three-bus systems for which all complex solutions are real. It is an open question whether this is also the case for larger systems. This paper investigates four-bus systems using techniques from numerical algebraic geometry and conjectures a negative answer to this question. In particular, this paper studies lossless, four-bus systems composed of PV buses connected by lines with arbitrary susceptances. Computing the Galois group, which is degenerate, enables conversion of the problem of counting the number of real solutions to the power flow equations into counting the number of positive roots of a univariate sextic polynomial. From this analysis, it is conjectured that the system has at most 16 real solutions, which is strictly less than the maximum number of complex solutions, namely 20. We also provide explicit parameter values where this system has 16 real solutions so that the conjectured upper bound is achievable.
Open AccessInvestigating the Maximum Number of Real Solutions to the Power Flow Equations: Analysis of Lossless Four-Bus Systems
The power flow equations model the steady-state relationship between the power injections and voltage phasors in an electric power system. By separating the real and imaginary components of the voltage phasors, the power flow equations can be formulated as a system of quadratic polynomials. Only the real solutions to these polynomial equations are physically meaningful. This paper focuses on the maximum number of real solutions to the power flow equations. An upper bound on the number of real power flow solutions commonly used in the literature is the maximum number of complex solutions. There exist two- and three-bus systems for which all complex solutions are real. It is an open question whether this is also the case for larger systems. This paper investigates four-bus systems using techniques from numerical algebraic geometry and conjectures a negative answer to this question. In particular, this paper studies lossless, four-bus systems composed of PV buses connected by lines with arbitrary susceptances. Computing the Galois group, which is degenerate, enables conversion of the problem of counting the number of real solutions to the power flow equations into counting the number of positive roots of a univariate sextic polynomial. From this analysis, it is conjectured that the system has at most 16 real solutions, which is strictly less than the maximum number of complex solutions, namely 20. We also provide explicit parameter values where this system has 16 real solutions so that the conjectured upper bound is achievable.
- Open Access
Recent Advances in Computational Methods for the Power Flow Equations
The power flow equations are at the core of most of the computations for designing and operating electric power systems. The power flow equations are a system of multivariate nonlinear equations which relate the power injections and voltages in a power system. A plethora of methods have been devised to solve these equations, starting from Newton-based methods to homotopy continuation and other optimization-based methods. While many of these methods often efficiently find a high-voltage, stable solution due to its large basin of attraction, most of the methods struggle to find low-voltage solutions which play significant role in certain stability-related computations. While we do not claim to have exhausted the existing literature on all related methods, this tutorial paper introduces some of the recent advances in methods for solving power flow equations to the wider power systems community as well as bringing attention from the computational mathematics and optimization communities to the power systems problems. After briefly reviewing some of the traditional computational methods used to solve the power flow equations, we focus on three emerging methods: the numerical polynomial homotopy continuation method, Groebner basis techniques, and moment/sum-of-squares relaxations using semidefinite programming. In passing, we also emphasize the importance of an upper bound on the number of solutions of the power flow equations and review the current status of research in this direction.
Open AccessRecent Advances in Computational Methods for the Power Flow Equations
The power flow equations are at the core of most of the computations for designing and operating electric power systems. The power flow equations are a system of multivariate nonlinear equations which relate the power injections and voltages in a power system. A plethora of methods have been devised to solve these equations, starting from Newton-based methods to homotopy continuation and other optimization-based methods. While many of these methods often efficiently find a high-voltage, stable solution due to its large basin of attraction, most of the methods struggle to find low-voltage solutions which play significant role in certain stability-related computations. While we do not claim to have exhausted the existing literature on all related methods, this tutorial paper introduces some of the recent advances in methods for solving power flow equations to the wider power systems community as well as bringing attention from the computational mathematics and optimization communities to the power systems problems. After briefly reviewing some of the traditional computational methods used to solve the power flow equations, we focus on three emerging methods: the numerical polynomial homotopy continuation method, Groebner basis techniques, and moment/sum-of-squares relaxations using semidefinite programming. In passing, we also emphasize the importance of an upper bound on the number of solutions of the power flow equations and review the current status of research in this direction.
- Open Access
Toward Topologically Based Upper Bounds on the Number of Power Flow Solutions
The power flow equations, which relate power injections and voltage phasors, are at the heart of many electric power system computations. While Newton-based methods typically find the "high-voltage" solution to the power flow equations, which is of primary interest, there are potentially many "low-voltage" solutions that are useful for certain analyses. This paper addresses the number of solutions to the power flow equations. There exist upper bounds on the number of power flow solutions; however, there is only limited work regarding bounds that are functions of network topology. This paper empirically explores the relationship between the network topology, as characterized by the maximal cliques, and the number of power flow solutions. To facilitate this analysis, we use a numerical polynomial homotopy continuation approach that is guaranteed to find all complex solutions to the power flow equations. The number of solutions obtained from this approach upper bounds the number of real solutions. Testing with many small networks informs the development of upper bounds that are functions of the network topology. Initial results include empirically derived expressions for the maximum number of solutions for certain classes of network topologies.
Open AccessToward Topologically Based Upper Bounds on the Number of Power Flow Solutions
The power flow equations, which relate power injections and voltage phasors, are at the heart of many electric power system computations. While Newton-based methods typically find the "high-voltage" solution to the power flow equations, which is of primary interest, there are potentially many "low-voltage" solutions that are useful for certain analyses. This paper addresses the number of solutions to the power flow equations. There exist upper bounds on the number of power flow solutions; however, there is only limited work regarding bounds that are functions of network topology. This paper empirically explores the relationship between the network topology, as characterized by the maximal cliques, and the number of power flow solutions. To facilitate this analysis, we use a numerical polynomial homotopy continuation approach that is guaranteed to find all complex solutions to the power flow equations. The number of solutions obtained from this approach upper bounds the number of real solutions. Testing with many small networks informs the development of upper bounds that are functions of the network topology. Initial results include empirically derived expressions for the maximum number of solutions for certain classes of network topologies.
- Open Access
Stability and symmetry breaking in a three Higgs-boson doublet model with lepton family symmetry O(2)xZ2
Motivated by the neutrino data, an extension of the Standard Model with three Higgs-boson doublets has been proposed. Imposing an O(2) x Z2 family symmetry, a neutrino mixing matrix with theta23 = pi/4 and theta13 = 0 appears in a natural way. Even though these values for the mixing matrix do not follow the recent experimental constraints, they are nevertheless a good approximation. We study the Higgs potential of this model in detail. We apply recent methods which allow for the study of any three-Higgs-boson doublet model. It turns out that for a variety of parameters the potential is stable, has the correct electroweak symmetry breaking, and gives the correct vacuum expectation value.
Open AccessStability and symmetry breaking in a three Higgs-boson doublet model with lepton family symmetry O(2)xZ2
Motivated by the neutrino data, an extension of the Standard Model with three Higgs-boson doublets has been proposed. Imposing an O(2) x Z2 family symmetry, a neutrino mixing matrix with theta23 = pi/4 and theta13 = 0 appears in a natural way. Even though these values for the mixing matrix do not follow the recent experimental constraints, they are nevertheless a good approximation. We study the Higgs potential of this model in detail. We apply recent methods which allow for the study of any three-Higgs-boson doublet model. It turns out that for a variety of parameters the potential is stable, has the correct electroweak symmetry breaking, and gives the correct vacuum expectation value.
- Open Access
- 27 August 2015
- Published by American Physical Society (APS) in Physical Review D
- Vol. 92 (3) , 035017
Stability and symmetry breaking in a three-Higgs-doublet model with lepton family symmetryMotivated by the neutrino data, an extension of the Standard Model with three Higgs-boson doublets has been proposed. Imposing an family symmetry, a neutrino mixing matrix with and appears in a natural way. Even though these values for the mixing matrix do not follow the recent experimental constraints, they are nevertheless a good approximation. We study the Higgs potential of this model in detail. We apply recent methods which allow for the study of any three-Higgs-boson doublet model. It turns out that for a variety of parameters the potential is stable, has the correct electroweak symmetry breaking, and gives the correct vacuum expectation value.- 27 August 2015
- Published by American Physical Society (APS) in Physical Review D
- Vol. 92 (3) , 035017
Open AccessStability and symmetry breaking in a three-Higgs-doublet model with lepton family symmetryMotivated by the neutrino data, an extension of the Standard Model with three Higgs-boson doublets has been proposed. Imposing an family symmetry, a neutrino mixing matrix with and appears in a natural way. Even though these values for the mixing matrix do not follow the recent experimental constraints, they are nevertheless a good approximation. We study the Higgs potential of this model in detail. We apply recent methods which allow for the study of any three-Higgs-boson doublet model. It turns out that for a variety of parameters the potential is stable, has the correct electroweak symmetry breaking, and gives the correct vacuum expectation value. - Open Access
An index-resolved fixed-point homotopy and potential energy landscapes
Stationary points (SPs) of the potential energy landscapes can be classified by their Morse index, i.e., the number of negative eigenvalues of the Hessian evaluated at the SPs. In understanding chemical clusters through their potential energy landscapes, only SPs of a particular Morse index are needed. We propose a modification of the "fixed-point homotopy" method which can be used to directly target stationary points of a specified Morse index. We demonstrate the effectiveness of our approach by applying it to the Lennard-Jones clusters.
Open AccessAn index-resolved fixed-point homotopy and potential energy landscapes
Stationary points (SPs) of the potential energy landscapes can be classified by their Morse index, i.e., the number of negative eigenvalues of the Hessian evaluated at the SPs. In understanding chemical clusters through their potential energy landscapes, only SPs of a particular Morse index are needed. We propose a modification of the "fixed-point homotopy" method which can be used to directly target stationary points of a specified Morse index. We demonstrate the effectiveness of our approach by applying it to the Lennard-Jones clusters.