Related papers: Rayleigh Random Flights on the Poisson line SIRSN
In this paper, we study the performance of non-fading and Rayleigh fading ad hoc networks. We first characterize the distribution of the signal-to-interference-plus-noise ratio (SINR) through the Laplace transform of the inverted SINR for…
Random Walks in Dirichlet Environment (RWDE) correspond to Random Walks in Random Environment (RWRE) on $\Bbb{Z}^d$ where the transition probabilities are i.i.d. at each site with a Dirichlet distribution. Hence, the model is parametrized…
We define natural probability measures on cycle-rooted spanning forests (CRSFs) on graphs embedded on a surface with a Riemannian metric. These measures arise from the Laplacian determinant and depend on the choice of a unitary connection…
Motivated by numerous questions in random geometry, given a smooth manifold $M$, we approach a systematic study of the differential topology of Gaussian random fields (GRF) $X:M\to \mathbb{R}^k$, that we interpret as random variables with…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
Random network models play a prominent role in modeling, analyzing and understanding complex phenomena on real-life networks. However, a key property of networks is often neglected: many real-world networks exhibit spatial structure, the…
Spartan Spatial Random Fields (SSRFs) are generalized Gibbs random fields, equipped with a coarse-graining kernel that acts as a low-pass filter for the fluctuations. SSRFs are defined by means of physically motivated spatial interactions…
Strongly Rayleigh distributions are a class of negatively dependent distributions of binary-valued random variables [Borcea, Branden, Liggett JAMS 09]. Recently, these distributions have played a crucial role in the analysis of algorithms…
We present Vector-Space Markov Random Fields (VS-MRFs), a novel class of undirected graphical models where each variable can belong to an arbitrary vector space. VS-MRFs generalize a recent line of work on scalar-valued, uni-parameter…
We consider random rectangles in $\mathbb{R}^2$ that are distributed according to a Poisson random measure, i.e., independently and uniformly scattered in the plane. The distributions of the length and the width of the rectangles are…
Random dynamical systems (RDS) evolve by a dynamical rule chosen independently with a certain probability, from a given set of deterministic rules. These dynamical systems in an interval reach a steady state with a unique well-defined…
Statistical Relational Learning (SRL) models have attracted significant attention due to their ability to model complex data while handling uncertainty. However, most of these models have been limited to discrete domains due to their…
We begin with isotropic Gaussian random fields, and show how the Bochner-Godement theorem gives a natural way to describe their covariance structure. We continue with a study of Mat\'ern processes on Euclidean space, spheres, manifolds and…
Random flights (also called run-and-tumble walks or transport processes) represent finite velocity random motions changing direction at any Poissonian time. These models in d-dimension, can be studied giving a general formulation of the…
We develop a new algorithm for the estimation of rare event probabilities associated with the steady-state of a Markov stochastic process with continuous state space $\mathbb R^d$ and discrete time steps (i.e. a discrete-time $\mathbb…
Modeling non-stationary processes, where statistical properties vary across the input domain, is a critical challenge in machine learning; yet most scalable methods rely on a simplifying assumption of stationarity. This forces a difficult…
We define a general class of random systems of horizontal and vertical weighted broken lines on the quarter plane whose distribution are proved to be translation invariant. This invariance stems from a reversibility property of the model.…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We present a perturbation theory by extending a prescription due to Feynman for computing the probability density function for the random flight motion. The method can be applied to a wide variety of otherwise difficult circumstances. The…