Zobrazeno 1 - 10
of 99
pro vyhledávání: '"De Santis, Emilio"'
Autor:
De Baets, Bernard, De Santis, Emilio
A set of $2^n$ candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next round until
Externí odkaz:
http://arxiv.org/abs/2407.01382
Autor:
De Santis, Emilio, Lelli, Leonardo
We study the zero-temperature stochastic Ising model on some connected planar quasi-transitive graphs, which are invariant under rotation and translation. The initial spin configuration is distributed according to a Bernoulli product measure with par
Externí odkaz:
http://arxiv.org/abs/2306.16816
Autor:
De Santis, Emilio, Spizzichino, Fabio
Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose we use res
Externí odkaz:
http://arxiv.org/abs/2205.15679
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 point processes with memory of variable length. The influence of a neuron
Externí odkaz:
http://arxiv.org/abs/2106.07529
Autor:
De Santis, Emilio, Spizzichino, Fabio
In this paper we present a study about minima among random variables, about the context of voting theory, and about paradoxes related with such topics. In the field of reliability theory, the term load-sharing model is commonly used to designate a sp
Externí odkaz:
http://arxiv.org/abs/2004.09417
Autor:
De Santis, Emilio
In the present paper we show that for any given digraph $\mathbb{G} =([n], \vec{E})$, i.e. an oriented graph without self-loops and 2-cycles, one can construct a 1-dependent Markov chain and $n$ identically distributed hitting times $T_1, \ldots , T_
Externí odkaz:
http://arxiv.org/abs/1908.11296
Autor:
Cerqueti, Roy, De Santis, Emilio
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 distribution converges to a given reference one. The Markov chain is
Externí odkaz:
http://arxiv.org/abs/1907.00779
Autor:
De Santis, Emilio, Piccioni, Mauro
This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on $\mathbb{Z}^2$ s
Externí odkaz:
http://arxiv.org/abs/1906.02048
The notion of stochastic precedence between two random variables emerges as a relevant concept in several fields of applied probability. When one consider a vector of random variables $X_1,...,X_n$, this notion has a preeminent role in the analysis o
Externí odkaz:
http://arxiv.org/abs/1905.06829
Autor:
Cerqueti, Roy1,2 (AUTHOR) roy.cerqueti@uniroma1.it, De Santis, Emilio3 (AUTHOR)
Publikováno v:
Journal of the Operational Research Society. Oct2024, Vol. 75 Issue 10, p1979-1988. 10p.
