Related papers: Nonlinear q-voter model with deadlocks on the Watt…
We study large time behavior of quantum walks (QW) with self-dependent coin. In particular, we show scattering and derive the reproducing formula for inverse scattering in the weak nonlinear regime. The proof is based on space-time estimate…
Variable selection problem for the nonlinear Cox regression model is considered. In survival analysis, one main objective is to identify the covariates that are associated with the risk of experiencing the event of interest. The Cox…
We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…
We introduce and study the reverse voter model, a dynamics for spin variables similar to the well-known voter dynamics. The difference is in the way neighbors influence each other: once a node is selected and one among its neighbors chosen,…
People often face the challenge of choosing among different options with similar attractiveness. To study the distribution of preferences that emerge in such situations, a useful approach is to simulate opinion dynamics on top of complex…
This paper considers the stability analysis for nonlinear sampled-data systems with failures in the feedback loop. The failures are caused by shared resources, and modeled by a weakly hard real-time (WHRT) dropout description. The WHRT…
Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process…
In this paper we explore the life expectancy limits by based on the stochastic modeling of mortality and applying the first exit or hitting time theory of a stochastic process. The main assumption is that the health state or the "vitality",…
A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of…
We analyze purely competitive many-species Lotka-Volterra systems with random interaction matrices, focusing the attention on statistical properties of their asymptotic states. Generic features of the evolution are outlined from a…
In this work, we investigate the temporal evolution of the degree of a given vertex in a network by mapping the dynamics into a random walk problem in degree space. We analyze when the degree approximates a pre-established value through a…
In this paper we consider a fractional stochastic volatility model, that is a model in which the volatility may exhibit a long-range dependent or a rough/antipersistent behavior. We propose a dynamic sequential Monte Carlo methodology that…
We study the binary $q$-voter model with generalized anticonformity on random Erd\H{o}s-R\'enyi graphs. In such a model, two types of social responses, conformity and anticonformity, occur with complementary probabilities and the size of…
This paper presents a simple model that mimics quantum mechanics (QM) results without using complex wavefunctions or non-localities. The proposed model only uses integer-valued quantities and arithmetic operations, in particular assuming a…
Simultaneous recordings from many neurons hide important information and the connections characterizing the network remain generally undiscovered despite the progresses of statistical and machine learning techniques. Discerning the presence…
We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing a vertex set, each with its own bounded degree distribution…
In the classical leader election procedure all players toss coins independently and those who get tails leave the game, while those who get heads move to the next round where the procedure is repeated. We investigate a generalizion of this…
I examine the mean consensus time (i.e., exit time) of the voter model in the so-called two-clique graph. The two-clique graph is composed of two cliques interconnected by some links and considered as a toy model of networks with community…
Using non-linear difference equations, combined with symbolic computations, we make a detailed study of the running times of numerous variants of the celebrated Quicksort algorithms, where we consider the variants of single-pivot and…
Consider a set of terminal nodes K that belong to a network whose nodes are connected by links that fail independently with known probabilities. We introduce a method for estimating any performability measure that depends on the hop…