Publications
Models for Random graphs:
Preprint:
- Daudin, J.-J. and Pierre, L. Ideal-type model for random networks, SSB Research Report n°22
- Latouche, P., Birmelé, E. and Ambroise, C. Bayesian methods for graph clustering, SSB Research Report n°17
- Zanghi, H., Picard, F., Miele, V. and Ambroise, C. Strategies for online inference of network mixture, SSB Research Report n°14
Published:
- Vernoux, T, Brunoud, G, Farcot, E, Morin, V, Van den Daele, H, Legrand, J, Oliva, M, Das, P, Larrieu, A, Wells, D, Guédon, Y, Armitage, L, Picard, F, Guyomarc'h, S, Cellier, C, Parry, G, Koumproglou, R, Doonan, JH, Estelle, M, Godin, C, Kepinski, S, Bennett, M, De Veylder, L, Traas, J (2011). The auxin signalling network translates dynamic input into robust patterning at the shoot apex. Mol. Syst. Biol. 7:508.
- Chiquet, J., Grandvalet, Y. and Ambroise, C. (2010) Inferring multiple graphical structures, Statistics and Computing: in press. [http]
- Mariadassou, M Robin, S. Vacher, C. (2010), Uncovering latent structure in valued graphs : A variational approach, Annals of Applied statistics, to appear
- Daudin, J. J., Pierre, L., Vacher, C. (2010). Model for Heterogeneous Random Networks Using Continuous Latent Variables and an Application to a Tree–Fungus Network. Biometrics, Early View
- Charbonnier, C. Chiquet, J. and Ambroise, C. (2010) Weighted-LASSO for Structured Network Inference from Time Course Data, Statistical Applications in Genetics and Molecular Biology: Vol. 9 : Iss. 1, Article 15. [http]
- Picard, F., Miele, V., Cottret, L., Daudin, J.-J. and Robin, S. (2009). Deciphering the connectivity structure of biological networks using MixNet. BMC Bioinformatics
- Ambroise, C. and Chiquet, J. and Matias, C. (2009). Inferring sparse Gaussian graphical models with latent structure. Electronic Journal of Statistics. 3 205-238. [http]
- Chiquet, J., Smith, A., Grasseau, G., Matias, C. and Ambroise, C. (2009). SIMoNe: Statistical Inference for MOdular NEtworks. Bioinformatics. 25 417--418. [DOI]
- Zanghi, H., Ambroise, C. and Miele, V. (2008). Fast online graph clustering via erdös-rényi mixture. Pattern Recognition. 3592-3599.
- Picard, F., Daudin, J.-J. and Robin, S. (2008). A mixture model for random graphs. Stat. Comput. 173-183.
Network motifs:
Preprint:
Published:
- Schbath, S., Lacroix, V. and Sagot, M.-F. (2009). Assessing the exceptionality of coloured motifs in networks. EURASIP Journal on Bioinformatics and Systems Biology. [DOI]
- Picard, F., Daudin, J.-J., Koskas, M., Schbath, S. and Robin, S. (2008). Assessing the exceptionality of network motifs. J. Comp. Biol. 15:1 1-20. [ http ]
- Matias, C., Schbath, S., Birmelé, E., Daudin, J.-J. and Robin, S. (2006). Network motifs: mean and variance for the count. REVSTAT. 4 31-51.