Related papers: Asymptotic adaptive threshold for connectivity in …
The independent cascade model is a widely used framework for simulating the spread of influence in social networks. In this model, activations propagate stochastically through the network, with each edge having a probability of transmitting…
Network models with preferential attachment, where new nodes are injected into the network and form links with existing nodes proportional to their current connectivity, have been well studied for some time. Extensions have been introduced…
Consider a stationary renewal point process on the real line and divide each of the segments it defines in a proportion given by \iid realisations of a fixed distribution $G$ supported by [0,1]. We ask ourselves for which interpoint…
Consider the following random spatial network: in a large disk, construct a network using a stationary and isotropic Poisson line process of unit intensity. Connect pairs of points using the network, with initial / final segments of the…
Preferential attachment --- by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree --- has become the standard growth model for scale-free networks, where the asymptotic probability of a node…
The emergence of social networks and the definition of suitable generative models for synthetic yet realistic social graphs are widely studied problems in the literature. By not being tied to any real data, random graph models cannot…
We study metanetworks arising in genotype and phenotype spaces, in the context of a model population of Boolean graphs evolved under selection for short dynamical attractors. We define the adjacency matrix of a graph as its genotype, which…
We analyze a class of stochastic processes, referred to as asynchronous and semi-anonymous dynamics (ASD), over directed labeled random networks. These processes are a natural tool to describe general best-response and noisy best-response…
We present a modeling framework for dynamical and bursty contact networks made of agents in social interaction. We consider agents' behavior at short time scales, in which the contact network is formed by disconnected cliques of different…
In image detection, one problem is to test whether the set, though mostly consisting of uniformly scattered points, also contains a small fraction of points sampled from some (a priori unknown) curve, for example, a curve with…
We establish the convergence rates and asymptotic distributions of the common break change-point estimators, obtained by least squares and maximum likelihood in panel data models and compare their asymptotic variances. Our model assumptions…
Networks of coupled degrade-and-fire (DF) oscillators are simple dynamical models of assemblies of interacting self-repressing genes. For mean-field interactions, which most mathematical studies have assumed so far, every trajectory must…
This work analyzes the problem of community structure in real-world networks based on the synchronization of nonidentical coupled chaotic R\"{o}ssler oscillators each one characterized by a defined natural frequency, and coupled according…
A navigation on a set of points $S$ is a rule for choosing which point to move to from the present point in order to progress toward a specified target. We study some navigations in the plane where $S$ is a non uniform Poisson point process…
In this paper, we study the connectivity in one-dimensional ad hoc wireless networks with an fixed access point. In recent years, various closed expressions for the probability of connectivity on one-dimensional networks (interval graphs)…
We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the…
In this paper, an information theoretic analysis on non-adaptive group testing schemes based on sparse pooling graphs is presented. The binary status of the objects to be tested are modeled by i.i.d. Bernoulli random variables with…
We study interacting particle systems on the real line which generalize the Hammersley process [D. Aldous and P. Diaconis, Prob. Theory Relat. Fields 103, 199-213 (1995)]. Particles jump to the right to a randomly chosen point between their…
Consider the following asynchronous, opportunistic communication model over a graph $G$: in each round, one edge is activated uniformly and independently at random and (only) its two endpoints can exchange messages and perform local…
We study connectivity properties in a probabilistic model for a large mobile ad-hoc network. We consider a large number of participants of the system moving randomly, independently and identically distributed in a large domain, with a…