Gajendra Pratap Singh
Research, Teaching and Hostel Wardenship
Jawaharlal Nehru University (JNU), New Delhi
Born and brought up in Village-Tirpura (Chandpur), Bijnor, UP, India. Gajendra Pratap Singh did his Masters in Mathematics with Computer Science at Jamia Millia Islamia, New Delhi and PhD in Petri nets and Graph theory at the Department of Applied Mathematics, Delhi College of Engineering (Faculty of Technology), University of Delhi, India. Dr. Singh proposed a new theory on 1-safe Petri nets named as `Boolean Petri Nets’ and published more than 22 research papers and book chapters in various International Journal of repute. Currently, Gajendra’s group is working on network theory, applications, software development for advancement of machine learning, biological network e.g. heart-diseases, tuberculosis, biopolymer production in microbes etc.
Right now in his lab three PhD students are working on binary tree characterizations, Mtb mechanisms and pathways in tuberculosis, biopolymer (e.g. PHA) production in microbes, metabolic path-comparison and cardiovascular dysfunction. One postdoc fellow (National Board of Higher Mathematics Fellow) has completed her research work on Number theory. One Master student is working on Analytic Hierachy Process (AHP). During the last three years, two of Gajendra’s students from M.Tech completed their dissertation in Biological Networks applications.
Gajendra’s hobbies are photography and reading mathematics books especially on graph theory. He is committed on his duties and has keen interest to participate in extra-activities.
Projects within the Big Data Project
- Using Graph Theory to analyse Protein-Protein Interaction Network in R Programming
- A Graph Theoretic Analysis on Functional EEG Network in Igraph R
- Project Selection Systems using AHP
- Vendor Selection System using AHP
- Some Advances in the Theory of Boolean Petri nets (UPOE-II, id. 257)
- Mathematical modelling of multi drug resistance mechanism in tuberculosis using Petri Nets, Science and Engineering Research Board, DST, Govt. of India, ongoing.
Applicant for RTG big data research PhD student: Sujit Kumar Singh
Students within the Big Data Project
Sujit Kumar Singh (PhD student) (application in progress)
Research interests of relevance to the project
- To develop Graph theory techniques and software applicable to big data, biological networks and interdisciplinary areas of science.
- Applied Petri nets and Graph theory modelling to in various fields’ analysis including biological pathways.
- Data analytics, modelling and simulation
- Computational statistical tools and techniques.
- Algorithms and software development
- Modelling of cardiovascular dysfunction
- Graph theory matrices and operations
- Mathematical modelling and analysis
- Modelling of Ayurveda drug discovery
Field of Expertise
- Graph Theory
- Petri Nets
- Analytical Hierarchy Process
- Mathematical Biology
- Network Optimization Techniques
- Gajendra Pratap Singh and Agraj Gupta. (2019). A Petri Net Analysis to study the effects of Diabetes on Cardiovascular Diseases, IEEE Xplore.
- Vipin Chandra Kalia, Subhasree Ray, Sanjay K. S. Patel, Mamtesh Singh, and Gajendra Pratap Singh. (2019), Applications of Polyhydroxyalkanoates and Their Metabolites as Drug Carriers, In : Biotechnological Applications of Polyhydroxyalkanoates, Springer Nature Singapur, ISBN 978-981-13-3758-1.
- Sangeet Chaudhary, Gajendra Pratap Singh (2018), On Interrelationships Between q-Product Identities and Combinatorial Partition Identities , J. Calcutta Math. Soc.,14(1), 47-54.
- Singh, Gajendra Pratap. (2016). Applications of Petri nets in electrical, electronics and optimizations. International Conference on Electrical, Electronics, and Optimization Techniques. IEEE Xplore, 978-1-4673-9939-5.
- Sangita Kansal, Gajendra Pratap Singh and Mukti Acharya. (2015). On the problem of characterizing Boolean Petri nets. International Journal of Computer Applications 975: 8887.
- Sangita Kansal, Gajendra Pratap Singh and Mukti Acharya. (2011). 1-Safe Petri nets generating every binary n-vector exactly once. Scientiae Mathematicae Japonicae 74.1: 29-36.
- Sangita Kansal, Gajendra Pratap Singh and Mukti Acharya. (2011). A Disconnected 1-Safe Petri Net Whose Reachability Tree Is Homomorphic to a Complete Boolean Lattice. International Conference on Process Automation, Control and Computing. IEEE, 978-1-61284-764-1.
- Sangita Kansal, Gajendra Pratap Singh and Mukti Acharya. (2010). “On Petri nets generating all the binary n-vectors.” Scientiae Mathematicae Japonicae 71.2: 209-216.
- Gajendra Pratap Singh, Sujit Kumar Singh (2019), On Petri net generating Infinite Perfect Binary Tree, communicated.
- Gajendra Pratap Singh, Madhuri Jha (2019), Petri-net modeling of B-cell receptor signaling pathways: A case study in CLL, communicated.
- Sakshi Gupta, Gajendra Pratap Singh (2019), Sunita Kumawat, Modelling of Metabolic Pathway of Polyhydroxyalkanoates using Petri Net Based Apprach, Communicated.
- Sakshi Gupta, Gajendra Pratap Singh (2019), Sunita Kumawat, Property Verification of Boolean Petri Nets using Fuzzy Petri Nets: A Propositional Approach, communicated.
Complete list of publications
Room no.-33, School of Computational and Integrative Sciences
Jawaharlal Nehru University