Mathematical Thinking for Quantifying Connectedness:

#Artificial #Intelligence #Mathematical #thinking #Connected #systems
Share

Professor Suresh C. Kothari will speak on Monday, Nov-2, 7pm.  This meeting will be a joint meeting with the IEEE Student Branch.  The date and time is updated from previous announcements.


The talk is about mathematical thinking for appropriate quantification. Temperature is one such quantification. This talk tells a story of an appropriate quantification for connectedness.

Imagine the problem of quantifying connectedness of an entity given a set of entities and connections between some pairs of entities. Systems such as computer networks, power grids, economic networks, software systems, and Facebook as a social system of connected people all rely on some way of quantifying connectedness. Google's patented page rank algorithm is for a quantification of connectedness. 

We will discuss the mathematical thinking for quantifying connectedness from the work by Perron and Frobenius – work done about a hundred years before the Page Rank patent. In textbooks, Perron-Frobenius mathematical thinking is buried in a pile of definitions and symbols making it difficult to grasp. We will expose it in a form that high school students can understand and apply. We will point to the way that mathematical thinking leads to create a simple and far more efficient algorithm than the Google's patented algorithm. 



  Date and Time

  Location

  Hosts

  Registration



  • Add_To_Calendar_icon Add Event to Calendar
  • Iowa State University
  • 613 Morrill Road
  • Ames, Iowa
  • United States 50011
  • Building: Durham Center
  • Room Number: 0171
  • Click here for Map

  • Contact Event Hosts
  • Starts 08 October 2026 06:00 PM UTC
  • Ends 02 November 2026 11:00 PM UTC
  • No Admission Charge


  Speakers

Suresh Kothari of Iowa State University

Topic:

Mathematical Thinking for Quantifying Connectedness

The talk is about mathematical thinking for appropriate quantification. Temperature is one such quantification. This talk tells a story of an appropriate quantification for connectedness.

Imagine the problem of quantifying connectedness of an entity given a set of entities and connections between some pairs of entities. Systems such as computer networks, power grids, economic networks, software systems, and Facebook as a social system of connected people all rely on some way of quantifying connectedness. Google's patented page rank algorithm is for a quantification of connectedness. 

We will discuss the mathematical thinking for quantifying connectedness from the work by Perron and Frobenius – work done about a hundred years before the Page Rank patent. In textbooks, Perron-Frobenius mathematical thinking is buried in a pile of definitions and symbols making it difficult to grasp. We will expose it in a form that high school students can understand and apply. We will point to the way that mathematical thinking leads to create a simple and far more efficient algorithm than the Google's patented algorithm. 

Biography:

Suresh Kothari is a professor in the Electrical and Computer Engineering Department. Kothari received his Ph.D. from Purdue University working with renowned mathematicians - Professor Abhyankar (Advisor) and Professor Hironaka (Field Medal winner). He co-founded ENSOFT in 2002. ENSOFT’s products are used by over 450 companies world-wide including all major automobile and aerospace companies as well as companies in construction engineering, energy production, media, consumer electronics, finance, and medical devices. Dr. Kothari served as a Principal Investigator for the Defense Advanced Research Projects Agency (DARPA) APAC and STAC cybersecurity programs. He led the effort to start the undergraduate software engineering program at ISU and served as its Founding Head from 2007 to 2011. He has served as a Distinguished ACM Lecturer. He held the Richardson Endowed Professorship in the Electrical and Computer Engineering at Iowa State University (ISU). He received the ISU Board of Regents Professor Award for excellence in research, teaching, and service to the university.

Linkedin:  http://www.linkedin.com/in/surajkothari 

Email:

Address:Iowa State University, Electrical and Computer Engineering, Coover Hall, Ames, Iowa, United States, 50011

Suresh Kothari of Iowa State University

Topic:

Mathematical Thinking for Quantifying Connectedness:

The talk is about mathematical thinking for appropriate quantification. Temperature is one such quantification. This talk tells a story of an appropriate quantification for connectedness.

Imagine the problem of quantifying connectedness of an entity given a set of entities and connections between some pairs of entities. Systems such as computer networks, power grids, economic networks, software systems, and Facebook as a social system of connected people all rely on some way of quantifying connectedness. Google's patented page rank algorithm is for a quantification of connectedness. 

We will discuss the mathematical thinking for quantifying connectedness from the work by Perron and Frobenius – work done about a hundred years before the Page Rank patent. In textbooks, Perron-Frobenius mathematical thinking is buried in a pile of definitions and symbols making it difficult to grasp. We will expose it in a form that high school students can understand and apply. We will point to the way that mathematical thinking leads to create a simple and far more efficient algorithm than Google's patented algorithm.

Biography:

Suresh Kothari is a professor in the Electrical and Computer Engineering Department. Kothari received his Ph.D. from Purdue University working with renowned mathematicians - Professor Abhyankar (Advisor) and Professor Hironaka (Field Medal winner). He co-founded ENSOFT in 2002. ENSOFT’s products are used by over 450 companies world-wide including all major automobile and aerospace companies as well as companies in construction engineering, energy production, media, consumer electronics, finance, and medical devices. Dr. Kothari served as a Principal Investigator for the Defense Advanced Research Projects Agency (DARPA) APAC and STAC cybersecurity programs. He led the effort to start the undergraduate software engineering program at ISU and served as its Founding Head from 2007 to 2011. He has served as a Distinguished ACM Lecturer. He held the Richardson Endowed Professorship in the Electrical and Computer Engineering at Iowa State University (ISU). He received the ISU Board of Regents Professor Award for excellence in research, teaching, and service to the University.

Email:

Address:Iowa State University, Electrical and Computer Engineering, Coover Hall, Ames, Iowa, United States, 50011






Agenda

7:00 PM – Pizza provided by the Student Branch

7:10 PM – Presentation



Registration for this meeting is not required but requested so the Student Branch can order adequate pizza.