Upload new images. The image library for this site will open in a new window.
Upload new documents. The document library for this site will open in a new window.
Show web part zones on the page. Web parts can be added to display dynamic content such as calendars or photo galleries.
Choose between different arrangements of page sections. Page layouts can be changed even after content has been added.
Move this whole section down, swapping places with the section below it.
Check for and fix problems in the body text. Text pasted in from other sources may contain malformed HTML which the code cleaner will remove.
Accordion feature turned off, click to turn on.
Accordion featurd turned on, click to turn off.
Change the way the image is cropped for this page layout.
Cycle through size options for this image or video.
Align the media panel to the right/left in this section.
Open the image pane in this body section. Click in the image pane to select an image from the image library.
Open the video pane in this body section. Click in the video pane to embed a video. Click ? for step-by-step instructions.
Remove the image from the media panel. This does not delete the image from the library.
Remove the video from the media panel.
At the 2017 meeting of the International Linear Algebra Society, Prof. Mahya Ghandehari was designated as a Linear Algebra and Applications (LAA) early career speaker. This honor is given to "linear algebra's emerging leaders" and carries with it the opportunity to address the conference. ILAS2017 was held at Iowa State University and featured an impressive 25 mini-symposia, 10 plenary speakers, and 6 LAA early career speakers.
Prof. Ghandehari spoke on "Geometric graphs and uniform embeddings" and her abstract reveals something of the exciting world of modern linear algebra:
Abstract. Many real-life networks can be modelled by stochastic processes with a spatial embedding. The spatial reality can be used to represent attributes of the vertices which are inaccessible or unknown, but which are assumed to inform link formation. For example, in a social network, vertices may be considered as members of a social space, where the coordinates represent the interests and background of the users. The graph formation is modelled as a stochastic process, where the probability of a link occurring between two vertices decreases as their metric distance increases. A fundamental question is to determine whether a given network is compatible with a spatial model. That is, given a graph how can we judge whether the graph is likely generated by a spatial model, and if so whether the model is uniform in nature? Using the theory of graph limits, we show how to recognize graph sequences produced by random graph processes with a linear embedding (a natural embedding into real line). We then discuss whether a linear embedding is uniform in nature, that is whether it is possible to "transform" the linear embedding into one in which the probability of a link between two vertices depends only on the distance between them. We give necessary and sufficient conditions for the existence of a uniform linear embedding for random graphs with finite number of probability values. Our findings show that for a general linear embedding the answer is negative in most cases. This talk is based on joint articles with H. Chuangpishit, M. Hurshman, J. Janssen, and N. Kalyaniwalia.
The department congratulates Prof. Ghandehari on this honor.
Move this whole section up, swapping places with the section above it.