Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTransition matrix from a random walk
119
0
0.0
(
0
)
Authors
Lawrence S. Schulman
Ask ChatGPT about the research
No Arabic abstract
Given a random walk a method is presented to produce a matrix of transition probabilities that is consistent with that random walk. The method is a kind of reverse application of the usual ergodicity and is tested by using a transition matrix to produce a path and then using that path to create the estimate. The two matrices and their predictions are then compared. A variety of situations test the method, random matrices, metastable configurations (for which ergodicity often does not apply) and explicit violation of detailed balance.
rate research
Read More
A random matrix model of black holes is given based on analysis of Gaussian complex ensembles, based on the generalization of chRMT of QCD. Spacetime freedoms are incorporated in terms of eigenvalues of the ensemble. Classical observables of black holes can be computed using this model and it satisfies asymptotic freedom and holographic principle.
We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph $G$, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of $G$. As applications, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial $$L_alpha(G)=D-sum_{r=1}^dalpha_rD(D^{-1}A)^r$$ where $A$ is the adjacency matrix of a weighted, undirected graph, $D$ is the diagonal matrix of weighted degrees, and $alpha=(alpha_1...alpha_d)$ are nonnegative coefficients with $sum_{r=1}^dalpha_r=1$. Recall that $D^{-1}A$ is the transition matrix of random walks on the graph. The sparsification of $L_alpha(G)$ appears to be algorithmically challenging as the matrix power $(D^{-1}A)^r$ is defined by all paths of length $r$, whose precise calculation would be prohibitively expensive. In this paper, we develop the first nearly linear time algorithm for this sparsification problem: For any $G$ with $n$ vertices and $m$ edges, $d$ coefficients $alpha$, and $epsilon > 0$, our algorithm runs in time $O(d^2mlog^2n/epsilon^{2})$ to construct a Laplacian matrix $tilde{L}=D-tilde{A}$ with $O(nlog n/epsilon^{2})$ non-zeros such that $tilde{L}approx_{epsilon}L_alpha(G)$. Matrix polynomials arise in mathematical analysis of matrix functions as well as numerical solutions of matrix equations. Our work is particularly motivated by the algorithmic problems for speeding up the classic Newtons method in applications such as computing the inverse square-root of the precision matrix of a Gaussian random field, as well as computing the $q$th-root transition (for $qgeq1$) in a time-reversible Markov model. The key algorithmic step for both applications is the construction of a spectral sparsifier of a constant degree random-walk matrix-polynomials introduced by Newtons method. Our algorithm can also be used to build efficient data structures for effective resistances for multi-step time-reversible Markov models, and we anticipate that it could be useful for other tasks in network analysis.
In this paper we consider a particular version of the random walk with restarts: random reset events which bring suddenly the system to the starting value. We analyze its relevant statistical properties like the transition probability and show how an equilibrium state appears. Formulas for the first-passage time, high-water marks and other extreme statistics are also derived: we consider counting problems associated naturally to the system. Finally we indicate feasible generalizations useful for interpreting different physical effects.
We experimentally study the motion of light-activated colloidal microswimmers in a viscoelastic fluid. We find that, in such a non-Newtonian environment, the active colloids undergo an unexpected transition from enhanced angular diffusion to persistent rotational motion above a critical propulsion speed, despite their spherical shape and stiffness. We observe that, in contrast to chiral asymmetric microswimmers, the resulting circular orbits can spontaneously reverse their sense of rotation and exhibit an angular velocity and a radius of curvature that non-linearly depend on the propulsion speed. By means of a minimal non-Markovian Langevin model for active Brownian motion, we show that these non-equilibrium effects emerge from the delayed response of the fluid with respect to the self-propulsion of the particle without counterpart in Newtonian fluids.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
