Phase transition of disordered random networks on quasi-transitive graphs
Yuelin Liu, Kainan Xiang

TL;DR
This paper investigates the phase transition between recurrence and transience in disordered biased random networks on quasi-transitive graphs, identifying conditions under which the transition occurs and its relation to the graph's structure.
Contribution
It establishes the existence and characterization of a non-trivial recurrence/transience phase transition in biased disordered networks on quasi-transitive graphs, including Cayley graphs and specific lattice structures.
Findings
Existence of a deterministic critical threshold $p_c^*$ for phase transition.
On $bZ^d$, $p_c^* = p_c$, the percolation threshold.
On $d$-regular trees, $p_c^* > p_c$, with explicit relation involving bias $lambda_1$.
Abstract
Given a quasi-transitive infinite graph with volume growth rate a transient biased electric network with bias and a recurrent biased one with bias Write for the Bernoulli- bond percolation on defined by the grand coupling. Let be the following biased disordered random network: Open edges in take the conductance , and closed edges in take the conductance . Our main results are as follows: (i) On connected quasi-transitive infinite graph with percolation threshold has a non-trivial recurrence/transience phase transition such that the threshold is deterministic, and almost surely is recurrent for …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Complex Network Analysis Techniques · Theoretical and Computational Physics
