Kévin Perrot



Location:
Luminy - Library - 2nd floor
Office A201
(map)

LIF
Parc Sci & Tech de Luminy
163, avenue de Luminy - Case 901
F-13288 Marseille Cedex 9
France

Phone:
+33(0)4 86 09 04 97
Since 2014,
I am member of the Natural Computation research group, LIF Laboratory (UMR CNRS 7279).

Computing and Philosophy reading group.

Neurogeeks reading group.

Sandpile models, a kind of non-linear discrete dynamical system exhibiting non-trivial emergent structures, from a simple evolution rule... quite surprising.
[NP17] Viet-Ha Nguyen and Kévin Perrot. Any shape can ultimately cross information on two-dimensional abelian sandpile models. available on arxiv:1709.00464, 2017. [ bib | arXiv ]
[FPR17] Enrico Formenti, Kévin Perrot, and Eric Rémila. Computational complexity of the avalanche problem for one dimensional decreasing sandpiles. to appear in Journal of Cellular Automata, 2017. [ bib ]
[PR17] Kévin Perrot and Eric Rémila. Strong emergence of wave patterns on Kadanoff sandpiles. Electronic Journal of Combinatorics, 24(2), 2017. freely available at http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p4. [ bib ]
[PR15a] Kévin Perrot and Éric Rémila. Emergence on decreasing sandpile models. In Proceedings of MFCS'2015, volume 9234 of LNCS, pages 419--431, 2015. [ bib ]
[PR15b] Kévin Perrot and Éric Rémila. Piles de sable décroissantes 1D : classification expérimentale d'émergences. Technique et Science Informatiques -- Automates cellulaires et réseaux d'automates : le rôle central de l'irrégularité, 2015. [ bib ]
[PR14a] Kévin Perrot and Éric Rémila. Emergence of regularities on decreasing sandpile models. 15th Mons Theoretical Computer Science Days, Nancy, France, 2014. [ bib ]
[FPR14] Enrico Formenti, Kévin Perrot, and Eric Rémila. Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles. In Proceedings of AUTOMATA'2014, volume 8996 of LNCS, pages 21--30, 2014. [ bib ]
[PR14b] Kévin Perrot and Éric Rémila. Emergence of wave patterns on Kadanoff Sandpiles. In Proceedings of LATIN'2014, volume 8392 of LNCS, pages 634--645, 2014. preprint on arxiv:1312.4066. [ bib | arXiv ]
[PR13] Kévin Perrot and Éric Rémila. Kadanoff sand pile model. Avalanche structure and wave shape. Theoretical Computer Science, 504:52--72, 2013. preprint on arxiv:1304.5109. [ bib | arXiv ]
[PR12] Kévin Perrot and Éric Rémila. Kadanoff Sand Piles, following the snowball. Research report, page 26, 2012. on arxiv:1301.0997. [ bib | arXiv ]
[PPVP11] Kévin Perrot, Ha Duong Phan, and Trung Van Pham. On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. In Proceedings of AUTOMATA'2011, DMTCS, pages 17--28, 2011. available on arxiv:1207.0654. [ bib | arXiv ]
[PR11b] Kévin Perrot and Éric Rémila. Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. In Proceedings of MFCS'2011, volume 6907 of LNCS, pages 508--520, 2011. preprint on arxiv:1106.2670. [ bib | arXiv ]
[PR11a] Kévin Perrot and Éric Rémila. Avalanche Structure in the Kadanoff Sand Pile Model. In Proceedings of LATA'2011, volume 6638 of LNCS, pages 427--439, 2011. preprint on arxiv:1101.5940. [ bib | arXiv ]

Cellular Automata. You can give a try to this great simple simulator written in javascript by Charles Paperman.
[GMPT17] Eric Goles, Pedro Montealegre, Kévin Perrot, and Guillaume Theyssier. On the complexity of two-dimensional signed majority cellular automata. Submitted, 2017. preprint on hal:01472161. [ bib ]

Chip-firing game.
[PVP16] Kévin Perrot and Trung Van Pham. Chip-firing game and partial Tutte polynomial for Eulerian digraphs. Electronic Journal of Combinatorics, 23(1), 2016. freely available at combinatorics.org and also on arxiv:1306.0294. [ bib | arXiv ]
[PVP15] Kévin Perrot and Trung Van Pham. Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs. Annals of Combinatorics, 19:373--396, 2015. preprint on arxiv:1303.3708. [ bib | arXiv ]

Automata networks.
[MMPdOR17] Marco Montalva Medel, Kévin Perrot, Pedro de Oliveira, and Eurico Ruivo. Sensitivity to synchronism in some boolean automata networks. AUTOMATA'2017 exploratory papers, 2017. [ bib ]
[BGP+17] Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, and Guillaume Theyssier. On the cost of simulating a parallel boolean automata network by a block-sequential one. In Proceedings of TAMC'2017, volume 10185 of LNCS, pages 112--128, 2017. preprint on arxiv:1702.03101. [ bib | DOI | arXiv ]
[APS15] Aurore Alcolei, Kévin Perrot, and Sylvain Sené. On the flora of asynchronous locally non-monotonic Boolean automata networks. In Proceedings of SASB'2015, volume 326 of ENTCS, pages 3--25, 2015. preprint on arxiv:1510.05452. [ bib | arXiv ]

Contiguity and linearity graph encoding schemes.
[CLPP16] Christophe Crespelle, Tien-Nam Le, Kévin Perrot, and Thi Ha Duong Phan. Linearity is strictly more powerful than contiguity for encoding graphs. Discrete Mathematics, 339:2168--2177, 2016. [ bib ]
[CLPP15] Christophe Crespelle, Tien-Nam Le, Kévin Perrot, and Thi Ha Duong Phan. Linearity is strictly more powerful than contiguity for encoding graphs. In Proceedings of WADS'2015, volume 9214 of LNCS, pages 212--223, 2015. [ bib ]

Ecological population modeling.
[PNNP13] Kévin Perrot, Doanh Nguyen-Ngoc, and Ha Duong Phan. Effects of Migration of Three Competing Species on Their Distributions in Multizone Environment. In Proceedings of RIVF'2013, IEEE, pages 227--232, 2013. preprint on viasm.edu.vn. [ bib ]

Academic.
[Per13] Kévin Perrot. Les piles de sable Kadanoff. thesis, Ecole normale supérieure de lyon, 2013. [ bib ]

(this bibliography was generated with bibtex2html)