Abstract: Spectral graph theory is the study of the eigenvalues and eigenvectors of matrices associated with graphs. In this tutorial, we will try to provide some intuition as to why these ...

ABSTRACT: An algorithm is being developed to conduct a computational experiment to study the dynamics of random processes in an asymmetric Markov chain with eight discrete states and continuous time.

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure ...

Abstract: Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ...

Over the last few decades, enhanced sampling methods have been continuously improved. Here, we exploit this progress and propose a modular workflow for blind reaction discovery and determination of ...

ABSTRACT: In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph for some families of special graph G, where is the jth power of graph G.

The talk focuses on expander graphs in conjunction with the combined use of SDPs and eigenvalue techniques for approximating optimal solutions to combinatorial optimization problems. In the first part ...