Related papers: Possible Connection between the Optimal Path and F…
A scaling theory is used to derive the dependence of the average number <k> of spanning clusters at threshold on the lattice size L. This number should become independent of L for dimensions d<6, and vary as log L at d=6. The predictions…
Macroscopic fluctuations have become an essential tool to understand physics far from equilibrium due to the link between their statistics and nonequilibrium ensembles. The optimal path leading to a fluctuation encodes key information on…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical…
We investigate the behavior of optimal alignment paths for homologous (related) and independent random sequences. An alignment between two finite sequences is optimal if it corresponds to the longest common subsequence (LCS). We prove the…
We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…
Clusters generated by the product-rule growth model of Achlioptas, D'Souza, and Spencer on a two-dimensional square lattice are shown to obey qualitatively different scaling behavior than standard (random growth) percolation. The threshold…
In some systems, the connecting probability (and thus the percolation process) between two sites depends on the geometric distance between them. To understand such process, we propose gravitationally correlated percolation models for…
We study the long-time behavior of the scaled walker (particle) position associated with decoupled continuous-time random walk which is characterized by superheavy-tailed distribution of waiting times and asymmetric heavy-tailed…
We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…
This work studies distributed algorithms for locally optimal load-balancing: We are given a graph of maximum degree $\Delta$, and each node has up to $L$ units of load. The task is to distribute the load more evenly so that the loads of…
We study target-searching processes on a percolation, on which a hunter tracks a target by smelling odors it emits. The odor intensity is supposed to be inversely proportional to the distance it propagates. The Monte Carlo simulation is…
Persistence diagrams (PDs) are now routinely used to summarize the underlying topology of complex data. Despite several appealing properties, incorporating PDs in learning pipelines can be challenging because their natural geometry is not…
The properties of a particle diffusing on a one-dimensional lattice where at each site a random barrier and a random trap act simultaneously on the particle are investigated by numerical and analytical techniques. The combined effect of…
Diffusion models have recently outperformed alternative approaches to model the distribution of natural images, such as GANs. Such diffusion models allow for deterministic sampling via the probability flow ODE, giving rise to a latent space…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
Controllability, a basic property of various networked systems, has gained profound theoretical applications in complex social, technological, biological, and brain networks. Yet, little attention has been given to the control trajectory…
By optimal fluctuation method, we study short-time distribution $P(\mathcal{A}=A)$ of the functionals, $\mathcal{A}=\int_{0}^{t_f} x^n(t) dt$, along constrained trajectories of random acceleration process for a given time duration $t_f$,…
Since quantum spatial searches on complex networks have a strong network dependence, the question arises whether the universal perspective exists in this quantum algorithm for complex networks. Here, we uncover the universal scaling laws of…
We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal length of an increasing path through a Poisson point process (or a Bernoulli point process) with the restriction that there must be minimal…