activity
19942026
most citedRanking graphs through Markov chains and hitting times

1 citations · 3 across the 13 of their papers we have counts for

collaborators

13 papers

cs.GT2026

Strategic Partitioning and Manipulability in Two-Round Elections

Emilio De Santis, Antonio Di Crescenzo, Verdiana Mustaro

We consider a two-round election model involving voters and candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the…

q-bio.NC2026

Synaptic Classification via Spike-Triggered Extrapolation

Emilio De Santis

This work introduces a statistical procedure to infer the interaction graph of neuronal networks modeled by Galves-Löcherbach dynamics. The methodology performs bivariate inference…

math.PR2025

A new look at perfect simulation for chains with infinite memory

Emilio De Santis, Kádmo Laxa, Eva Löcherbach

In this article we introduce two new perfect simulation algorithms for chains with infinite memory. Both algorithms belong to the coupling of past procedures. The novelty of our ap…

math.ST2021

Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons

Emilio De Santis, Antonio Galves, Giovanna Nappo +1

We address the questions of identifying pairs of interacting neurons from the observation of their spiking activity. The neuronal network is modeled by a system of interacting poin…

math.PR2019★ 1 cited

Ranking graphs through Markov chains and hitting times

Emilio De Santis

In the present paper we show that for any given digraph , i.e. an oriented graph without self-loops and 2-cycles, one can construct a 1-dependent Markov…

math.PR2019

Constrained Monte Carlo Markov Chains on Graphs

Roy Cerqueti, Emilio De Santis

This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical…