Is a random walk on an isoradial graph transient? The 2019 Stack Overflow Developer Survey Results Are InDefinition: transient random walkRandom walk on finite graphRandom walk on a graphShow a random walk is transientSimple random walk on $mathbb Z^d$ and its generatorDetermining transient or recurrent states on a random walkRandom walk on complete graphInductive definition of a random walk?Reference for mixing time for periodic random walksExpected number of steps before leaving a ball

Dual Citizen. Exited the US on Italian passport recently

Is it possible for the two major parties in the UK to form a coalition with each other instead of a much smaller party?

What is the steepest angle that a canal can be traversable without locks?

Understanding the implication of what "well-defined" means for the operation in quotient group

Which Sci-Fi work first showed weapon of galactic-scale mass destruction?

Why can Shazam do this?

Geography at the pixel level

What tool would a Roman-age civilization have to grind silver and other metals into dust?

How come people say “Would of”?

"Riffle" two strings

How to manage monthly salary

Is domain driven design an anti-SQL pattern?

What is the best strategy for white in this position?

Why is Grand Jury testimony secret?

Could JWST stay at L2 "forever"?

Why don't Unix/Linux systems traverse through directories until they find the required version of a linked library?

Is flight data recorder erased after every flight?

What is the motivation for a law requiring 2 parties to consent for recording a conversation

What is the meaning of Triage in Cybersec world?

Does light intensity oscillate really fast since it is a wave?

Extreme, unacceptable situation and I can't attend work tomorrow morning

CiviEvent: Public link for events of a specific type

Are USB sockets on wall outlets live all the time, even when the switch is off?

Does a dangling wire really electrocute me if I'm standing in water?



Is a random walk on an isoradial graph transient?



The 2019 Stack Overflow Developer Survey Results Are InDefinition: transient random walkRandom walk on finite graphRandom walk on a graphShow a random walk is transientSimple random walk on $mathbb Z^d$ and its generatorDetermining transient or recurrent states on a random walkRandom walk on complete graphInductive definition of a random walk?Reference for mixing time for periodic random walksExpected number of steps before leaving a ball










0












$begingroup$


Is the random walk on an isoradial graph defined in Chelkak and Smirnov (2011) (in pages 3-4) transient?



Let us define the random walk on an isoradial graph $Gamma$ starting from $x$ by,
beginequation
X_t = X_0 + sum_j=0^t-1 xi_X_j^(j),
endequation

where $X_0 = x$ and the increments $xi_u^(t)$ are independently and identically distributed for fixed vertex $u in Gamma$ and for all $t in mathbbN$. These are distributed according to,
beginequation
mathbbP(xi_u = u_k - u) = fractantheta_ksum_s=1^ntantheta_s,
endequation

for $u_k$ $sim$ $u$ are adjacent vertices in $Gamma$. The half-angle of the rhombus is denoted by $theta_k$. These are uniformly bounded from $0$ and $pi/2$.



I am hesitating whether $(X_t)$ is transient? For fixed $u_0 in Gamma$ and given the mesh size $delta > 0$, the free Green's function is finite: $G(u_0,u_0) = frac12pi(log delta - gamma_Euler -log 2) < infty$. Does this imply that $(X_t)$ is transient? In the light of Pólya's theorem this feels counter-intuitive. Since increments of $(X_t)$ have zero expectations, that is $mathbbE(Re xi_u) = 0 $, $mathbbE(Im xi_u) = 0 $, and $Gamma$ is embedded in $mathbbC simeq mathbbR^2$, one may expect that $(X_t)$ is recurrent.



Thank you for your time.










share|cite|improve this question











$endgroup$
















    0












    $begingroup$


    Is the random walk on an isoradial graph defined in Chelkak and Smirnov (2011) (in pages 3-4) transient?



    Let us define the random walk on an isoradial graph $Gamma$ starting from $x$ by,
    beginequation
    X_t = X_0 + sum_j=0^t-1 xi_X_j^(j),
    endequation

    where $X_0 = x$ and the increments $xi_u^(t)$ are independently and identically distributed for fixed vertex $u in Gamma$ and for all $t in mathbbN$. These are distributed according to,
    beginequation
    mathbbP(xi_u = u_k - u) = fractantheta_ksum_s=1^ntantheta_s,
    endequation

    for $u_k$ $sim$ $u$ are adjacent vertices in $Gamma$. The half-angle of the rhombus is denoted by $theta_k$. These are uniformly bounded from $0$ and $pi/2$.



    I am hesitating whether $(X_t)$ is transient? For fixed $u_0 in Gamma$ and given the mesh size $delta > 0$, the free Green's function is finite: $G(u_0,u_0) = frac12pi(log delta - gamma_Euler -log 2) < infty$. Does this imply that $(X_t)$ is transient? In the light of Pólya's theorem this feels counter-intuitive. Since increments of $(X_t)$ have zero expectations, that is $mathbbE(Re xi_u) = 0 $, $mathbbE(Im xi_u) = 0 $, and $Gamma$ is embedded in $mathbbC simeq mathbbR^2$, one may expect that $(X_t)$ is recurrent.



    Thank you for your time.










    share|cite|improve this question











    $endgroup$














      0












      0








      0





      $begingroup$


      Is the random walk on an isoradial graph defined in Chelkak and Smirnov (2011) (in pages 3-4) transient?



      Let us define the random walk on an isoradial graph $Gamma$ starting from $x$ by,
      beginequation
      X_t = X_0 + sum_j=0^t-1 xi_X_j^(j),
      endequation

      where $X_0 = x$ and the increments $xi_u^(t)$ are independently and identically distributed for fixed vertex $u in Gamma$ and for all $t in mathbbN$. These are distributed according to,
      beginequation
      mathbbP(xi_u = u_k - u) = fractantheta_ksum_s=1^ntantheta_s,
      endequation

      for $u_k$ $sim$ $u$ are adjacent vertices in $Gamma$. The half-angle of the rhombus is denoted by $theta_k$. These are uniformly bounded from $0$ and $pi/2$.



      I am hesitating whether $(X_t)$ is transient? For fixed $u_0 in Gamma$ and given the mesh size $delta > 0$, the free Green's function is finite: $G(u_0,u_0) = frac12pi(log delta - gamma_Euler -log 2) < infty$. Does this imply that $(X_t)$ is transient? In the light of Pólya's theorem this feels counter-intuitive. Since increments of $(X_t)$ have zero expectations, that is $mathbbE(Re xi_u) = 0 $, $mathbbE(Im xi_u) = 0 $, and $Gamma$ is embedded in $mathbbC simeq mathbbR^2$, one may expect that $(X_t)$ is recurrent.



      Thank you for your time.










      share|cite|improve this question











      $endgroup$




      Is the random walk on an isoradial graph defined in Chelkak and Smirnov (2011) (in pages 3-4) transient?



      Let us define the random walk on an isoradial graph $Gamma$ starting from $x$ by,
      beginequation
      X_t = X_0 + sum_j=0^t-1 xi_X_j^(j),
      endequation

      where $X_0 = x$ and the increments $xi_u^(t)$ are independently and identically distributed for fixed vertex $u in Gamma$ and for all $t in mathbbN$. These are distributed according to,
      beginequation
      mathbbP(xi_u = u_k - u) = fractantheta_ksum_s=1^ntantheta_s,
      endequation

      for $u_k$ $sim$ $u$ are adjacent vertices in $Gamma$. The half-angle of the rhombus is denoted by $theta_k$. These are uniformly bounded from $0$ and $pi/2$.



      I am hesitating whether $(X_t)$ is transient? For fixed $u_0 in Gamma$ and given the mesh size $delta > 0$, the free Green's function is finite: $G(u_0,u_0) = frac12pi(log delta - gamma_Euler -log 2) < infty$. Does this imply that $(X_t)$ is transient? In the light of Pólya's theorem this feels counter-intuitive. Since increments of $(X_t)$ have zero expectations, that is $mathbbE(Re xi_u) = 0 $, $mathbbE(Im xi_u) = 0 $, and $Gamma$ is embedded in $mathbbC simeq mathbbR^2$, one may expect that $(X_t)$ is recurrent.



      Thank you for your time.







      random-walk planar-graph






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 30 at 16:21







      Marius

















      asked Mar 30 at 11:29









      MariusMarius

      13




      13




















          0






          active

          oldest

          votes












          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "69"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3168197%2fis-a-random-walk-on-an-isoradial-graph-transient%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















          draft saved

          draft discarded
















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3168197%2fis-a-random-walk-on-an-isoradial-graph-transient%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

          Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

          Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ