Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
en:projects:mth:masterlthi8 [2014/11/25 16:37] leveque created |
en:projects:mth:masterlthi8 [2014/11/25 16:39] (current) leveque |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | Stochastic Processes on Graphs | + | **Stochastic Processes on Graphs**\\ |
| - | ============================== | + | |
| In this project, we study how stochastic processes behave on graph. The main idea is to generate many random signals and to filter them (thanks to spectral graph theory). The output of this operation tells a lot about the graph itself. First, it gives local regularity information: is some node more connected to the other? Or isolated? Second, thanks to this technique, we can compute the density of the Laplacian’s eigenvalues of the graphs. This allows a graph classification for instance. Third, we can even perform this classification for a specific node. Finally, the algorithm used in this project scales to very large graphs. We should be able to analyze a big instance of a social network. | In this project, we study how stochastic processes behave on graph. The main idea is to generate many random signals and to filter them (thanks to spectral graph theory). The output of this operation tells a lot about the graph itself. First, it gives local regularity information: is some node more connected to the other? Or isolated? Second, thanks to this technique, we can compute the density of the Laplacian’s eigenvalues of the graphs. This allows a graph classification for instance. Third, we can even perform this classification for a specific node. Finally, the algorithm used in this project scales to very large graphs. We should be able to analyze a big instance of a social network. | ||
| - | The project is separated into 2 different parts: | + | The project is separated into two different parts: |
| Study of the graph topology thanks to random signals | Study of the graph topology thanks to random signals | ||
| Line 14: | Line 13: | ||
| Estimation of the spectrum density | Estimation of the spectrum density | ||
| Application to very big graphs! | Application to very big graphs! | ||
| - | Analysis of local graph features (Is a graph locally like a specific graph? Analyze of the ||T_i g || curve instead of the ||g|| curve) | + | Analysis of local graph features |
| + | - Is a graph locally like a specific graph? | ||
| + | - Analysis of the ||T_i g || curve instead of the ||g|| curve | ||
| What are you going to learn: Spectral graph theory, Stochastic processes, being stuck, write demonstrations | What are you going to learn: Spectral graph theory, Stochastic processes, being stuck, write demonstrations | ||