Related papers: Construction and convergence results for stable we…
Boolean networks are a popular modeling framework in computational biology to capture the dynamics of molecular networks, such as gene regulatory networks. It has been observed that many published models of such networks are defined by…
It has been recently proposed that the natural connectivity can be used to characterize efficiently the robustness of complex networks. The natural connectivity quantifies the redundancy of alternative routes in the network by evaluating…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
Establishing the convergence of splines can be cast as a variational problem which is amenable to a $\Gamma$-convergence approach. We consider the case in which the regularization coefficient scales with the number of observations, $n$, as…
We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…
We bound the time it takes for a group of birds to reach steady state in a standard flocking model. We prove that (i) within single exponential time fragmentation ceases and each bird settles on a fixed flying direction; (ii) the flocking…
We consider trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of…
Previously, Sarkar and Sun have shown that for supercritical oriented percolation in dimension $1+1$, the set of rightmost infinite open paths converges to the Brownian web after proper centering and scaling. In this note, we show that a…
Some asymptotic properties of a Brownian motion in multifractal time, also called multifractal random walk, are established. We show the almost sure and $L^1$ convergence of its structure function. This is an issue directly connected to the…
Using the framework of random walks in random scenery, Cohen and Samorodnitsky (2006) introduced a family of symmetric $\alpha$-stable motions called local time fractional stable motions. When $\alpha=2$, these processes are precisely…
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
Restrictions to molecular motion by barriers (membranes) are ubiquitous in biological tissues, porous media and composite materials. A major challenge is to characterize the microstructure of a material or an organism nondestructively using…
We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph…
We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…
We study the influence that population density and the road network have on each others' growth and evolution. We use a simple model of formation and evolution of city roads which reproduces the most important empirical features of street…
This paper presents a framework for the study of convergence when the nodes' dynamics may be both piecewise smooth and/or nonidentical across the network. Specifically, we derive sufficient conditions for global convergence of all node…
The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been tackled recently by characterizing the properties of its representative graphs…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…