Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information ga...

We consider Bayesian inference in sequential latent variable models in general, and in nonlinear state space models in particular (i.e., state smoothing). We work with sequential Monte Carlo (SMC) algorithms, which provide a powerful inference framework for addressing this problem. However, for certain challenging and common model classes the state-of-the-art algorithms still struggle. The work...

Interactive epistemology in dynamic games studies forms of strategic reasoning like backward and forward induction by means of a formal representation of players’ beliefs about each other, conditional on each history. Work on this topic typically relies on epistemic models where states of the world specify both strategies and beliefs. Strategies are conjunctions of behavioral conditionals of th...

Nowadays Radio Frequency Identification (RFID) systems have appeared in lots of identification and authentication applications. In some sensitive applications, providing secure and confidential communication is very important for end-users. To this aim, different RFID authentication protocols have been proposed, which have tried to provide security and privacy of RFID users. In this paper, we a...

We study two different models of a turn-based game called the Marble Drop Game, which is an experimental paradigm designed to investigate higher-order social reasoning. Our first model is a computational-level description of the game, associating cognitive difficulty of a game trial with its structural properties. Our second model is an algorithmiclevel model postulating a forward reasoning plu...

Aumann has proved that common knowledge of substantive ratio-nality implies the backwards induction solution in games of perfect information. Stalnaker has proved that it does not. Roughly speaking , a player is substantively rational if, for all vertices v, if the player were to reach vertex v, then the player would be rational at vertex v". It is shown here that the key diierence between Auma...

Collisional energy-transfer probability distribution functions of highly vibrationally excited molecules and the existence of supercollisions remain as the outstanding questions in the field of intermolecular energy transfer. In this investigation, collisional interactions between ground state Kr atoms and highly vibrationally excited azulene molecules (4.66 eV internal energy) were examined at...

The problem of one-dimensional diffusion with random traps is solved without and with a constant field of force. Using an eigenvalue expansion for long times and the method of images for short times we give an exact, straightforward solution for the time dependence of the mean survival probability and the mean probability density for returning to the origin. Using the backward equation approach...

Transient noise analysis means time domain simulation of noisy electronic circuits. We consider mathematical models where the noise is taken into account by means of sources of Gaussian white noise that are added to the deterministic network equations, leading to systems of stochastic differential algebraic equations (SDAEs). A crucial property of the arising SDAEs is the large number of small ...

We investigate an extension of the notion of backward induction to dynamic games with imperfect information and provide a doxastic characterization of it. Extensions of the idea of backward induction were proposed by [1] and later by [2], who also provided a doxastic characterization in terms of the notion of common belief of future rationality. The characterization we propose, although differe...