Related papers: Random wavelet series based on a tree-indexed Mark…
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random nxn matrix L defined by L(j,k)=X(j,k) if k<>j and…
We achieve the multifractal analysis of a class of complex valued statistically self-similar continuous functions. For we use multifractal formalisms associated with pointwise oscillation exponents of all orders. Our study exhibits new…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
We present a general M-estimation framework for inference on the wavelet variance. This framework generalizes the results on the scale-wise properties of the standard estimator and extends them to deliver the joint asymptotic properties of…
We prove singularity of some distributions of random continued fractions that correspond to iterated function systems with overlap and a parabolic point. These arose while studying the conductance of Galton-Watson trees.
We present a novel way to characterize the structure of complex networks by studying the statistical properties of the trajectories of random walks over them. We consider time series corresponding to different properties of the nodes…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
Let $\{X_n\}_{n\in\N}$ be a Markov chain on a measurable space $\X$ with transition kernel $P$ and let $V:\X\r[1,+\infty)$. The Markov kernel $P$ is here considered as a linear bounded operator on the weighted-supremum space $\cB_V$…
We consider a branching model in discrete time where each individual has a trait in some general state space. Both the reproduction law and the trait inherited by the offsprings may depend on the trait of the mother and the environment. We…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…
In this paper, we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this…
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…
Let $\{(X_i,Y_i)\}_{i\in \{1,..., n\}}$ be an i.i.d. sample from the random design regression model $Y=f(X)+\epsilon$ with $(X,Y)\in [0,1]\times [-M,M]$. In dealing with such a model, adaptation is naturally to be intended in terms of…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
The upper extremes of a Markov chain with regulary varying stationary marginal distribution are known to exhibit under general conditions a multiplicative random walk structure called the tail chain. More generally, if the Markov chain is…
This paper studies the synchronization of a finite number of Kuramoto oscillators in a frequency-dependent bidirectional tree network. We assume that the coupling strength of each link in each direction is equal to the product of a common…